Timestamping messages and events in a distributed system using synchronous communication

Distributed Computing

Volumn 19, Issue 5-6, 2007, Pages 387-402

  Garg, Vijay K ^a   Skawratananond, Chakarat ^b   Mittal, Neeraj ^c  

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

^b IBM   (United States)

^c The University of Texas at Dallas   (United States)

Author keywords

Edge decomposition; Synchronous communication; Timestamping messages and events; Vector clocks; Vertex cover

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SYSTEM RECOVERY; GRID COMPUTING; PROBLEM SOLVING; PROGRAM DEBUGGING;

COMMUNICATION TOPOLOGIES; EDGE DECOMPOSITION; SYNCHRONOUS COMMUNICATION; SYNCHRONOUS MESSAGES; VECTOR CLOCKS;

MESSAGE PASSING;

EID: 33947696598     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-006-0018-5     Document Type: Article

References (35)

1. Agarwal, A., Garg, V.K.: Efficient dependency tracking for relevant events in shared-memory systems. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 19-28 (2005)
2. Alagar, S., Venkatesan, S.: Techniques to tackle state explosion in global predicate detection. IEEE Trans. Softw. Eng. 27(8), 704-714 (2001)
3. Basten, T., Kunz, T., Black, J.P., Coffin, M.H., Taylor, D.J.: Vector time and causality among abstract events in distributed computations. Distrib. Comput. 11, 21-39 (1997)
4. Charron-Bost, B., Mattern, F., Tel, G.: Synchronous and asynchronous communication in distributed computations. Distrib. Comput. 9, 173-191 (1996)
5. IBM Corporation. IBM distributed debugger for workstations. Available at http://www.ibm.com/software/webservers/appserv/doc/v35/ae/infocenter/olt/index. html
6. Damani, O.P., Garg, V.K.: How to recover efficiently and asynchronously when optimism fails. In: Proceedings of the IEEE International Conference on Distributed Computing Systems (ICDCS), pp. 108-115, Hong Kong (1996)
7. Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 51, 161-166 (1950)
8. Dushnik, B., Miller, E.W.: Partially ordered sets. Am. J. Math. 63, 600-610 (1941)
9. Fidge, C.J.: Timestamps in message-passing systems that preserve the partial-ordering. In: Raymond, K. (ed.) Proceedings of the 11th Australian Computer Science Conference (ACSC), pp. 56-66 (1988)
10. Fidge, C.J.: Partial orders for parallel debugging. In: Proceedings of the ACM/ONR Workshop on Parallel and Distributed Debugging, pp. 183-194 (1989)
11. Fidge, C.J.: Logical time in distributed computing systems. IEEE Comput. 24(8), 28-33 (1991)
12. Fowler, J., Zwaenepoel, W.: Causal distributed breakpoints. In: Proceedings of the 10th IEEE International Conference on Distributed Computing Systems (ICDCS), pp. 131-141. IEEE Computer Society (1990)
13. Garey, M.R., Johnson, D.S.: Computer and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, New York (1991)
14. Garg, V.K.: Elements of distributed computing. J Wiley, New York (2002, Incorporated)
15. Garg, V.K., Skawratananond, C.: String realizers of posets with applications to distributed computing. In: Proceedings of the 20th ACM Symposium on Principles of Distributed Computing (PODC), pp. 72-80 Newport (2001)
16. Garg, V.K., Waldecker, B.: Detection of weak unstable predicates in distributed programs. IEEE Trans. Parallel Distrib. Syst. (TPDS) 5(3), 299-307 (1994)
17. Haban, D., Weigel, W: Global events and global breakpoints in distributed systems. In: Proceedings of the 21st Hawaii International Conference on Systems Sciences, pp. 166-175 (1988)
18. Hélary, J.-M., Raynal, M., Melideo, G., Baldoni, R.: Efficient causality-tracking timestamping. IEEE Trans. Knowl. Data Eng. 15(5), 1239-1250 (2003)
19. Jard, C., Jourdan, G.-V.: Dependency tracking and filtering in distributed computations. Technical Report 851, IRISA, Campus de Beaulieu, 35042 Rennes Cedex (1994)
20. Kohl, J.A., Geist, G.A.: The PVM3.4 tracing facility and XPVM 1.1. Technical report, Computer Science and Mathematics Division Oak Ridge National Lab, Tennesse (1995)
21. Kunz, T., Black, J.P., Taylor, D.J., Basten, T.: POET target-system independent visualizations of complex distributed-applications executions. Comput. J. 40(8), 499-512 (1997)
22. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun ACM (CACM), 21(7), 558-565 (1978)
23. Marzullo, K., Sabel, L.: Efficient detection of a class of stable properties. Distrib. Comput. 8(2), 81-91 (1994)
24. Mattern, F.: Virtual time and global states of distributed systems. In: Parallel and Distributed Algorithms: Proceedings of the Workshop on Distributed Algorithms (WDAG), pp. 215-226. Elsevier, North-Holland (1989)
25. Murty, V.V., Garg, V.K.: Synchronous message passing. In: Proceedings of the International Symposium on Autonomous Decentralized Systems, pp. 208-214. Phoenix, Arizona (1995)
26. Rabinovitch, I., Rival, I.: The rank of distributive lattice. Discrete Math. 25, 275-279 (1979)
27. Singhal, M., Kshemkalyani, A.: An efficient implementation of vector clocks. Inf. Process. Lett. (IPL) 43, 47-52 (1992)
28. Singhal, M., Shivaratri, N.G.: Advanced Concepts in Operating Systems. McGraw-Hill and The MIT Press (1994)
29. Strom, R.E., Yemeni, S.: Optimistic recovery in distributed systems. ACM Trans. Comput. Syst. 3(3), 204-226 (1985)
30. Torres-Rojas, F.J., Ahamad, M.: Plausible clocks: constant size logical clocks for distributed systems. In: Proceedings of the 10th Workshop on Distributed Algorithms (WDAG), pp. 71-88. Springer, Berlin Heidelberg New York (1996)
31. Trotter, W.T.: Combinatorics and partially ordered sets: dimension theory. The Johns Hopkins University Press, Baltimore (1992)
32. Ward, P.A.S.: An offline algorithm for dimension-bound analysis. In: Panda, D., Shiratori, N. (eds.) Proceedings of the International Conference on Parallel Processing, pp. 128-136. IEEE Computer Society (1999)
33. Ward, P.A.S.: An online algorithm for dimension-bound analysis. In: Amestoy P., et al. (ed.) Proceedings of the Euro-Par. Lecture Notes in Computer Science (LNCS), pp. 144-153. Springer, Berlin Heidelberg New York (1999)
34. Ward, P.A.S., Taylor, D.T.: A hierarchical cluster algorithm for dynamic, centralized timestamps. In: Proceedings of the IEEE International Conference on Distributed Computing Systems (ICDCS), pp. 585-593 (2001)
35. Yannakakis, M.: The complexity of the partial order dimension problem. SIAM J. Algeb. Discrete Methods 3, 351-358 (1982)