The Community for Technology Leaders
2015 30th IEEE/ACM International Conference on Automated Software Engineering (ASE) (2015)
Lincoln, NE, USA
Nov. 9, 2015 to Nov. 13, 2015
ISBN: 978-1-5090-0024-1
pp: 524-534
ABSTRACT
Inter-thread shared memory dependences are crucial to understanding the behavior of concurrent systems, as such dependences are the cornerstone of time-travel debugging and further predictive trace analyses. To enable effective and efficient shared memory dependence tracing, we present an optimistic scheme addressing the challenge of capturing exact dependences between unsynchronized events to reduce the probe effect of program instrumentation. Specifically, our approach achieved a wait-free fast path for thread-local reads on x86-TSO relaxed memory systems, and simultaneously achieved precise tracing of exact read-after-write, write-after-write and write-after-read dependences on the fly. We implemented an open-source RWTrace tool, and evaluation results show that our approach not only achieves efficient shared memory dependence tracing, but also scales well on a multi-core computer system.
INDEX TERMS
Instruction sets, Memory management, Synchronization, Algorithm design and analysis, Benchmark testing, Computer science, Debugging
CITATION

Y. Jiang, D. Li, C. Xu, X. Ma and J. Lu, "Optimistic Shared Memory Dependence Tracing (T)," 2015 30th IEEE/ACM International Conference on Automated Software Engineering (ASE), Lincoln, NE, USA, 2015, pp. 524-534.
doi:10.1109/ASE.2015.11
82 ms
(Ver 3.3 (11022016))