272 search results - page 5 / 55 » Code Transformations to Improve Memory Parallelism |
PPOPP
2003
ACM
15 years 2 months ago
2003
ACM
Quadtree matrices using Morton-order storage provide natural blocking on every level of a memory hierarchy. Writing the natural recursive algorithms to take advantage of this bloc...
DAGSTUHL
2007
14 years 11 months ago
2007
The model-based transformation of loop programs is a way of detecting fine-grained parallelism in sequential programs. One of the challenges is to agglomerate the parallelism to a...
74
Voted
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
Over the past several decades, the compiler research community has developed a number of sophisticated and powerful algorithms for a varierty of code improvements. While there are...
IEEEHPCS
2010
14 years 7 months ago
2010
Stream languages explicitly describe fork-join parallelism and pipelines, offering a powerful programming model for many-core Multi-Processor Systems on Chip (MPSoC). In an embedd...
PC
2006
14 years 9 months ago
2006
Tiling is a well known loop transformation used to reduce communication overhead in distributed memory machines. Although a lot of theoretical research has been done concerning th...