131 search results - page 15 / 27 » Copy Elimination for Parallelizing Compilers |
PPOPP
2005
ACM
15 years 3 months ago
2005
ACM
In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...
HASKELL
2005
ACM
15 years 3 months ago
2005
ACM
Multi-core processors are coming, and we need ways to program them. The combination of purely-functional programming and explicit, monadic threads, communicating using transaction...
ICPP
1995
IEEE
15 years 1 months ago
1995
IEEE
Loop fusion improves data locality and reduces synchronization in data-parallel applications. However, loop fusion is not always legal. Even when legal, fusion may introduce loop-...
ISHPC
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. Dynamic program optimization is the only recourse for optimizing compilers when machine and program parameters necessary for applying an optimization technique are unknow...
SAC
2002
ACM
14 years 9 months ago
2002
ACM
This paper presents a novel approach for the problem of generating tiled code for nested for-loops using a tiling transformation. Tiling or supernode transformation has been widel...