Cheaper matrix clocks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 857 LNCS, Issue , 1994, Pages 355-369

  Ruget, Frédéric ^a  

^a Chorus Systems   (France)

Author keywords

Causality; Distributed systems; Fault tolerance; Logical time; Matrix time

Indexed keywords

CLOCKS; COMPUTATIONAL EFFICIENCY; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; MOLECULAR PHYSICS; SEMANTICS;

CAUSALITY; COMMUNICATION OVERHEADS; DISTRIBUTED DATABASE; DISTRIBUTED SYSTEMS; FAULT TOLERANT PROTOCOLS; INCREMENTAL ALGORITHM; LOGICAL TIME; SIMULTANEOUS FAULTS;

MATRIX ALGEBRA;

EID: 21844521313     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0020445     Document Type: Conference Paper

References (17)

1. F. Cristian, H. Aghili, R. Strong, and D. Dolev. Atomic broadcast: From simple message diffusion to byzantine agreement. In Proc. 15th Int. Symp. on Fault-tolerant Computing, June 1985.
2. E. N. Elnozahy and W. Zwaenepoel. Manetho: Transparent rollback-recovery with low overhead, limited rollback and fast ouput commit. IEEE Transactions on Computers, Special Issue on Fault-Tolerant Computing, 41(5):526-31, May 1992.
3. E. N. Elnozahy and W. Zwaenepoel. Fault tolerance for a workstation cluster. In Proc. of the Workshop on Hardware and Software Architectures for Fault Tolerance, May 1993.
4. C. J. Fidge. Logical time in distributed computing systems. IEEE Computer, 24(8):28-33, Aug. 1991.
5. A. Heddaya, M. Hsu, and W. E. Weihl. Two phase gossip: Managing distributed event histories. Information Sciences, 49(1):35-57, 1989.
6. D. B. Johnson and W. Zwaenepoel. Sender-based message logging. In The 17th Int. Symp. on Fault-Tolerant Computing, pages 14-19. IEEE Computer Society, June 1987.
7. Krishnakumar and Bernstein. Bounded ignorance in repEcated systems. In Proc. ACM symp. on Principles of Database Systems, 1991.
8. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558-565, 1978.
9. B. Liskov and R. Ladin. Highly available distributed services and fault-tolerant distributed garbage collection. In Proc. 5th ACM Symp. on PODC, pages 29-39, 1986.
10. F. Mattern. Virtual time and global states of distributed systems. In Proc. of Int. Workshop on Parallel and Distributed Algorithms, Bonas (France), pages 215-226. Cosnard, Quinton, Raynal and Robert editors, 1989
11. P. Panangaden and K. Taylor. Concurrent common knowledge: Denning agreement for asynchronous systems. Distributed Computing, 6(2):73-94, September 1992.
12. F. Ruget. Cheaper matrix clocks. Technical Report CS/TR-94-63, Chorus Systems, 1994.
13. F. Ruget. A distributed execution replay facility for CHORUS. In Proc. of the 7th Int. Conf. on Parallel and Distributed Systems (PDCS’94), Las Vegas, Nevada, October 1994.
14. R. E. Strom, D. F. Bacon, and S. A. Yemini. Volatile logging in n-fault-tolerant distributed systems. In The Eighteenth Annual International Symposium on Fault-Tolerant Computing: Digest of Papers, pages 44-49, June 1988.
15. S. K. Sarin and L. Lynch. Discarding obsolete information in a replicated database system. IEEE Trans, on Soft. Eng., SE 13(1):39-46, Jan. 1987
16. R. E. Strom and S. A. Yemini. Optimistic recovery in distributed systems. ACM Transactions on computer Systems, 3(3):204-226, August 1985
17. G. T. J. Wuu and A. J. Bernstein. Efficient solutions to the replicated log and dictionary problems. In Proc. 3rd ACM Symp. on PODC, pages 232-242, 1984.