Issue No. 12 - Dec. (2013 vol. 24)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2013.13
Yan Cai , City University of Hong Kong, Hong Kong
W.K. Chan , City University of Hong Kong , Hong Kong
Many happened-before-based detectors for debugging multithreaded programs implement vector clocks to incrementally track the casual relations among synchronization events produced by concurrent threads and generate trace logs. They update the vector clocks via vector-based comparison and content assignment in every case. We observe that many such tracking comparison and assignment operations are removable in part or in whole, which if identified and used properly, have the potential to reduce the log traces thus produced. This paper presents our analysis to identify such removable tracking operations and shows how they could be used to reduce log traces. We implement our analysis result as a technique entitled LOFT. We evaluate LOFT on the well-studied PARSEC benchmarking suite and five large-scale real-world applications. The main experimental result shows that on average, LOFT identifies 63.9 percent of all synchronization operations incurred by the existing approach as removable and does not compromise the efficiency of the latter.
Synchronization, Message systems, Algorithm design and analysis, Concurrent computing, Detectors
Yan Cai, W.K. Chan, "Lock Trace Reduction for Multithreaded Programs", IEEE Transactions on Parallel & Distributed Systems, vol. 24, no. , pp. 2407-2417, Dec. 2013, doi:10.1109/TPDS.2013.13