Sciweavers

Share
7 search results - page 1 / 2
» Scalable and precise dynamic datarace detection for structur...
Sort
View
PLDI
2012
ACM
7 years 6 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...
ICPP
2008
IEEE
9 years 10 months ago
Scalable Techniques for Transparent Privatization in Software Transactional Memory
—We address the recently recognized privatization problem in software transactional memory (STM) runtimes, and introduce the notion of partially visible reads (PVRs) to heuristic...
Virendra J. Marathe, Michael F. Spear, Michael L. ...
DAC
2009
ACM
9 years 7 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...
CINQ
2004
Springer
180views Database» more  CINQ 2004»
9 years 7 months ago
Interactivity, Scalability and Resource Control for Efficient KDD Support in DBMS
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...
Matthias Gimbel, Michael Klein, Peter C. Lockemann
EGH
2010
Springer
9 years 2 months ago
Parallel SAH k-D tree construction
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
Byn Choi, Rakesh Komuravelli, Victor Lu, Hyojin Su...
books