Ratanaworabhan, Paruj and Burtscher, Martin and Kirovski, Darko and Zorn, Benjamin and Nagpal, Rahul and Pattabiraman, Karthik (2012) Efficient Runtime Detection and Toleration of Asymmetric Races. In: IEEE Transactions on Computers, 61 (4). pp. 548-562.
Efficient.pdf - Published Version
Restricted to Registered users only
Download (1539Kb) | Request a copy
We introduce ToleRace, a runtime system that allows programs to detect and even tolerate asymmetric data races. Asymmetric races are race conditions where one thread correctly acquires and releases a lock for a shared variable while another thread improperly accesses the same variable. ToleRace provides approximate isolation in the critical sections of lock-based parallel programs by creating a local copy of each shared variable when entering a critical section, operating on the local copies, and propagating the appropriate copies upon leaving the critical section. We start by characterizing all possible interleavings that can cause races and precisely describe the effect of ToleRace in each case. Then, we study the theoretical aspects of an oracle that knows exactly what type of interleaving has occurred. Finally, we present software implementations of ToleRace and evaluate them on multithreaded applications from the SPLASH2 and PARSEC suites.
|Item Type:||Journal Article|
|Additional Information:||Copyright 2012 IEEE. Personal use of this material is permitted.However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Keywords:||Debugging aids;dynamic instrumentation;parallel programming; race detection and toleration|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||20 Mar 2012 11:02|
|Last Modified:||11 Jan 2013 09:48|
Actions (login required)