Global events and global breakpoints in distributed systems
Proceedings of the Twenty-First Annual Hawaii International Conference on Software Track
Partial orders for parallel debugging
PADD '88 Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging
An empirical comparison of monitoring algorithms for access anomaly detection
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Concerning the size of logical clocks in distributed systems
Information Processing Letters
Eraser: a dynamic data race detector for multi-threaded programs
Proceedings of the sixteenth ACM symposium on Operating systems principles
RecPlay: a fully integrated practical record/replay system
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
TRaDe, a topological approach to on-the-fly race detection in java programs
JVM'01 Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1
RADISH: always-on sound and complete Ra Detection in Software and Hardware
Proceedings of the 39th Annual International Symposium on Computer Architecture
Proceedings of the 21st international conference on Parallel architectures and compilation techniques
Effective race detection for event-driven programs
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
| Hi-index | 0.00 |
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.