PFP: a scalable parallel programming model

Author

Corda, B.C. ; Warren, Karen H.

Author_Institution

Lawrence Livermore Nat. Lab., CA, USA

fYear

1992

fDate

26-29 Apr 1992

Firstpage

170

Lastpage

173

Abstract

The Parallel Fortran Preprocessor (PFP) is a programming model for multiple instruction multiple data (MIMD) parallel computers. It provides a simple paradigm consisting of data storage modifiers and parallel execution control statements. The model is lightweight and scalable in nature. The control constructs impose no implicit synchronizations, nor do they require off-processor memory references. The model is portable. It is implemented as a source-to-source translator which requires very little support from the back-end compiler. The implementation has an option to option to produce serial code which can then be compiled for serial execution

Keywords

FORTRAN; parallel languages; parallel programming; program processors; software portability; MIMD parallel computers; PFP; Parallel Fortran Preprocessor; back-end compiler; compilation; control constructs; data storage modifiers; parallel execution control statements; portable model; scalable parallel programming model; serial code; serial execution; source-to-source translator; Communication system control; Computer aided instruction; Concurrent computing; Contracts; Hardware; Laboratories; Memory; Parallel programming; Processor scheduling; Programming profession;

fLanguage

English

Publisher

ieee

Conference_Titel

Scalable High Performance Computing Conference, 1992. SHPCC-92, Proceedings.

Conference_Location

Williamsburg, VA

Print_ISBN

0-8186-2775-1

Type

conf

DOI

10.1109/SHPCC.1992.232653

Filename

232653