Read/write based fast-path transformation for FCFS mutual exclusion

DOI10.1007/978-3-540-30577-4_24MaRDI QIDQ5711536zbMATH OpenOpenAlexFDO

Authors Prasad Jayanti, Srdjan Petrovic, Neha Narula

Publication date 7 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b105088

Mathematics Subject Classification ID

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

Recommendations

• A new fast-path mechanism for mutual exclusion
• Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms
• A fast, scalable mutual exclusion algorithm
• Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion
• Closing the complexity gap between FCFS mutual exclusion and mutual exclusion

Cited in

(4)

• An almost tight RMR lower bound for abortable test-and-set
• scientific article; zbMATH DE number 7774267 (Why is no real title available?)
• Randomized mutual exclusion with sub-logarithmic RMR-complexity
• Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms

This page was built for publication: Read/write based fast-path transformation for FCFS mutual exclusion

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