Language portability across shared memory multiprocessors

Author

Alaghband, Gita ; Benten, Muhammad S. ; Jakob, Ruediger ; Jordan, Harry F. ; Ramanan, Aruna V.

Author_Institution

Dept. of Comput. Sci. & Eng., Colorado Univ., Denver, CO, USA

Volume

4

Issue

9

fYear

1993

fDate

9/1/1993 12:00:00 AM

Firstpage

1064

Lastpage

1072

Abstract

Explains why the Force parallel programming language has been easily portable between eight different shared memory multiprocessors. The authors show how a two-layer macro processor allows them to hide machine dependencies and to build machine-independent high-level language constructs. The importance of packaging low-level synchronization operations is demonstrated by a proof of mutual exclusion for asynchronous variable operations. The Force constructs enable one to write portable parallel programs largely independent of the number of processes executing them

Keywords

parallel languages; parallel programming; shared memory systems; software portability; Force; MIMD multiprocessor; asynchronous variable operations; low-level synchronization; macro processor; mutual exclusion; parallel language; parallel programming language; portability; portable parallel programs; shared memory; shared memory multiprocessors; synchronization; Decision trees; Difference equations; Notice of Violation; Parallel processing; Parallel programming; Processor scheduling; Prototypes; Scheduling algorithm; Testing; Timing;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.243532

Filename

243532