scientific article; zbMATH DE number 5485533

MaRDI QIDQ3549704zbMATH OpenFDO

Authors Ragif Artiya, Danny Hendler, Philipp Woelfel

Publication date 5 January 2009

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited in

(11)

• RMR-efficient implementations of comparison primitives using read and write operations
• Recoverable mutual exclusion
• Recoverable mutual exclusion with abortability
• Tight bounds for asynchronous renaming
• A time complexity lower bound for adaptive mutual exclusion
• Allocate-on-use space complexity of shared-memory algorithms
• An almost tight RMR lower bound for abortable test-and-set
• Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion
• Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
• Randomized mutual exclusion with sub-logarithmic RMR-complexity
• Adaptive and fair transformation for recoverable mutual exclusion

This page was built for publication:

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