The Use of Queues in the Parallel Data Flow Evaluation of "If-Then-While" Programs
| dc.contributor.author | Jaffe, Jeffrey | en_US |
| dc.date.accessioned | 2023-03-29T14:10:39Z | |
| dc.date.available | 2023-03-29T14:10:39Z | |
| dc.date.issued | 1978-05 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/148932 | |
| dc.description.abstract | A property of a model of parallel computation is analyzed. We show that the use of queues may speed-up the execution of well formed data flow schemas by an arbitrarily large factor. A general model of data flow computation is presented to provide a framework for the comparison of data flow models. In particular a formal definition of a data flow version of the Computation Graphs of Karp and Miller and the Data Flow Schemas of Dennis are provided within the context of this model. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-104 | |
| dc.title | The Use of Queues in the Parallel Data Flow Evaluation of "If-Then-While" Programs | en_US |
| dc.identifier.oclc | 4803016 |
