365 search results - page 20 / 73 » Automatic Performance Debugging of SPMD Parallel Programs |
PPOPP
1999
ACM
15 years 2 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
PLDI
2011
ACM
14 years 19 days ago
2011
ACM
The performance benefits of GPU parallelism can be enormous, but unlocking this performance potential is challenging. The applicability and performance of GPU parallelizations is...
KBSE
2005
IEEE
15 years 3 months ago
2005
IEEE
The high cost of locating faults in programs has motivated the development of techniques that assist in fault localization by automating part of the process of searching for fault...
GPCE
2009
Springer
15 years 2 months ago
2009
Springer
This paper describes a language and framework that allow coordinated transformations driven by invariants to be specified declaratively, as invariant rules, and applied automatic...
102
click to vote
EUROPAR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. This paper presents the XJava compiler for parallel programs. It exploits parallelism based on an object-oriented stream programming paradigm. XJava extends Java with new...