An abstract machine for parallel graph reduction

Update item information
Publication Type technical report
School or College College of Engineering
Department Computing, School of
Creator George, Lal
Other Author Lindstrom, Gary
Title An abstract machine for parallel graph reduction
Date 1989
Description An abstract machine suitable for parallel graph reduction on a shared memory multiprocessor is described. Parallel programming is plagued with subtle race conditions resulting in deadlock or fatal system errors. Due to the nondeterministic nature of program execution the utilization of resources may vary from one run to another. The abstract machine has been designed for the efficient execution of normal order functional languages. The instructions proposed related to parallel activity are sensitive to load conditions and the current utilization of resources on the machine. The novel aspect of the architecture is the very simple set of instructions needed to control the complexities of parallel execution. This is an important step towards building a compiler for multiprocessor machines and to further language research in this area. Sample test programs hand coded in this instruction set show good performance on our 18 node BBN Butterfly as compared to a VAX 8600.
Type Text
Publisher University of Utah
First Page 1
Last Page 20
Subject Parallel graph reduction; Abstract machines
Subject LCSH Parallel programming (Computer science); Machine theory; Distributed shared memory; Multiprocessors
Language eng
Bibliographic Citation George, L., & Lindstrom, G. (1989). An abstract machine for parallel graph reduction. 1-20. UUCS-89-003.
Series University of Utah Computer Science Technical Report
Relation is Part of ARPANET
Rights Management ©University of Utah
Format Medium application/pdf
Format Extent 2330385
Identifier ir-main,16161
ARK ark:/87278/s63f56zv
Setname ir_uspace
Date Created 2012-06-13
Date Modified 2021-05-06
ID 703847
Reference URL
Back to Search Results