Distributed memory compiler design for sparse problems

Author

Wu, Janet ; Das, Raja ; Saltz, Joel ; Berryman, Harry ; Hiranandan, S.

Author_Institution

Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA

Volume

44

Issue

6

fYear

1995

fDate

6/1/1995 12:00:00 AM

Firstpage

737

Lastpage

753

Abstract

This paper addresses the issue of compiling concurrent loop nests in the presence of complicated array references and irregularly distributed arrays. Arrays accessed within loops may contain accesses that make it impossible to precisely determine the reference pattern at compile time. This paper proposes a run time support mechanism that is used effectively by a compiler to generate efficient code in these situations. The compiler accepts as input a Fortran 77 program enhanced with specifications for distributing data, and outputs a message passing program that runs on the nodes of a distributed memory machine. The runtime support for the compiler consists of a library of primitives designed to support irregular patterns of distributed array accesses and irregularly distributed array partitions. A variety of performance results on the Intel iPSC/860 are presented

Keywords

FORTRAN; distributed memory systems; parallel languages; program compilers; Fortran 77 program; Intel iPSC/860; complicated array references; concurrent loop nests compilation; distributed memory compiler design; distributed memory machine; irregularly distributed arrays; message passing program; performance results; run time support mechanism; sparse problems; Computer science; Concurrent computing; Cost function; Distributed computing; Message passing; Optimizing compilers; Parallel languages; Parallel processing; Program processors; Runtime library;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.391186

Filename

391186