Non-blocking timeout in scalable queue-based spin locks

DOI10.1145/571825.571830MaRDI QIDQ5170863zbMATH OpenOpenAlexFDO

Authors Michael L. Scott

Publication date 25 July 2014

Published in Proceedings of the twenty-first annual symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1802/303

zbMATH Keywords

scalabilityspin lockssynchronizationtimeout

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
• Adaptive and efficient abortable mutual exclusion
• A fast, scalable mutual exclusion algorithm
• Spin-based reader-writer synchronization for multiprocessor real-time systems
• Fast and lock-free concurrent priority queues for multi-thread systems

Cited in

(8)

• Inferential queueing and speculative push
• Supporting lock-free synchronization in Pfair-scheduled real-time systems
• Recoverable mutual exclusion with abortability
• Mutual exclusion algorithms with constant RMR complexity and wait-free exit code
• An almost tight RMR lower bound for abortable test-and-set
• Shared-memory mutual exclusion: major research trends since 1986
• Brief announcement: Jiffy: a fast, memory efficient, wait-free multi-producers single-consumer queue
• Spin-based reader-writer synchronization for multiprocessor real-time systems

This page was built for publication: Non-blocking timeout in scalable queue-based spin locks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5170863)