Sharing memory robustly in message-passing systems
- 1 August 1990
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 363-375
- https://doi.org/10.1145/93385.93441
Abstract
No abstract availableThis publication has 26 references indexed in Scilit:
- Fast randomized consensus using shared memoryJournal of Algorithms, 1990
- Bounded concurrrent time-stamp systems are constructiblePublished by Association for Computing Machinery (ACM) ,1989
- How to share concurrent asynchronous wait-free variablesPublished by Springer Nature ,1989
- End-to-end communication in unreliable networksPublished by Association for Computing Machinery (ACM) ,1988
- Toward a non-atomic era: l-exclusion as a test casePublished by Association for Computing Machinery (ACM) ,1988
- Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problemsPublished by Association for Computing Machinery (ACM) ,1987
- On processor coordination using asynchronous hardwarePublished by Association for Computing Machinery (ACM) ,1987
- On interprocess communicationDistributed Computing, 1986
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- Resynch Procedures and a Fail-Safe Network ProtocolIEEE Transactions on Communications, 1979