PPOPP
2011
ACM
13 years 2 months ago
2011
ACM
We describe two novel constructs for programming parallel machines with multi-level memory hierarchies: call-up, which allows a child task to invoke computation on its parent, and...
ASPLOS
2008
ACM
14 years 1 months ago
2008
ACM
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism ar...
ISHPC
2000
Springer
14 years 3 months ago
2000
Springer
Traditional parallel compilers do not effectively parallelize irregular applications because they contain little looplevel parallelism due to ambiguous memory references. We explo...
LCR
1998
Springer
14 years 3 months ago
1998
Springer
Because irregular applications have unpredictable memory access patterns, their performance is dominated by memory behavior. The Impulse con gurable memory controller will enable s...
ICS
1999
Tsinghua U.
14 years 3 months ago
1999
Tsinghua U.
The performance of irregular applications on modern computer systems is hurt by the wide gap between CPU and memory speeds because these applications typically underutilize multi-...
PPOPP
2006
ACM
14 years 5 months ago
2006
ACM
In prior work, we have proposed techniques to extend the ease of shared-memory parallel programming to distributed-memory platforms by automatic translation of OpenMP programs to ...
ISPASS
2009
IEEE
14 years 6 months ago
2009
IEEE
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...