The Community for Technology Leaders
2012 21st International Conference on Parallel Architectures and Compilation Techniques (PACT) (2012)
Minneapolis, MN, USA
Sept. 19, 2012 to Sept. 23, 2012
ISBN: 978-1-5090-6609-4
pp: 477
Hari. K. Pyla , Virginia Tech, Blacksburg, Virginia, United States
Srinidhi Varadarajan , Virginia Tech, Blacksburg, Virginia, United States
ABSTRACT
Thread based concurrent programming is hard due to the potential of concurrency bugs (e.g., data races, atomicity violations, deadlocks, and order violations). While data races and atomicity violations can be ameliorated with appropriate synchronization (a non-trivial problem in itself !), deadlocks require fairly complex avoidance techniques which may fail when the order of lock acquisition is not known apriori [2]. The goal of this research is to present an efficient and practical system that transparently detects and eliminates deadlocks in real-world multi-threaded applications.
INDEX TERMS
System recovery, Computer bugs, Concurrent computing, Programming, Runtime, Synchronization, Algorithm design and analysis
CITATION
Hari. K. Pyla, Srinidhi Varadarajan, "Transparent runtime deadlock elimination", 2012 21st International Conference on Parallel Architectures and Compilation Techniques (PACT), vol. 00, no. , pp. 477, 2012, doi:
84 ms
(Ver 3.3 (11022016))