Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
From MaRDI portal
Publication:1268787
DOI10.1006/jpdc.1998.1446zbMath0919.68006MaRDI QIDQ1268787
Maged M. Michael, Michael L. Scott
Publication date: 23 August 1999
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jpdc.1998.1446
68W10: Parallel algorithms in computer science
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68M99: Computer system organization
Related Items
A scalable lock-free stack algorithm, A general technique for proving lock-freedom, Trace-based derivation of a scalable lock-free stack algorithm, A temporal programming model with atomic blocks based on projection temporal logic, An optimistic approach to lock-free FIFO queues, Nonblocking \(k\)-compare-single-swap