Sciweavers

95 search results - page 4 / 19
» Efficient Data Race Detection for Async-Finish Parallelism
Sort
View
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...
TSE
2010
180views more  TSE 2010»
13 years 5 months ago
Aspect-Oriented Race Detection in Java
—In the past, researchers have developed specialized programs to aid programmers in detecting concurrent programming errors such as deadlocks, livelocks, starvation, and data rac...
Eric Bodden, Klaus Havelund
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...
PLDI
2010
ACM
13 years 9 months ago
DRFX: a simple and efficient memory model for concurrent programming languages
The most intuitive memory model for shared-memory multithreaded programming is sequential consistency (SC), but it disallows the use of many compiler and hardware optimizations th...
Daniel Marino, Abhayendra Singh, Todd D. Millstein...
SAS
2007
Springer
126views Formal Methods» more  SAS 2007»
14 years 1 months ago
Hierarchical Pointer Analysis for Distributed Programs
We present a new pointer analysis for use in shared memory programs running on hierarchical parallel machines. The analysis is motivated by the partitioned global address space lan...
Amir Kamil, Katherine A. Yelick