Arvind and D. E. Culler. Dataflow Architectures. Laboratory for Computer Science Technical Memo TM-294, Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, Massachusetts, February 1986. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
A High-Level Signal Processing Programming Language - Hicks, Jr. (1988) (1 citation) Self-citation (Arvind) (Correct)
....its arguments, s and i, nearly all of the elements of s could be undefined and fetch would still return a value; the only requirement is that s, i and the ith element of s are all defined. The non strict signal data structure is similar to the non strict cons described in Dataflow Architectures [2]. Although signals are non strict, the implementation does not have to be lazy. An eager evaluator computes all expressions as soon as the expression s subexpressions have been evaluated; a lazy evaluator does not perform a computation unless its result is needed by another expression. Lazy ....
Arvind and D. E. Culler. Dataflow Architectures. Laboratory for Computer Science Technical Memo TM-294, Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, Massachusetts, February 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