A scalable lock-free stack algorithm
Authors:
Open Access
- 27 June 2004
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 206-215
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Combining Funnels: A Dynamic Approach to Software CombiningJournal of Parallel and Distributed Computing, 2000
- Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory MultiprocessorsJournal of Parallel and Distributed Computing, 1998
- Diffracting treesACM Transactions on Computer Systems, 1996
- Scalable concurrent countingACM Transactions on Computer Systems, 1995
- A methodology for implementing highly concurrent data objectsACM Transactions on Programming Languages and Systems, 1993
- Waiting algorithms for synchronization in large-scale multiprocessorsACM Transactions on Computer Systems, 1993
- Algorithms for scalable synchronization on shared-memory multiprocessorsACM Transactions on Computer Systems, 1991
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- The performance of spin lock alternatives for shared-memory multiprocessorsIEEE Transactions on Parallel and Distributed Systems, 1990
- Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential ProcessorsACM Transactions on Programming Languages and Systems, 1983