Abstract
Machine-level operations used for executing purely deterministic data-flow graphs are described, and extensions providing a basis for nondeterministic computation are proposed. Implementation models for a variety of low and high level constructs are developed. The feasibility of using C. A. R. Hoare's communicating processes as a high-level, nondeterministic language for a data-driven computer is demonstrated.
| Original language | English |
|---|---|
| Title of host publication | IFIP Congress Series|IFIP Congr Ser |
| Place of Publication | Amsterdam, Neth |
| Publisher | Elsevier BV |
| Pages | 251-256 |
| Number of pages | 5 |
| Volume | 8 |
| Publication status | Published - 1980 |
| Event | Inf Process 80, Proc of IFIP Congr 80, Oct 6-9 1980 - Tokyo, Jpn Duration: 1 Jul 1980 → … http://dblp.uni-trier.de/db/conf/ifip/ifip80.html#CattoG80http://dblp.uni-trier.de/rec/bibtex/conf/ifip/CattoG80.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/ifip/CattoG80 |
Conference
| Conference | Inf Process 80, Proc of IFIP Congr 80, Oct 6-9 1980 |
|---|---|
| City | Tokyo, Jpn |
| Period | 1/07/80 → … |
| Internet address |
Fingerprint
Dive into the research topics of 'NONDETERMINISTIC DATAFLOW GRAPHS.'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver