Using a functional language and graph reduction to program multiprocessor machines or functional control of imperative programs

Author

George, L. ; Lindstrom, G.

Author_Institution

AT&T Bell Labs., Murray Hill, NJ, USA

fYear

1992

fDate

23-26 Mar 1992

Firstpage

370

Lastpage

373

Abstract

Describes an effective means for programming shared memory multiprocessors whereby a set of sequential activities are linked together for execution in parallel. The glue for this linkage is provided by a functional language implemented via graph reduction and demand evaluation. The full power of functional programming is used to obtain succinct, high level specifications of parallel computations. The imperative procedures that constitute the sequential activities facilitate efficient utilization of individual processing elements, while the mechanisms inherent in graph reduction synchronize and schedule these activities

Keywords

functional programming; high level languages; parallel programming; shared memory systems; demand evaluation; functional control; functional language; functional programming; graph reduction; high level specifications; imperative programs; multiprocessor machines; parallel computations; shared memory multiprocessors; Cities and towns; Computer science; Concurrent computing; Couplings; Parallel programming; Processor scheduling; Recycling; Sparks; Switches; Tail;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Processing Symposium, 1992. Proceedings., Sixth International

Conference_Location

Beverly Hills, CA

Print_ISBN

0-8186-2672-0

Type

conf

DOI

10.1109/IPPS.1992.223017

Filename

223017