Minimizing data and synchronization costs in one-way communication

被引:5
作者
Kandemir, M [1 ]
Choudhary, A
Banerjee, P
Ramanujam, J
Shenoy, N
机构
[1] Penn State Univ, Dept Comp Sci & Engn, University Pk, PA 16802 USA
[2] Northwestern Univ, Dept Elect & Comp Engn, Evanston, IL USA
[3] Louisiana State Univ, Dept Elect & Comp Engn, Baton Rouge, LA 70803 USA
基金
美国国家科学基金会;
关键词
one-way communication; message-passing; redundant synchronization; compiler optimizations; data-flow analysis; linear algebra techniques; data-parallel languages;
D O I
10.1109/71.895791
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Minimizing communication and synchronization costs is crucial to the realization of the performance potential of parallel computers. This paper presents a general technique which uses a global data-flow framework to optimize communication and synchronization in the context of the one-way communication model. In contrast to the conventional send/receive message-passing communication model, one-way communication is a new paradigm that decouples message transmission and synchronization. In parallel machines with appropriate low-level support, this may open up new opportunities not only to further optimize communication. but also to reduce the synchronization overhead. We present optimization techniques using our framework for eliminating redundant data communication and synchronization operations. Our approach works with the most general data alignments and distributions in languages like High Performance Fortran (HPF) and uses a combination of the traditional data-flow analysis and polyhedral algebra. Empirical results for several scientific benchmarks on a Gray T3E multiprocessor machine demonstrate that our approach is successful in reducing the number of data (communication) and synchronization messages, thereby reducing the overall execution times.
引用
收藏
页码:1232 / 1251
页数:20
相关论文
共 57 条
[1]  
ADVE V, 2001, IN PRESS LANGUAGES C, pCH18
[2]  
ADVE V, 1997, TR97275 COMP SCI DEP
[3]  
Agrawal G, 1997, SOFTWARE PRACT EXPER, V27, P519, DOI 10.1002/(SICI)1097-024X(199705)27:5<519::AID-SPE95>3.0.CO
[4]  
2-O
[5]  
Aho Alfred V., 1986, ADDISON WESLEY SERIE
[6]  
Amarasinghe S. P., 1993, SIGPLAN Notices, V28, P126, DOI 10.1145/173262.155102
[7]  
ANCOURT A, 1997, SCI PROGRAMMING-NETH, V6, P3
[8]  
[Anonymous], 1997, MPI 2 EXT MESS PASS
[9]  
[Anonymous], 1993, CRAY T3D SYST ARCH O
[10]   THE PARADIGM COMPLIER FOR DISTRIBUTED-MEMORY MULTICOMPUTERS [J].
BANERJEE, P ;
CHANDY, JA ;
GUPTA, M ;
HODGES, EW ;
HOLM, JG ;
LAIN, A ;
PALERMO, DJ ;
RAMASWAMY, S ;
SU, E .
COMPUTER, 1995, 28 (10) :37-+