The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Optimistic recovery in distributed systems
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Complexity of network synchronization
Journal of the ACM (JACM)
Distributed discrete-event simulation
ACM Computing Surveys (CSUR)
Highly available distributed services and fault-tolerant distributed garbage collection
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Discarding Obsolete Information in a Replicated Database System
IEEE Transactions on Software Engineering - Special issue on distributed systems
A distributed algorithm to prevent mutual drift between n logical clocks
Information Processing Letters
Global events and global breakpoints in distributed systems
Proceedings of the Twenty-First Annual Hawaii International Conference on Software Track
Recovery in distributed systems using asynchronous message logging and checkpointing
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Synchronization and control of distributed systems and programs
Synchronization and control of distributed systems and programs
Logical Time in Distributed Computing Systems
Computer - Distributed computing systems: separate resources acting as one
Concerning the size of logical clocks in distributed systems
Information Processing Letters
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A New Algorithm to Implement Causal Ordering
Proceedings of the 3rd International Workshop on Distributed Algorithms
Efficient solutions to the replicated log and dictionary problems
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
The use of efficient broadcast protocols in asynchronous distributed systems
The use of efficient broadcast protocols in asynchronous distributed systems
Detecting relational global predicates in distributed systems
PADD '93 Proceedings of the 1993 ACM/ONR workshop on Parallel and distributed debugging
The Congenial Talking Philosophers Problem in Computer Networks (Extended Abstract)
Proceedings of the 13th International Symposium on Distributed Computing
Plausible clocks: constant size logical clocks for distributed systems
Distributed Computing
| Hi-index | 0.00 |
Memory space and processor time are basic resources when executing a program. But beside this implementation aspect (this time resource is necessary but does not belong to the program semantics), the concept of time presents a more fundamental facet in distributed systems namely causality relation between events. Put forward by Lamport in 1978, the logical nature of time is of primary importance when designing or analyzing distributed systems. This paper reviews three ways (linear time, vector time and matrix time) which have been proposed to capture causality between events of a distributed computation and which consequently allow to define logical time.