This Article 
 Bibliographic References 
 Add to: 
Algorithms for Supporting Compiled Communication
February 2003 (vol. 14 no. 2)
pp. 107-118
Xin Yuan, IEEE

Abstract—In this paper, we investigate the compiler algorithms to support compiled communication in multiprocessor environments and study the benefits of compiled communication assuming that the underlying network is an all-optical Time-Division-Multiplexing (TDM) network. We present an experimental compiler, E-SUIF, that supports compiled communication for High Performance Fortran (HPF) like programs on all-optical TDM networks, describe and evaluate the compiler algorithms used in E-SUIF. We further demonstrate the effectiveness of compiled communication on all-optical TDM networks by comparing the performance of compiled communication with that of a traditional communication method using a number of application programs.

[1] S.P. Amarasinghe, J.M. Anderson, M.S. Lam, and C.W. Tseng, “The SUIF Compiler for Scalable Parallel Machines,” Proc. Seventh SIAM Conf. Parallel Processing for Scientific Computing, Feb. 1995.
[2] P. Banerjee et al., "The Paradigm Compiler for Distributed-Memory Multicomputers," Computer, Vol. 28, No. 10, Oct. 1995, pp. 37-47.
[3] C.A. Brackett, "Dense Wavelength Division Multiplexing Networks: Principles and Applications," IEEE J. Selected Areas in Comm., vol. 8, no. 6, pp. 948-964, 1990.
[4] M. Bromley, S. Heller, T. McNerney, and G. L. Steele Jr., “Fortran at Ten Gigaflops: The Connection Machine Convolution Compiler,” Proc. SIGPLAN '91 Conf. Programming Language Design and Implementation, June 1991.
[5] D. Callahan and K. Kennedy, “Analysis of Interprocedural Side Effects in a Parallel Programming Environment,” J. Parallel and Distributed Computing, vol. 5, pp. 517–550, 1988.
[6] F. Cappello and C. Germain, "Towards High Communication Performance Through Compiled Communications on a Circuit Switched Interconnection Network," Proc. Int'l Symp. High Performance Computer Architecture, pp. 44-53, Jan. 1995.
[7] S. Chakrabarti, M. Gupta, and J. Choi, “Global Communication Analysis and Optimization,” Programming Language Design and Implementation, pp. 68-78, 1996.
[8] D. Culler et al., “The Generic Active Message Interface Specification,” White Paper, NOW group, UC Berkeley, available at Feb. 1995
[9] T. von Eicken et al., "U-Net: A User-Level Network Interface for Parallel and Distributed Computing," Proc. 15th ACM Symp. OS Principles, ACM Press, New York, 1995, pp. 40-53.
[10] M. Gupta, E. Schonberg, and H. Srinivasan, "A Unified Data Flow Framework for Optimizing Communication," Proc. Languages and Compilers for Parallel Computing, Aug. 1994.
[11] S. Hinrichs, “Compiler Directed Architecture-Dependent Communication Optimization,” PhD dissertation, School of Computer Science, Carnegie Mellon Univ., 1995.
[12] S. Hiranandani, K. Kennedy, and C.-W. Tseng, "Compiling Fortran D for MIMD Distributed-Memory Machines," Comm. ACM, vol. 35, no. 8, pp. 66-80, Aug. 1992.
[13] “High Performance Fortran Applications (HPFA).” available athttp://www.npac.syr.eduhpfa. June 1997.
[14] M. Kandemir, P. Banerjee, A. Choudhary, J. Ramanujam, and N. Shenoy, “A Global Communication Optimization Technique Based on Data-Flow Analysis and Linear Algebra,” Proc. First Merged Symp. IPPS/SPDP, Apr. 1998.
[15] K. Kennedy, N. ${\bf Nedeljkovi\acute c}$, and A. Sethi, “A Linear-Time Algorithm for Computing the Memory Access Sequence in Data Parallel Programs,” Proc. Fifth ACM SIGPLAN, Symp. Principles and Practice of Parallel Programming, 1995.
[16] M. Kumar, “Unique Design Concepts in GF11 and Their Impact on Performance,” IBM J. Research and Development, vol. 36, no. 6, Nov. 1992.
[17] D. Lahaut and C. Germain, “Static Communications in Parallel Scientific Programs,” PARLE '94, Parallel Architecture&Languages, July 1994.
[18] S. Pakin, Karacheti, and A. Chien, "Fast Messages (FM): Efficient, Portable Communication for Workstation Clusters and Massively-Parallel Processors," IEEE Parallel and Distributed Technology, Vol. 5, No. 2, Apr.-June 1997.
[19] C. Qiao and R. Melhem, “Reducing Communication Latency with Path Multiplexing in Optically Interconnected Multiprocessor Systems,” IEEE Trans. Parallel and Distributed Systems, vol 8, no 2, pp. 97-108, 1997.
[20] S. Salisbury, Z. Chen, and R. Melhem, “Modeling Communication Locality in Multiprocessors,” J. Parallel and Distributed Computing, vol. 56, no. 2, pp. 71-98, 1999.
[21] J. Stichnoth,D. O’Hallaron,, and T. Gross,“Generating communication for array statements: Design, implementation, and evaluation,” J. of Parallel and Distributed Computing, vol. 21, no. 1, pp. 150-159, 1994.
[22] R. Subramanian and S. Pande, “Efficient Program Partitioning Based on Compiler Controlled Communication,” Fourth Int'l Workshop High Level ProgrammingModels and Supportive Environments (HIPS '99), Apr. 1999.
[23] X. Yuan, R. Melhem, and R. Gupta, “Compiled Communication for All-Optical TDM Networks,” Supercomputing '96, Nov. 1996.
[24] X. Yuan, R. Gupta, and R. Melhem, “An Array Data Flow Analysis Based Communication Optimizer,” 10th Ann. Workshop Languages and Compilers for Parallel Computing, (LCPC '97), Aug. 1997.
[25] X. Yuan, R. Melhem, and R. Gupta, “Distributed Path Reservation Algorithms for Multiplexed All-Optical Interconnection Network,” IEEE Trans. Computers, pp. 1355-1363, Dec. 1999.
[26] X. Yuan, R. Gupta, and R. Melhem, “Compiler Analysis to Support Compiled Communication for HPF-Like Programs,” 13th Int'l Parallel Processing Symp. and 10th Symp. Parallel and Distributed Processing, Apr. 1999.
[27] X. Yuan, R. Melhem, and R. Gupta, “Performance of Multi-Hop Communications Using Logical Topologies on Optical Torus Networks,” J. Parallel and Distributed Computing, vol. 61, no. 6, pp. 748-766, June 2001.

Index Terms:
Compiled communication, communication optimization, compilation techniques for distributed memory machines, all-optical networks.
Xin Yuan, Rami Melhem, Rajiv Gupta, "Algorithms for Supporting Compiled Communication," IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 2, pp. 107-118, Feb. 2003, doi:10.1109/TPDS.2003.1178875
Usage of this product signifies your acceptance of the Terms of Use.