Anomalies in the wait-free hierarchy
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 156-163
- https://doi.org/10.1007/bfb0020431
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Are wait-free algorithms fast?Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the Robustness of Herlihy's HierarchyPublished by Defense Technical Information Center (DTIC) ,1993
- Resource bounds and combinations of consensus objectsPublished by Association for Computing Machinery (ACM) ,1993
- The asynchronous computability theorem for t-resilient tasksPublished by Association for Computing Machinery (ACM) ,1993
- Generalized FLP impossibility result for t-resilient asynchronous computationsPublished by Association for Computing Machinery (ACM) ,1993
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- Agreement is harder than consensus: set consensus problems in totally asynchronous systemsPublished by Association for Computing Machinery (ACM) ,1990
- Wait-free data structures in the asynchronous PRAM modelPublished by Association for Computing Machinery (ACM) ,1990
- On processor coordination using asynchronous hardwarePublished by Association for Computing Machinery (ACM) ,1987
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985