Sciweavers

272 search results - page 9 / 55
» Code Transformations to Improve Memory Parallelism
Sort
View
PLDI
1995
ACM
14 years 3 days ago
Unifying Data and Control Transformations for Distributed Shared Memory Machines
We present a unified approach to locality optimization that employs both data and control transformations. Data transformations include changing the array layout in memory. Contr...
Michal Cierniak, Wei Li
ICS
1999
Tsinghua U.
14 years 25 days 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...
ICCS
2005
Springer
14 years 2 months ago
Performance and Scalability Analysis of Cray X1 Vectorization and Multistreaming Optimization
Cray X1 Fortran and C/C++ compilers provide a number of loop transformations, notably vectorization and multistreaming, in order to exploit the multistreaming processor (MSP) hard...
Sadaf R. Alam, Jeffrey S. Vetter
VLSID
2009
IEEE
96views VLSI» more  VLSID 2009»
14 years 9 months ago
Efficient Placement of Compressed Code for Parallel Decompression
Code compression is important in embedded systems design since it reduces the code size (memory requirement) and thereby improves overall area, power and performance. Existing res...
Xiaoke Qin, Prabhat Mishra
ISSTA
2006
ACM
14 years 2 months ago
Improving distributed memory applications testing by message perturbation
We present initial work on perturbation techniques that cause the manifestation of timing-related bugs in distributed memory Message Passing Interface (MPI)-based applications. Th...
Richard W. Vuduc, Martin Schulz, Daniel J. Quinlan...