Concurrent access to shared data in preemptive multi-tasks environment and in multi-processors architecture have been subject to many works. Based on these works, we present a new algorithm to implements lock-free fifo stacks with a minimum constraints on the data structure. Compared to the previous solutions, this algorithm is more simple and more efficient. We'll present its implementation and it's performances
We present a fast and scalable lock algorithm for shared-memory multiprocessors addressing the resou...
In this paper, we present two new FIFO dual queues. Like all dual queues, they arrange for dequeue o...
Designing and implementing high-performance concurrent data structures whose access performance scal...
Concurrent access to shared data in preemptive multi-tasks environment and in multi-processors archi...
A lock-free FIFO queue data structure is presented in this paper. The algorithm supports multiple pr...
We have proposed algorithms for lock-free lifo and fifo queue management. This technical report prop...
We present a new lock-free multiple-producer and multiple-consumer (MPMC) FIFO queue design which is...
Abstract. We introduce fast and scalable algorithms that implement bounded-and unbounded-size lock-f...
A non-blocking FIFO queue algorithm for multiprocessor shared memory systems is presented in this pa...
A concurrent data object is lock-free if it guarantees that at least one, among all concurrent opera...
Most multiprocessors are multiprogrammed to achieve acceptable response time. Unfortunately, inoppor...
In order to guarantee that each method of a data structure updates the logical state exactly once, a...
Most multiprocessors are multiprogrammed in order to achieve acceptable response time and to increas...
Most multiprocessors are multiprogrammed to achieve accept-able response time. Unfortunately, inoppo...
Conventional wisdom in designing concurrent data structures is to use the most powerful synchronizat...
We present a fast and scalable lock algorithm for shared-memory multiprocessors addressing the resou...
In this paper, we present two new FIFO dual queues. Like all dual queues, they arrange for dequeue o...
Designing and implementing high-performance concurrent data structures whose access performance scal...
Concurrent access to shared data in preemptive multi-tasks environment and in multi-processors archi...
A lock-free FIFO queue data structure is presented in this paper. The algorithm supports multiple pr...
We have proposed algorithms for lock-free lifo and fifo queue management. This technical report prop...
We present a new lock-free multiple-producer and multiple-consumer (MPMC) FIFO queue design which is...
Abstract. We introduce fast and scalable algorithms that implement bounded-and unbounded-size lock-f...
A non-blocking FIFO queue algorithm for multiprocessor shared memory systems is presented in this pa...
A concurrent data object is lock-free if it guarantees that at least one, among all concurrent opera...
Most multiprocessors are multiprogrammed to achieve acceptable response time. Unfortunately, inoppor...
In order to guarantee that each method of a data structure updates the logical state exactly once, a...
Most multiprocessors are multiprogrammed in order to achieve acceptable response time and to increas...
Most multiprocessors are multiprogrammed to achieve accept-able response time. Unfortunately, inoppo...
Conventional wisdom in designing concurrent data structures is to use the most powerful synchronizat...
We present a fast and scalable lock algorithm for shared-memory multiprocessors addressing the resou...
In this paper, we present two new FIFO dual queues. Like all dual queues, they arrange for dequeue o...
Designing and implementing high-performance concurrent data structures whose access performance scal...