TY - JOUR
T1 - Segmented alignment
T2 - An enhanced model to align data parallel programs of HPF
AU - Hwang, Gwan Hwan
AU - Chen, Cheng Wei
AU - Lee, Jenq Kuen
AU - Dz-Ching Ju, Roy
N1 - Funding Information:
G. H. Hwang’s work was supported in part by NSC-89-2218-E-260-016 and MOE research excellent project under grant no. 89-E-FA04-1-4 of Taiwan. C. W. Chen and J. K. Lee’s work was supported in part by NSC-90-2218-E-007-042, NSC-90-2213-E-007-074, NSC-90-2213-E-007-075, MOE research excellent project under grant no. 89-E-FA04-1-4, and MOEA research project und er grant no. 91-EC-17-A-03-S1-0002 of Taiwan.
PY - 2003/5
Y1 - 2003/5
N2 - In this paper, we propose a new automatic data alignment model called segmented alignment. The conventional data alignment model, such as that used in High-Performance Fortran (HPF), aligns arrays with the whole index domain. The principle of our proposed segmented alignment is to allow alignment relations within delimited index domains. We first provide motivating examples to illustrate how code fragments of HPF with EOSHIFT or CSHIFT operations, or produced by synthesis operations can benefit from our enhanced alignment scheme. Second, we show that this new model can be implemented in HPF-like languages by adding WHEN and IN constructs to them. In addition, we show that the new proposed schemes for WHEN and IN constructs can be emulated using standard HPF syntax. Finally, we address issues related to automatic data alignment for the new proposed model, and present an algorithm to automatically align programs using our segmented alignment scheme. Since the optimal algorithm to do this is NP-hard. a practical heuristic is also given. Our experiments were performed on a DEC Alpha Farm with HPF environments. Our experiments confirm our theory that our proposed alignment scheme can significantly enhance not only the performance of HPF code fragments with EOSHIFT or CSHIFT operations, but also that of codes produced by synthesis operations.
AB - In this paper, we propose a new automatic data alignment model called segmented alignment. The conventional data alignment model, such as that used in High-Performance Fortran (HPF), aligns arrays with the whole index domain. The principle of our proposed segmented alignment is to allow alignment relations within delimited index domains. We first provide motivating examples to illustrate how code fragments of HPF with EOSHIFT or CSHIFT operations, or produced by synthesis operations can benefit from our enhanced alignment scheme. Second, we show that this new model can be implemented in HPF-like languages by adding WHEN and IN constructs to them. In addition, we show that the new proposed schemes for WHEN and IN constructs can be emulated using standard HPF syntax. Finally, we address issues related to automatic data alignment for the new proposed model, and present an algorithm to automatically align programs using our segmented alignment scheme. Since the optimal algorithm to do this is NP-hard. a practical heuristic is also given. Our experiments were performed on a DEC Alpha Farm with HPF environments. Our experiments confirm our theory that our proposed alignment scheme can significantly enhance not only the performance of HPF code fragments with EOSHIFT or CSHIFT operations, but also that of codes produced by synthesis operations.
KW - Automatic array alignment
KW - Compiler optimization
KW - Distributed-memory machines
KW - HPF compilers
KW - Parallelizing compiler
KW - Segmented alignment
UR - http://www.scopus.com/inward/record.url?scp=0038682000&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0038682000&partnerID=8YFLogxK
U2 - 10.1023/A:1022852522319
DO - 10.1023/A:1022852522319
M3 - Article
AN - SCOPUS:0038682000
SN - 0920-8542
VL - 25
SP - 17
EP - 41
JO - Journal of Supercomputing
JF - Journal of Supercomputing
IS - 1
ER -