Arvind and David Culler. Dataflow Architectures, volume 1, pages 225--253. Annual Reviews Inc., 1986. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Coercion as a Metaphor for Computation - Jagannathan (Correct)
....the base language graphs is fixed at compile time; there are no function application operators that can instantiate new copies of function graphs at runtime. Iteration is supported by allowing cyclic graphs to be constructed. Readers unfamiliar with the dataflow model of computation should consult [5] which gives a comprehensive introduction to the subject. 5 In other words, this simulation assumes unlimited queuing on edges. endfun The iter construct creates a new local environment for i and p and evaluates the expressions to which they are bound in the context of this new environment. ....
Arvind and David Culler. Dataflow Architectures, volume 1, pages 225--253. Annual Reviews Inc., 1986.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC