Efficient dependency tracking for relevant events in concurrent systems

Distributed Computing

Volumn 19, Issue 3, 2007, Pages 163-183

  Agarwal, Anurag ^a   Garg, Vijay K ^b  

^a University of Texas at Austin   (United States)

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

Author keywords

Dependency tracking; Keywords; Predicate detection; Vector clock

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATA REDUCTION; JAVA PROGRAMMING LANGUAGE; VECTORS;

DEPENDENCY TRACKING; PREDICATE DETECTION; VECTOR CLOCKS;

CONCURRENT ENGINEERING;

EID: 33751514018     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-006-0004-y     Document Type: Article

References (45)

1. S. Alagar S. Venkatesan 2001 Techniques to tackle state explosion in global predicate detection IEEE Trans. Softw. Eng. 27 8 704 714
2. Alagar, S., Venkatesan, S.: Techniques to tackle state explosion in global predicate detection. IEEE Trans. Softw. Eng. 27(8), 704 -714 (2001)
3. Arora, A., Kulkarni, S.S., Demirbas, M.: Resettable vector clocks. In: Proceedings of the 19th ACM Symposium on Principles of Distributed Computing (PODC), pp. 269-278 (2000)
4. K. Audenaert 1997 Clock trees: Logical clocks for programs with nested parallelism IEEE Trans. Softw. Eng. 23 10 646 658
5. Audenaert, K.: Clock trees: Logical clocks for programs with nested parallelism. IEEE Trans. Softw. Eng. 23(10), 646-658 (1997)
6. Babaoglu, O., Marzullo, K.: Consistent global states of distributed systems: Fundamental concepts and mechanisms. In: Mullender, S. (ed.) Distributed Systems, pp. 55-96. Addison-Wesley (1993)
7. Baldoni, R., Melideo, G.: Tradeoffs in message overhead versus detection time in causality tracking. Tech. Rep. 06-01, Dipartimento di Informatica e Sistemistica, Univ. of Rome (2000)
8. K.P. Birman 1993 The process group approach to reliable distributed computing Commun. ACM 36 12 37 53
9. Birman, K.P.: The process group approach to reliable distributed computing. Commun. ACM 36(12), 37-53 (1993)
10. K.P. Birman T.A. Joseph 1987 Reliable communication in the presence of failures ACM Trans. Comput. Syst. 5 1 47 76
11. Birman, K.P., Joseph, T.A.: Reliable communication in the presence of failures. ACM Trans. Comput. Syst. 5(1), 47-76 (1987)
12. Cain, H.W., Lipasti, M.H.: Verifying sequential consistency using vector clocks. In: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, pp. 153-154. ACM Press (2002)
13. B. Charron-Bost 1991 Concerning the size of logical clocks in distributed systems Inf. Process. Lett. 39 11 16
14. Charron-Bost, B.: Concerning the size of logical clocks in distributed systems. Inf. Process. Lett. 39, 11-16 (1991)
15. Cooper, R., Marzullo, K.: Consistent detection of global predicates. In: Proc. of the Workshop on Parallel and Distributed Debugging, pp. 163-173. ACM/ONR, Santa Cruz, CA (1991)
16. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press (1990)
17. R.P. Dilworth 1950 A decomposition theorem for partially ordered sets Ann. Math. 51 161 166
18. Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 51, 161-166 (1950)
19. Dinning, A., Schonberg, E.: An empirical comparison of monitoring algorithms for access anomaly detection. In: Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming, pp. 1-10. ACM Press (1990)
20. S. Felsner 1997 On-line chain partitions of orders Theor. Comput. Sci. 175 283 292
21. Felsner, S.: On-line chain partitions of orders. Theor. Comput. Sci. 175, 283-292 (1997)
22. Fidge, C.: Timestamps in message-passing systems that preserve the partial ordering. In: Proceedings of the 11th Australian Computer Science Conference, 10(1), 56-66 (1988)
23. Fowler, J., Zwaenepoel, W.: Causal distributed breakpoints. In: Proceedings of the 10th International Conference on Distributed Computing Systems, pp. 134-141. IEEE, Paris, France (1990)
24. Garg, V.K., Skawratananond, C.: String realizers of posets with applications to distributed computing. In: 20th Annual ACM Symposium on Principles of Distributed Computing (PODC-00), pp. 72-80. ACM (2001)
25. Garg, V.K., Skawratananond, C.: On timestamping synchronous communications. In: 22nd International Conference on Distributed Computing Systems (ICDCS' 02), pp. 552-560. IEEE (2002)
26. Garg, V.K., Waldecker, B.: Detection of unstable predicates. In: Proceedings of the Workshop on Parallel and Distributed Debugging. ACM/ONR, Santa Cruz, CA (1991)
27. Gidenstam, A., Papatriantafilou, M.: Adaptive plausible clocks. In: 24th International Conference on Distributed Computing Systems (ICDCS' 04), pp. 86-93. IEEE (2004)
28. D.B. Johnson W. Zwaenepoel 1990 Recovery in distributed systems using optimistic message logging and checkpointing J. Algorithms 11 3 462 491
29. Johnson, D.B., Zwaenepoel, W.: Recovery in distributed systems using optimistic message logging and checkpointing. J. Algorithms 11(3), 462-491 (1990)
30. H.A. Kierstead 1981 Recursive colorings of highly recursive graphs Can. J. Math 33 6 1279 1290
31. L. Lamport 1978 Time, clocks, and the ordering of events in a distributed system Commun. ACM 21 7 558 565
32. K. Marzullo L. Sabel 1994 Efficient detection of a class of stable properties Distributed Comput. 8 2 81 91
33. F. Mattern 1987 Algorithms for distributed termination detection Distributed Comput. 2 3 161 175
34. Mattern, F.: Virtual time and global states of distributed systems. In: Parallel and Distributed Algorithms: Proceedings of the Int'l Workshop on Parallel and Distributed Algorithms, pp. 215-226 (1989)
35. Mellor-Crummey, J.: On-the-fly detection of data races for programs with nested fork-join parallelism. In: Proceedings of the 1991 ACM/IEEE Conference on Supercomputing, pp. 24-33. ACM Press (1991)
36. Mostefaoui, A., Theel, O.: Reduction of timestamp sizes for causal event ordering. Tech. rep., Irisa (1996)
37. Netzer, R., Miller, B.: Detecting data races in parallel program executions. In: Advances in Languages and Compilers for Parallel Processing, pp. 109-130. MIT Press (1990)
38. Netzer, R.H.B., Miller, B.P.: Optimal tracing and replay for debugging message-passing parallel programs. In: Proceedings of the 1992 ACM/IEEE conference on Supercomputing, pp. 502-511. IEEE Computer Society Press (1992)
39. M. Raynal A. Schiper S. Toueg 1991 The causal ordering abstraction and a simple way to implement it Inf. Process. Lett. 39 6 343 350
40. Sen, K., Rosu, G., Agha, G.: Runtime safety analysis of multithreaded programs. In: Proc. of the 11th ACM Symposium on the Foundations of Software Engineering 2003 (2003)
41. M. Singhal A. Kshemkalyani 1992 An efficient implementation of vector clocks Inf. Process. Lett. 43 10 47 52
42. R.E. Strom S. Yemeni 1985 Optimistic recovery in distributed systems ACM Trans. Comput. Syst. 3 3 204 226
43. Torres-Rojas, F., Ahamad, M.: Plausible clocks: Constant size logical clocks for distributed systems. In: Proceedings of 10th Int'l Workshop Distributed Algorithms, pp. 71-88 (1996)
44. Ward, P.A.S.: A framework algorithm for dynamic, centralized dimension-bounded timestamps. In: Proceedings of the 2000 conference of the Centre for Advanced Studies on Collaborative research, p. 14 (2000)
45. West, D.B.: The Art of Combinatorics Volume III: Order and Optimization. Preprint edition