272 search results - page 20 / 55 » Code Transformations to Improve Memory Parallelism |
ICPP
1993
IEEE
14 years 22 days ago
1993
IEEE
: This paper presents a Data-Distributed Execution approach that exploits interation-level parallelism in loops operating over arrays. It performs data-dependency analysis, based o...
DATE
2007
IEEE
14 years 2 months ago
2007
IEEE
Because of its excellent bit-error-rate performance, the Low-Density Parity-Check (LDPC) decoding algorithm is gaining increased attention in communication standards and literatur...
POPL
1998
ACM
14 years 25 days ago
1998
ACM
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
PDPTA
2000
13 years 10 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
IPPS
1998
IEEE
14 years 26 days ago
1998
IEEE
This paper presents reduction recognition and parallel code generationstrategies for distributed-memorymultiprocessors. We describe techniques to recognize a broad range of implic...