| dc.contributor.advisor | Dennis, Jack B. | en_US |
| dc.contributor.author | Linderman, John P. | en_US |
| dc.date.accessioned | 2023-03-29T14:57:21Z | |
| dc.date.available | 2023-03-29T14:57:21Z | |
| dc.date.issued | 1973-12 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149419 | |
| dc.description.abstract | A general model for parallel computation is developed in three parts. One part, the data flow graph, describes how actors which transform and test values are connected to the locations in a finite memory. Another part, an interpretation, supplies information about the contents of memory and the detailed nature of the transformations and tests. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-111 | |
| dc.relation.ispartofseries | MAC-TR-111 | |
| dc.title | Productivity in Parallel Computational Schemata | en_US |
| dc.identifier.oclc | 02527735 | |
