A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems
Open Access
- 3 July 2001
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 134-143
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory MultiprocessorsJournal of Parallel and Distributed Computing, 1998
- Starfire: extending the SMP envelopeIEEE Micro, 1998
- The SPLASH-2 programs1995
- A nonblocking algorithm for shared queues using compare-and-swapIEEE Transactions on Computers, 1994
- Empirical studies of competitve spinning for a shared-memory multiprocessor1991
- The effect of scheduling discipline on spin overhead in shared memory parallel systemsIEEE Transactions on Parallel and Distributed Systems, 1991
- Algorithms for scalable synchronization on shared-memory multiprocessorsACM Transactions on Computer Systems, 1991
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- Specifying Concurrent Program ModulesACM Transactions on Programming Languages and Systems, 1983