Timestamping messages in synchronous computations

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2002, Pages 552-559

  Garg, Vijay K ^a   Skawratananond, Chakarat ^a  

^a The University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; FAULT TOLERANT COMPUTER SYSTEMS; TOPOLOGY; VECTORS;

SYNCHRONOUS COMPUTATIONS; TIMESTAMPING MESSAGES;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0036375298     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Synchronous and asynchronous communication in distributed computations
2. How to recover efficiently and asynchronously when optimism fails
3. Decomposition theorem for partially order sets
4. Partially ordered sets
5. Partial orders for parallel debugging
6. String realizers of posets with applications to distributed computing
7. Detection of weak unstable predicates in distributed programs
8. Poet: Target-system independent visualizations of complex distributed-application executions
9. Time, clocks, and the ordering of events in a distributed system
10. Virtual time and global states of distributed systems
11. Synchronous message passing
12. The rank of distributive lattice
13. An efficient implementation of vector clocks
14. Optimistic recovery in distributed systems
15. Plausible clocks: Constant size logical clocks for distributed systems
16. A framework algorithm for dynamic, centralized, dimension-bounded timestamps
17. A hierarchical cluster algorithm for dynamic, centralized timestamps
18. The complexity of the partial order dimension problem