Wait-free computing
- 1 January 1995
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Sharing memory robustly in message-passing systemsJournal of the ACM, 1995
- On the use of registers in achieving wait-free consensusPublished by Association for Computing Machinery (ACM) ,1994
- Generalized FLP impossibility result for t-resilient asynchronous computationsPublished by Association for Computing Machinery (ACM) ,1993
- A combinatorial characterization of the distributed 1-solvable tasksJournal of Algorithms, 1990
- Agreement is harder than consensus: set consensus problems in totally asynchronous systemsPublished by Association for Computing Machinery (ACM) ,1990
- Constructing two-writer atomic registersPublished by Association for Computing Machinery (ACM) ,1987
- On processor coordination using asynchronous hardwarePublished by Association for Computing Machinery (ACM) ,1987
- On the minimal synchronism needed for distributed consensusJournal of the ACM, 1987
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- Concurrent control with “readers” and “writers”Communications of the ACM, 1971