Algorithms for supporting compiled communication

Author

Yuan, Xin ; Melhem, Rami ; Gupta, Rajiv

Author_Institution

Dept. of Comput. Sci., Florida State Univ., Tallahassee, FL, USA

Volume

14

Issue

2

fYear

2003

fDate

2/1/2003 12:00:00 AM

Firstpage

107

Lastpage

118

Abstract

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, and 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.

Keywords

FORTRAN; distributed memory systems; optical fibre networks; program compilers; time division multiplexing; E-SUIF; HPF-like programs; High Performance Fortran; all-optical TDM networks; all-optical time-division-multiplexing network; application programs; compiled communication support; compiler algorithms; distributed memory machines; experimental compiler; multiprocessor environments; All-optical networks; Bandwidth; Computer science; Libraries; Multiprocessor interconnection networks; Optimizing compilers; Program processors; Resource management; Time division multiplexing; WDM networks;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/TPDS.2003.1178875

Filename

1178875