Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
From MaRDI portal
Publication:1268787
DOI10.1006/JPDC.1998.1446zbMath0919.68006OpenAlexW1993301893MaRDI 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
Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer system organization (68M99)
Related Items (7)
A temporal programming model with atomic blocks based on projection temporal logic ⋮ A Wait-free Queue with Polylogarithmic Step Complexity ⋮ An optimistic approach to lock-free FIFO queues ⋮ A scalable lock-free stack algorithm ⋮ Nonblocking \(k\)-compare-single-swap ⋮ A general technique for proving lock-freedom ⋮ Trace-based derivation of a scalable lock-free stack algorithm
This page was built for publication: Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
