Publication Type |
Journal Article |
School or College |
College of Engineering |
Department |
Computing, School of |
Creator |
Keller, Robert M. |
Title |
An approach to determinacy proofs |
Date |
1978 |
Description |
It is known that any parallel program graph composed of continuous operators itself represents a continuous function. In other words, the network is determinate in the sense that for a given input, the output is unique, independent of the timing of the constituent operators. This result is applied to some unusual data types, resulting in a determinacy proof for a parallel version of the alpha-beta minimax procedure. The notion of the context of a function is introduced, and its usefulness in constructing such proofs is demonstrated. |
Type |
Text |
Publisher |
University of Utah |
First Page |
1 |
Last Page |
30 |
Subject |
Parallel program graph; Determinacy proofs |
Subject LCSH |
Parallel programs (Computer programs) |
Language |
eng |
Bibliographic Citation |
Keller, R. M. (1978). An approach to determinacy proofs. 1-30. UUCS-78-102. |
Series |
University of Utah Computer Science Technical Report |
Relation is Part of |
ARPANET |
Rights Management |
©University of Utah |
Format Medium |
application/pdf |
Format Extent |
3,960,439 bytes |
Identifier |
ir-main,16008 |
ARK |
ark:/87278/s6w6744r |
Setname |
ir_uspace |
ID |
704748 |
Reference URL |
https://collections.lib.utah.edu/ark:/87278/s6w6744r |