Sciweavers

Share
1001 search results - page 1 / 201
» Improving memory hierarchy performance for irregular applica...
Sort
View
ICS
1999
Tsinghua U.
11 years 9 months ago
Improving memory hierarchy performance for irregular applications
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-...
John M. Mellor-Crummey, David B. Whalley, Ken Kenn...
SC
2000
ACM
11 years 9 months ago
Improving Fine-Grained Irregular Shared-Memory Benchmarks by Data Reordering
We demonstrate that data reordering can substantially improve the performance of fine-grained irregular sharedmemory benchmarks, on both hardware and software shared-memory syste...
Y. Charlie Hu, Alan L. Cox, Willy Zwaenepoel
LCR
1998
Springer
111views System Software» more  LCR 1998»
11 years 9 months ago
Memory System Support for Irregular Applications
Because irregular applications have unpredictable memory access patterns, their performance is dominated by memory behavior. The Impulse con gurable memory controller will enable s...
John B. Carter, Wilson C. Hsieh, Mark R. Swanson, ...
PARA
2004
Springer
11 years 10 months ago
Improving the Performance of Large-Scale Unstructured PDE Applications
Abstract. This paper investigates two types of overhead due to duplicated local computations, which are frequently encountered in the parallel software of overlapping domain decomp...
Xing Cai
PPOPP
2011
ACM
10 years 8 months ago
Programming the memory hierarchy revisited: supporting irregular parallelism in sequoia
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...
Michael Bauer, John Clark, Eric Schkufza, Alex Aik...
books