Semantics of parallel program graphs

Update Item Information
Publication Type technical report
School or College College of Engineering
Department Computing, School of
Creator Keller, Robert M.
Title Semantics of parallel program graphs
Date 1977
Description A denotational model for networks of parallel processes is presented which generalizes the work of Kahn by using alternative data types, e.g. Lisp-like operators on trees. It is shown that the ordering aspect of data types plays a central role in determining how much parallelism can be present. It is also shown that this model allows an implementation independent view of concepts related to the suspensions of Friedman and Wise and the lazy evaluator of Henderson and Morris. Finally, the cyclic structures of Kahn are shown to be eliminable through the use of recursion.
Type Text
Publisher University of Utah
First Page 1
Last Page 48
Subject Parallel program graphs; Computer semantics; Denotational model
Subject LCSH Parallel processing (Electronic computers)
Language eng
Bibliographic Citation Keller, Robert M. (1977). Semantics of parallel program graphs. 1-48. UUCS-77-110.
Series University of Utah Computer Science Technical Report
Relation is Part of ARPANET
Rights Management ©University of Utah
Format Medium application/pdf
Format Extent 24,379,606 bytes
Identifier ir-main,16104
ARK ark:/87278/s6hh738t
Setname ir_uspace
ID 703281
Reference URL https://collections.lib.utah.edu/ark:/87278/s6hh738t