Mapping fortran programs to single assignment semantics for efficient parallelization
Ημερομηνία
1998Source
Parallel Processing LettersVolume
8Issue
3Pages
407-418Google Scholar check
Keyword(s):
Metadata
Εμφάνιση πλήρους εγγραφήςΕπιτομή
This paper presents Mustang, a system that automatically parallellizes Fortran programs by mapping them to single assignment semantics. Specifically, sequential Fortran source programs are translated into IF1, a machine-independent dataflow graph description language that is the intermediate form for the SISAL language. During this translation, Parafrase 2 is used to parse the source program perform dependency analysis and to detect opportunities for parallelization which are then explicitly introduced into the IF1 program. The resulting IF1 program is then processed by the Optimizing SISAL Compiler which produces parallel executables on multiple target platforms. A working prototype has been developed and tested. The execution results of several Livermore Loops are presented and compared against Fortran and SISAL implementations on two different platforms. The initial results obtained provide proof of concept that Fortran can be mapped to Single Assignment Semantics without sacrificing efficiency. © World Scientific Publishing Company.
Collections
Cite as
Related items
Showing items related by title, author, creator and subject.
-
Article
A multimedia programming model based on timed concurrent constraint programming
Papadopoulos, George Angelos (1998)We propose the development of multimedia programming frameworks based on the declarative logic programming setting and in particular the framework of object-oriented timed concurrent constraint programming (OO-TCCP). The ...
-
Article
Asynchronous timed multimedia environments based on the coordination paradigm
Papadopoulos, George Angelos (2003)This paper combines work done in the areas of Artificial Intelligence, Multimedia Systems and Coordination Programming to derive a framework for Distributed Multimedia Systems based on asynchronous timed computations ...
-
Article
Concurrent object-oriented programming using term graph rewriting techniques
Papadopoulos, George Angelos (1996)The generalized computational model of Term Graph Rewriting Systems is used as the basis for expressing concurrent object-oriented programming techniques exploiting the fine grain highly parallel features of TGRS in a ...