Efficient dependency tracking for relevant events in shared-memory systems

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 24, Issue , 2005, Pages 19-28

  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

Predicate Detection; Shared memory; Vector clock

Indexed keywords

DATA STRUCTURES; JAVA PROGRAMMING LANGUAGE; VECTORS;

PREDICATE DETECTION; SHARED-MEMORY SYSTEMS; VECTOR CLOCKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 32344435740     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073814.1073818     Document Type: Conference Paper

References (23)

1. A. Agarwal and V. K. Garg. Chain clocks: Efficient dependency tracking for shared-memory systems. Technical report, University of Texas at Austin, 2004. Available as "http://maple.ece.utexas.edu/TechReports/2004/TR-PDS-2004-005.ps".
2. S. Alagar and S. Venkatesan. Techniques to tackle state explosion in global predicate detection. IEEE Transactions on Software Engineering, 27(8):704-714, Aug. 2001.
3. K. Audenaert. Clock trees: Logical clocks for programs with nested parallelism. IEEE Transactions on Software Engineering, 23(10):646-658, October 1997.
4. O. Babaoglu and K. Marzullo. Consistent global states of distributed systems: Fundamental concepts and mechanisms. In S. Mullender, editor, Distributed Systems, pages 55-96. Addison-Wesley, 1993.
5. R. Baldoni and G. Melideo. Tradeoffs in message overhead versus detection time in causality tracking. Technical Report 06-01, Dipartimento di Informatica e Sistemistica, Univ. of Rome, 2000.
6. B. Charron-Bost. Concerning the size of logical clocks in distributed systems. Inf. Process. Lett., 39:11-16, July 1991.
7. R. Cooper and K. Marzullo. Consistent detection of global predicates. In Proc. of the Workshop on Parallel and Distributed Debugging, pages 163-173, Santa Cruz, CA, May 1991. ACM/ONR.
8. B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990.
9. S. Felsner. On-line chain partitions of orders. Theoretical Computer Science, 175:283-292, 1997.
10. C. J. Fidge. Timestamps in message-passing systems that preserve the partial ordering. Proc. of the 11th Australian Computer Science Conference, 10(1):56-66, Feb 1988.
11. V. K. Garg and C. Skawratananond. String realizers of posets with applications to distributed computing. In 20th Annual ACM Symposium on Principles of Distributed Computing (PODC-00), pages 72-80. ACM, Aug. 2001.
12. V. K. Garg and C. Skawratananond. On timestamping synchronous communications. In 22nd International Conference on Distributed Computing Systems (ICDCS' 02), pages 552-560. IEEE, 2002.
13. V. K. Garg and B. Waldecker. Detection of unstable predicates. In Proc. of the Workshop on Parallel and Distributed Debugging, Santa Cruz, CA, May 1991. ACM/ONR.
14. H. A. Kierstead. Recursive colorings of highly recursive graphs. Canad. J. Math, 33(6):1279-1290, 1981.
15. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 21(7):558-565, July 1978.
16. K. Marzullo and L. S. Sabel. Efficient detection of a class of stable properties. Distributed Computing, 8(2):81-91, 1994.
17. F. Mattern. Virtual time and global states of distributed systems. In Parallel and Distributed Algorithms: Proc. of the Int'l Workshop on Parallel and Distributed Algorithms, pages 215-226, 1989.
18. K. Sen, G. Rosu, and G. Agha. Runtime safety analysis of multithreaded programs. In Proc. of the 11th ACM Symposium on the Foundations of Software Engineering 2003, Sept. 2003.
19. M. Singhal and A. Kshemkalyani. An efficient implementation of vector clocks. Information Processing Letters, 43(10):47-52, August 1992.
20. R. E. Strom and S. Yemeni. Optimistic recovery in distributed systems. ACM Transactions on Computer Systems, 3(3):204-226, 1985.
21. F. Torres-Rojas and M. Ahamad. Plausible clocks: Constant size logical clocks for distributed systems. In Proc. of 10th Int'l Workshop Distributed Algorithms, pages 71-88, 1996.
22. P. A. S. Ward. A framework algorithm for dynamic, centralized dimension-bounded timestamps. In Proc. of the 2000 conference of the Centre for Advanced Studies on Collaborative research, page 14, 2000.
23. D. B. West. The Art of Combinatorics Volume III: Order and Optimization. Preprint edition.