Logical time in distributed computing systems
- 1 August 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 24 (8) , 28-33
- https://doi.org/10.1109/2.84874
Abstract
The partial ordering of events as defined by their causal relationships, that is, the ability of one event to directly, or transitively, affect another is defined. Its generalized and practical implementations in terms of partially ordered logical clocks are described. Such clocks can provide a decentralized definition of time for distributed computing systems, which lack a common time base. In their full generality, partially ordered logical clocks may be impractically expensive for long-lived computations. Several possible optimizations, depending on the application environment in which the clocks will be used, are described. Some applications are summarized.Keywords
This publication has 3 references indexed in Scilit:
- Concerning the size of clocksPublished by Springer Nature ,1990
- An algebraic specification of the partial orders generated by concurrent Ada computationsPublished by Association for Computing Machinery (ACM) ,1989
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978