Dennis, J. B. Lecture Notes in Computer Science Volume 19: F'st Version of a Data Flow Procedure Language. In Programming Symposium.' Proceeding Colloque sur ta Programmarion, B. Robinet, Ed., Springer-Verlag, 1974, pp. 362-376.  Home/Search   Document Not in Database   Summary   Related Articles

....Many program structures which have bounded resource requirements excluding d n to strucre storage, may have unbounded structure storage requirements. The structure storage requirements of a program depend heavily on the model of structures employed, whether it be Dennis s general structures[15,9] or I structures [11] 1. The U interpreter is defined in terms of general structures. The Tagged Token 1General structures require a new mucture, th a single new element, be areted when an element is appended. They are usually implemented as a linked structure, so that pain of the structure can be ....

....determined. If there is any indeterminacy in the selection of tokens to participate in an activity, program results will be indeterminate as well Historically, these additional constraints have been introduced into the dataflow model in three forms. The static datafiow model proposed by Dennis [15] places the constraint that no more than one token can reside on an arc. The Q interpreter [8] allows unbounded queueing on the arcs, but requires that FIFO order be maintained; this is difficult to implement in practice. The Uinterpreter allows unbounded queueing on the arcs with no imposed ....

[Article contains additional citation context not shown here]

Dennis, J. B. Lecture Notes in Computer Science Volume 19: F'st Version of a Data Flow Procedure Language. In Programming Symposium.' Proceeding Colloque sur ta Programmarion, B. Robinet, Ed., Springer-Verlag, 1974, pp. 362-376.

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