7 search results - page 1 / 2 » Scalable and precise dynamic datarace detection for structur... |
102
Voted
PLDI
2012
ACM
12 years 12 months ago
2012
ACM
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...
ICPP
2008
IEEE
15 years 3 months ago
2008
IEEE
—We address the recently recognized privatization problem in software transactional memory (STM) runtimes, and introduce the notion of partially visible reads (PVRs) to heuristic...
101
click to vote
DAC
2009
ACM
15 years 1 months ago
2009
ACM
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...
132
Voted
CINQ
2004
Springer
15 years 1 months ago
2004
Springer
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...
EGH
2010
Springer
14 years 7 months ago
2010
Springer
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...