Sciweavers

Share
57 search results - page 1 / 12
» Detecting Race Conditions in Parallel Programs that Use Sema...
Sort
View
CORR
2002
Springer
117views Education» more  CORR 2002»
11 years 1 months ago
Detecting Race Conditions in Parallel Programs that Use Semaphores
Abstract. We address the problem of detecting race conditions in programs that use semaphores for synchronization. Netzer and Miller showed that it is NP-complete to detect race co...
Philip N. Klein, Hsueh-I Lu, Robert H. B. Netzer
ISSTA
2006
ACM
11 years 7 months ago
Run-time detection of potential deadlocks for programs with locks, semaphores, and condition variables
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose. A common kind of concurrency error is deadlock, which occurs when some thread...
Rahul Agarwal, Scott D. Stoller
PPOPP
2011
ACM
10 years 4 months ago
GRace: a low-overhead mechanism for detecting data races in GPU programs
In recent years, GPUs have emerged as an extremely cost-effective means for achieving high performance. Many application developers, including those with no prior parallel program...
Mai Zheng, Vignesh T. Ravi, Feng Qin, Gagan Agrawa...
CORR
2011
Springer
170views Education» more  CORR 2011»
10 years 8 months ago
A Model for Coherent Distributed Memory For Race Condition Detection
—We present a new model for distributed shared memory systems, based on remote data accesses. Such features are offered by network interface cards that allow one-sided operations...
Franck Butelle, Camille Coti
EUROPAR
2004
Springer
11 years 7 months ago
Detecting Data Races in Sequential Programs with DIOTA
In this paper we show that data races, a type of bug that generally only causes havoc in parallel programs, can also occur in sequential programs that use signal handlers. Fortunat...
Michiel Ronsse, Jonas Maebe, Koenraad De Bosschere
books