Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory Multiprocessors
Open Access
- 1 May 1998
- journal article
- research article
- Published by Elsevier BV in Journal of Parallel and Distributed Computing
- Vol. 51 (1), 1-26
- https://doi.org/10.1006/jpdc.1998.1446
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Scheduler-conscious synchronizationACM Transactions on Computer Systems, 1997
- A nonblocking algorithm for shared queues using compare-and-swapIEEE Transactions on Computers, 1994
- A methodology for implementing highly concurrent data objectsACM Transactions on Programming Languages and Systems, 1993
- Scheduler activationsACM Transactions on Computer Systems, 1992
- Empirical studies of competitve spinning for a shared-memory multiprocessorACM SIGOPS Operating Systems Review, 1991
- 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
- The performance of spin lock alternatives for shared-money multiprocessorsIEEE Transactions on Parallel and Distributed Systems, 1990
- Specifying Concurrent Program ModulesACM Transactions on Programming Languages and Systems, 1983
- Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential ProcessorsACM Transactions on Programming Languages and Systems, 1983