Sciweavers

44 search results - page 1 / 9
» Scalable Monitoring Technique for Detecting Races in Paralle...
Sort
View
IPPS
2000
IEEE
13 years 11 months ago
Scalable Monitoring Technique for Detecting Races in Parallel Programs
Detecting races is important for debugging shared-memory parallel programs, because the races result in unintended nondeterministic executions of the programs. Previous on-the- y t...
Yong-Kee Jun, Charles E. McDowell
RV
2010
Springer
152views Hardware» more  RV 2010»
13 years 5 months ago
Efficient Data Race Detection for Async-Finish Parallelism
One of the major productivity hurdles for parallel programming is non-determinism -- a parallel program may yield different results on different executions with the same input, dep...
Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin...
DAC
2009
ACM
13 years 11 months ago
NUDA: a non-uniform debugging architecture and non-intrusive race detection for many-core
Traditional debug methodologies are limited in their ability to provide debugging support for many-core parallel programming. Synchronization problems or bugs due to race conditio...
Chi-Neng Wen, Shu-Hsuan Chou, Tien-Fu Chen, Alan P...
PLDI
2006
ACM
14 years 1 months ago
Effective static race detection for Java
We present a novel technique for static race detection in Java programs, comprised of a series of stages that employ a combination of static analyses to successively reduce the pa...
Mayur Naik, Alex Aiken, John Whaley
PLDI
2012
ACM
11 years 9 months ago
Scalable and precise dynamic datarace detection for structured parallelism
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...
Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin...