Abstract
Events of a parallel program are no longer strictly ordered as in sequential programs but are partially ordered. Vector clocks can be used to model this partial order but have the major drawback that their size is proportional to the total number of threads running in the program. In this article, we present a new technique called ‘accordion clocks’ which replaces vector clocks for the specific application of data race detection. Accordion clocks have the ability to reflect only the partial order that is relevant to data race detection. We have implemented accordion clocks in a Java virtual machine and show through a set of benchmarks that their memory requirements are substantially lower than for vector clocks.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bernadette Charron-Bost. Concerning the size of logical clocks in distributed systems. Information Processing Letters, 1(39): 11–16, July 1991.
Mark Christiaens and Koen De Bosschere. Trade, a topological approach to on-the-fly race detection in java programs. In Proceedings of the Java Virtual Machine Research and Technology Symposium 2001, pages 105–116, Monetery, California, USA, April 2001. USENIX.
A. Dinning and E. Schonberg. An empirical comparison of monitoring algorithms for access anomaly detection. In Second ACM SIGPLAN symposium on Principles & practice of parallel programming, pages 1–10, March 1990.
C. J. Fidge. Partial orders for parallel debugging. In Proceedings of the ACM SIGPLAN and SIGOPS Workshop on Parallel and distributed debugging, pages 183–194, May 1988.
Dieter Haban and Wolfgang Weigel. Global events and global breakpoints in distributed systems. In 21st Annual Hawaii International Conference on System Sciences, volume II, pages 166–175. IEEE Computer Society, January 1988.
Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–565, July 1978.
Friedemann Mattern. Virtual time and global states of distributed systems. In Proceedings of the Intl. Workshop on Parallel and Distributed Algorithms, pages 215–226. Elsevier Science Publishers B. V., North-Holland, 1989.
Michiel Ronsse. Racedetectie in Parallelle Programma’s door Gecontroleerde Heruitvoering. PhD thesis, Universiteit Gent, May 1999.
Michiel Ronsse and Koen De Bosschere. Recplay: A fully integrated practical record/replay system. ACM Transactions on Computer Systems, 17(2):133–152, May 1999.
Stefan Savage, Michael Burrows, Greg Nelson, Patrick Sobalvarro, and Thomas Anderson. Eraser: A dynamic data race detector for multi-threaded programs. In Operating Systems Review, volume 31, pages 27–37. ACM, October 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Christiaens, M., De Bosschere, K. (2001). Accordion Clocks: Logical Clocks for Data Race Detection. In: Sakellariou, R., Gurd, J., Freeman, L., Keane, J. (eds) Euro-Par 2001 Parallel Processing. Euro-Par 2001. Lecture Notes in Computer Science, vol 2150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44681-8_73
Download citation
DOI: https://doi.org/10.1007/3-540-44681-8_73
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42495-6
Online ISBN: 978-3-540-44681-1
eBook Packages: Springer Book Archive