Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Modern rendering systems are confronted with a dauntingly large and growing set of requirements: in their pursuit of realism, physically based techniques must increasingly account for intricate properties of light, such as its spectral composition or polar ...

A method for generating a data structure to digitally represent a geometrical object based on H-splines, the method being performed on a computer device having a data processor and memory, the method including the steps of creating a first data structure a ...

Traditional data management systems map information using centralized and static data structures. Modern applications need to process in real time datasets much larger than system memory. To achieve this, they use dynamic entities that are updated with str ...

Non-Volatile Memory offers the possibility of implementing high-performance, durable data structures. However, achieving performance comparable to well-designed data structures in non-persistent (transient) memory is difficult, primarily because of the cos ...

Numerical simulation of Pelton turbine hydrodynamics is helpful to identify the energy loss mechanisms in the runner and minimize their effect. However, it is a challenging task that involves handling the unsteady free surface flow and moving boundaries re ...

Graph processing systems are used in a wide variety of fields, ranging from biology to social networks. Algorithms to mine graphs incur many random accesses, and the sparse nature of the graphs of interest, exacerbates this. As DRAM sustains high bandwidt ...

In the last decade, Ultra High Performance Fibre Reinforced cement-based Composites (UHPFRC) have been increasingly implemented for rehabilitation and strengthening purposes, rendering outstanding results. The ease of application, along with their superior ...

We propose an online algorithm for sequential learning in the contextual multiarmed bandit setting. Our approach is to partition the context space and, then, optimally combine all of the possible mappings between the partition regions and the set of bandit ...

Non-volatile RAM (NVRAM) makes it possible for data structures to tolerate transient failures, assuming however that programmers have designed these structures such that their consistency is preserved upon recovery. Previous ap- proaches are typically tran ...

Direct simulation Monte-Carlo (DSMC) is the most established method for rarefied gas flow simulations. It is valid from continuum to near vacuum, but in cases involving small Knudsen numbers (Kn), it suffers from high computational cost. The Fokker-Planck ...

Wikipedia is a rich and invaluable source of information. Its central place on the Web makes it a particularly interesting object of study for scientists. Researchers from different domains used various complex datasets related to Wikipedia to study langua ...

Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free

Chat with Graph Search

Mitsuba 2: A Retargetable Forward and Inverse Renderer

Method and system for the creation of an h-spline based data structure, data storage, and data representation

Data stream statistics over sliding windows: How to summarize 150 Million updates per second on a single node

Fine-Grain Checkpointing with In-Cache-Line Logging

GPU-Accelerated Finite Volume Particle Simulation of Free Jet Deviation by Multi-jet Rotating Pelton Runner

Efficient large-scale graph processing: optimisations for storage, performance and evolving graphs

Towards the use of UHPFRC in railway bridges: the rehabilitation of Buna Bridge

Asymptotically Optimal Contextual Bandit Algorithm Using Hierarchical Structures

Log-Free Concurrent Data Structures

Controlling the bias error of Fokker- Planck methods for rarefied gas dynamics simulations

A Graph-structured Dataset for Wikipedia Research

Log-Free Concurrent Data Structures