Performance issues in non-blocking synchronization on shared-memory multiprocessors

DOI10.1145/135419.135446MaRDI QIDQ5348844zbMATH OpenOpenAlexFDO

Authors Juan Alemany, Edward W. Felten

Publication date 21 August 2017

Published in Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/135419.135446

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Characterizing the performance of algorithms for lock-free objects
• Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
• scientific article; zbMATH DE number 2006660
• Pragmatic primitives for non-blocking data structures
• Performance of memory reclamation for lockless synchronization

Cited in

(8)

• Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
• Efficient synchronization of multiprocessors with shared memory
• Performance of memory reclamation for lockless synchronization
• scientific article; zbMATH DE number 1543366 (Why is no real title available?)
• Software transactional memory
• Algorithms – ESA 2005
• A non-blocking locking method and performance evaluation on network of workstations
• The architectural and operating system implications on the performance of synchronization on ccNUMA multiprocessors

This page was built for publication: Performance issues in non-blocking synchronization on shared-memory multiprocessors

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