The Misconstrued Semicolon: Reconciling Imperative Languages and Dataflow Machines |
From inside the book
Results 1-3 of 22
Page 29
... allocation of nodes and structures can have a great influence on the performance of the machine . Since elaborate facilities are needed to make this allocation as flexible as possible , allocation of memory and of tags is under control ...
... allocation of nodes and structures can have a great influence on the performance of the machine . Since elaborate facilities are needed to make this allocation as flexible as possible , allocation of memory and of tags is under control ...
Page 40
... allocation schemes . Static allocation ( i.e. allocation that does not take the current load distribution into account ) probably requires a good compiler that provides locality information . Some experience with static allocation is ...
... allocation schemes . Static allocation ( i.e. allocation that does not take the current load distribution into account ) probably requires a good compiler that provides locality information . Some experience with static allocation is ...
Page 127
... allocated on the stack , the availability of such assertions can sharply reduce the allocation of objects on the heap and consequently garbage collection overhead . An application like this consists mainly of use - definition analysis ...
... allocated on the stack , the availability of such assertions can sharply reduce the allocation of objects on the heap and consequently garbage collection overhead . An application like this consists mainly of use - definition analysis ...
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