DMCA
Gadara: Dynamic Deadlock Avoidance for Multithreaded Programs
Cached
Download Links
| Citations: | 47 - 8 self |
BibTeX
@MISC{Wang_gadara:dynamic,
author = {Yin Wang},
title = {Gadara: Dynamic Deadlock Avoidance for Multithreaded Programs},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Deadlock is an increasingly pressing concern as the multicore revolution forces parallel programming upon the average programmer. Existing approaches to deadlock impose onerous burdens on developers, entail high runtime performance overheads, or offer no help for unmodified legacy code. Gadara automates dynamic deadlock avoidance for conventional multithreaded programs. It employs whole-program static analysis to model programs, and Discrete Control Theory to synthesize lightweight, decentralized, highly concurrent logic that controls them at runtime. Gadara is safe, and can be applied to legacy code with modest programmer effort. Gadara is efficient because it performs expensive deadlock-avoidance computations offline rather than online. We have implemented Gadara for C/Pthreads programs. In benchmark tests, Gadara successfully avoids injected deadlock faults, imposes negligible to modest performance overheads (at most 18%), and outperforms a software transactional memory system. Tests on a real application show that Gadara identifies and avoids both previously known and unknown deadlocks while adding performance overheads ranging from negligible to 10%. 1
Keyphrases
dynamic deadlock avoidance multithreaded program average programmer unknown deadlock pthreads program performance overhead model program high runtime performance overhead benchmark test multicore revolution force concurrent logic expensive deadlock-avoidance computation real application show whole-program static analysis unmodified legacy code modest performance overhead gadara identifies conventional multithreaded program injected deadlock fault onerous burden software transactional memory system modest programmer effort discrete control theory
