Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
An Overview of the SUIF Compiler for Scalable Parallel Machines \Lambda
 

Summary: Chapter 1
An Overview of the
SUIF Compiler for Scalable Parallel Machines \Lambda
Saman P. Amarasinghe y Jennifer M. Anderson y Monica S. Lam y
Chau­Wen Tseng y
Abstract
We are building a compiler that automatically translates sequential scientific
programs into parallel code for scalable parallel machines. Many of the compiler
techniques needed to generate correct and efficient code are common across all scalable
machines, regardless of whether its address space is shared or distributed. This
paper describes the structure of the compiler, emphasizing the common analyses and
optimizations. We focus on the three major phases of the compiler: parallelism and
locality analysis, communication and synchronization analysis, and code generation.
1 Introduction
We are currently developing the SUIF (Stanford University Intermediate Format)[9]
compiler system for researching compiler techniques for high­performance architectures.
One of the major goals of this compiler is to automatically translate sequential dense
matrix computations into efficient parallel code for large­scale parallel machines. We are
targeting distributed address space (DAS) machines, such as the Intel Paragon and the
IBM SP2, as well as shared address space (SAS) machines, such as the Stanford DASH

  

Source: Amarasinghe, Saman - Computer Science and Artificial Intelligence Laboratory & Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT)

 

Collections: Computer Technologies and Information Sciences