The Misconstrued Semicolon: Reconciling Imperative Languages and Dataflow Machines |
From inside the book
Results 1-3 of 27
Page 3
Reconciling Imperative Languages and Dataflow Machines A. H. Veen. To explore the difficulties involved in the ... Manchester . No description of the instruction set of the target machine was available at the time so a simple instruction ...
Reconciling Imperative Languages and Dataflow Machines A. H. Veen. To explore the difficulties involved in the ... Manchester . No description of the instruction set of the target machine was available at the time so a simple instruction ...
Page 26
... Manchester Gurd & Watson , 1976 1981 Dataflow Machine Manchester DDSP Data - Driven Signal Processor Hogenauer , ESL DFM - 1 List - processing - oriented Amamiya , Tokyo 1980 1983 Dataflow Machine ... machine has been 26 2. Dataflow Machines.
... Manchester Gurd & Watson , 1976 1981 Dataflow Machine Manchester DDSP Data - Driven Signal Processor Hogenauer , ESL DFM - 1 List - processing - oriented Amamiya , Tokyo 1980 1983 Dataflow Machine ... machine has been 26 2. Dataflow Machines.
Page 31
Reconciling Imperative Languages and Dataflow Machines A. H. Veen. 2.5 . The Manchester Data Flow Machine Around 1976 John Gurd and Ian Watson started a research project on data flow computing at the University of Manchester . They ...
Reconciling Imperative Languages and Dataflow Machines A. H. Veen. 2.5 . The Manchester Data Flow Machine Around 1976 John Gurd and Ian Watson started a research project on data flow computing at the University of Manchester . They ...
Contents
Introduction 12345 | 1 |
Dataflow Programming | 3 |
Dataflow Machines | 8 |
Copyright | |
8 other sections not shown
Common terms and phrases
ACCESS-BRANCH node activation name algorithm alias access graph alias graph allocation application architecture array ARRAY-ACCESS assignment attach boolean BRANCH node chainer chapter cocoon compiler complicated concurrently conditional aliases conditional expression constant contains control flow control flow graph copy created cycle Data Flow Analysis data structures data-dependency dataflow code dataflow graph dataflow languages dataflow machines dataflow program declarative program defined deflist demand graph construction demand propagation descend described efficient encoded ENTRY-LOOP node evaluation execution EXIT-LOOP Figure global variables imperative languages imperative program implementation input port instruction Integer interface nodes interprocedural iteration level LACA lacap LINK-OUT nodes loop macro Manchester Dataflow Machine matching unit mechanism memory MERGE nodes method operand optimizations outgoing arcs output arcs parallel computer PARAMETER parse tree pointer procedure call processing element processors programming language propagation rules recursive retrieves static stored string subgraph SUMMER surrounding expression syntax tree token translation use-definition value-domain