Logical Time in Distributed Computing Systems

Computer

Volumn 24, Issue 8, 1991, Pages 28-33

  Fidge, Colin ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS - DATA COMMUNICATION SYSTEMS; DATA PROCESSING - DATA STRUCTURES; OPTIMIZATION;

CONCURRENCY MEASURES; CONCURRENT EVENTS; DECENTRALIZED TIME; DISTRIBUTED SYSTEMS DEBUGGING; LOGICAL TIME; PARTIALLY ORDERED LOGICAL CLOCKS;

COMPUTER SYSTEMS, DIGITAL;

EID: 0026202534     PISSN: 00189162     EISSN: None     Source Type: Trade Journal    
DOI: 10.1109/2.84874     Document Type: Article

References (12)

1. L. Lamport, “Time. Clocks, and the Ordering of Events in a Distributed System.” Comm. ACM. Vol. 21. No. 7, July 1978, pp. 558-565.
2. C. J. Fidge, Dynamic Analysis of Event Orderings in Message-Passing Systems, doctoral dissertation, Australian Nat'l Univ., 1989.
3. F. Mattern, “Virtual Time and Global States of Distributed Systems,” in Parallel and Distributed Algorithms, M. Cosnard and P. Quinton, eds., North-Holland, Amsterdam, 1989, pp. 215-226.
4. B. Charron-Bost, “Concerning the Size of Clocks,” Tech. Report 569. Laboratory of Research in Information Science. Universitv of Paris-South, Paris, 1990.
5. S. Meldal. “Supporting Architecture Mappings in Concurrent Systems Design.” Proc. Fifth A ustralian Software Eng. Conf., 1REE. Sydney. 1990, pp. 207-212.
6. M. Singhal and A. Kshemkalyani, “An Efficient Implementation of Vector Clocks,” Tech. report, Dept. of Computer and Information Science, Ohio State Univ., Columbus, Ohio, 1990.
7. D. Bryan, “An Algebraic Specification of the Partial Orders Generated by Concurrent Ada Computations.” Proc. Tri-Ada, ACM Press, New York, 1989. pp. 225-241.
8. D. Haban and W. Weigel. “Global Events and Global Breakpoints in Distributed Systems,” Proc. 21st Hawaii Int'l Conf. System Sciences, Vol. II. IEEE Computer Society Press, Order No. 842 (microfiche only). 1989, pp. 166-175.
9. A. D. Kshemkalyani and M. Singhal. “Characterization of Distributed Deadlocks.” Tech. Report OSU-CISRC-6/90-TR15. Computer and Information Science Research Center, Ohio State Univ., Columbus, Ohio. 1990.
10. B. Charron-Bost. “Combinatorics and Geometry of Consistent Cuts: Application to Concurrency Theory,” in Distributed Algorithms, J.-C. Bermond and M. Raynal. eds., Lecture Notes in Computer Science, Vol. 392. Springer-Verlag, Berlin. 1989.
11. C.J. Fidge. “A Simple Run-Time Concurrency Measure.” in The Transputer in Australasia (ATOUG-3),T. Bossomaier. T. Hintz. and J. Hulskamp. eds., IOS Press, Amsterdam, 1990, pp. 92-101.
12. M. Raynal and A. Schiper, “The Causal Ordering Abstraction and a Simple Way to Implement It,” Tech. Report 1132. INRIA, Paris, 1989.