P. Feautrier, J.-F. Collard, M. Barreteau, D. Barthou, A. Cohen, and V. Lefebvre. The interplay of expansion and scheduling in paf. Technical Report 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Unified Framework for Schedule and Storage Optimization - Thies, al. (2001) (9 citations) (Correct)
....gap between clock speed and memory latency, and with modern memory systems becoming increasingly hierarchical, the amount of storage space required by a program can have a drastic e ect on its performance. Nonetheless, parallelizing compilers often employ varying degrees of array expansion [9, 5, 1] to eliminate elementlevel anti and output dependencies, thereby adding large amounts of storage that mayormay not be justi ed by the resulting gains in parallelism. #### ################# ######### #### ########### ######## ##### # ####### ########### ######### ## #### ##### ###### ## ### ....
P.Feautrier, J.-F. Collard, M. Barreteau, D. Barthou, A. Cohen, and V. Lefebvre. The interplay of expansion and scheduling in paf, 1998.
A Unified Framework for Schedule and Storage Optimization - Thies (2002) (9 citations) (Correct)
....layout, then the overwriting would cause iteration (i; j) to read the value written by (i 1; j 2) instead of (i; j 2) the anti dependence would have been violated. Thus, it is for the purpose of exposing parallelism that many compilers expand arrays in their internal representation of programs [10, 1]. However, expansion comes at a cost, as well, since larger data structures can ruin performance if they cause an 9 over ow of the register set, cache, or DRAM. Ideally, one would like to consider all possible storage mappings and instruction schedules and to choose the combination that results ....
P. Feautrier, J.-F. Collard, M. Barreteau, D. Barthou, A. Cohen, and V. Lefebvre. The Interplay of Expansion and Scheduling in PAF. Technical Report 1998.
A Unified Framework for Schedule and Storage Optimization - Thies, Vivien, Sheldon.. (2001) (9 citations) (Correct)
....gap between clock speed and memory latency, and with modern memory systems becoming increasingly hierarchical, the amount of storage space required by a program can have a drastic e ect on its performance. Nonetheless, parallelizing compilers often employ varying degrees of array expansion [9, 5, 1] to eliminate elementlevel anti and output dependencies, thereby adding large amounts of storage that may or may not be justi ed by the resulting gains in parallelism. This document is MIT LCS Technical Memo LCS TM 613, November 2000. A similar document was submitted to PLDI 2001. Please do ....
P. Feautrier, J.-F. Collard, M. Barreteau, D. Barthou, A. Cohen, and V. Lefebvre. The interplay of expansion and scheduling in paf, 1998.
A Unified Framework for Schedule and Storage Optimization - Thies, Vivien, Sheldon.. (2001) (9 citations) (Correct)
No context found.
P. Feautrier, J.-F. Collard, M. Barreteau, D. Barthou, A. Cohen, and V. Lefebvre. The interplay of expansion and scheduling in paf. Technical Report 1998.
A Unified Framework for Schedule and Storage Optimization - Thies (2002) (9 citations) (Correct)
No context found.
P. Feautrier, J.-F. Collard, M. Barreteau, D. Barthou, A. Cohen, and V. Lefebvre. The Interplay of Expansion and Scheduling in PAF. Technical Report 1998.
A Unified Framework for Schedule and Storage Optimization - Thies, Vivien, Sheldon.. (2001) (9 citations) (Correct)
No context found.
P. Feautrier, J.-F. Collard, M. Barreteau, D. Barthou, A. Cohen, and V. Lefebvre. The interplay of expansion and scheduling in paf. Technical Report 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC