Robust wait-free hierarchies

DOI10.1145/263867.263888zbMATH Open0891.68007OpenAlexW2131716463MaRDI QIDQ4377589FDOQ4377589

Authors: Prasad Jayanti 

Publication date: 17 February 1998

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/jacm/1997-44/

Recommendations

• scientific article; zbMATH DE number 1559573
• All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust
• Fault-tolerant wait-free shared objects
• Determining Consensus Numbers

zbMATH Keywords

wait-free implementations

Mathematics Subject Classification ID

Computer system organization (68M99)

Cited In (18)

• A complexity-based classification for multiprocessor synchronization
• Wait-free computing
• Hundreds of impossibility results for distributed computing
• On the weakest failure detector ever
• All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust
• On the importance of having an identity or, is consensus really universal?
• Nontrivial and universal helping for wait-free queues and stacks
• Failure detectors as type boosters
• Algebraic topology and concurrency
• Extending the wait-free hierarchy to multi-threaded systems
• Fault-tolerant wait-free shared objects
• The computational structure of progress conditions and shared objects
• Title not available (Why is that?)
• The gap in circumventing the impossibility of consensus
• The weakest failure detectors to boost obstruction-freedom
• On the viability of the deterministic consensus hierarchy
• Randomized protocols for asynchronous consensus
• Relationships between broadcast and shared memory in reliable anonymous distributed systems

This page was built for publication: Robust wait-free hierarchies

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