Thumbnail
Access Restriction
Subscribed

Author Flanagan, Cormac ♦ Freund, Stephen N.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
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.
Description Affiliation: Williams College, Williamstown, MA (Freund, Stephen N.) || University of California at Santa Cruz, Santa Cruz, CA (Flanagan, Cormac)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 53
Issue Number 11
Page Count 9
Starting Page 93
Ending Page 101


Open content in new tab

   Open content in new tab
Source: ACM Digital Library