FastTrack: Efficient and Precise Dynamic Race Detection.
Saved in:
| Title: | FastTrack: Efficient and Precise Dynamic Race Detection. |
|---|---|
| Authors: | Flanagan, Cormac1, Freund, Stephen N.2 |
| Source: | Communications of the ACM. Nov2010, Vol. 53 Issue 11, p93-101. 9p. 5 Diagrams, 2 Charts. |
| Subject Terms: | *DATA analysis, *COMPUTER programming, PARALLEL programs (Computer programs), VECTOR analysis, ACQUISITION of data, ALGORITHM research |
| Abstract: | Multithreaded programs are notoriously prone to race conditions. Prior work developed precise dynamic race detectors that never report false alarms. However, these checkers employ expensive data structures, such as vector clocks (VCs), that result in significant performance overhead. This paper exploits the insight that the full generality of VCs is not necessary in most cases. That is, we can replace VCs with an adaptive lightweight representation that, for almost all operations of the target program, requires constant space and supports constant-time operations. Experimental results show that the resulting race detection algorithm is over twice as fast as prior precise race detectors, with no loss of precision. [ABSTRACT FROM AUTHOR] |
| Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Business Source Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Be the first to leave a comment!