Arvind. and K- P. Gostelow. A Computer Capable of Exchanging Processors for Tune. Information Processing 77: Pmceedin oflFIP Congress 77, IFIP, AuguSt, 1977, pp. 849-853.  Home/Search   Document Not in Database   Summary   Related Articles

....and used only once. No bounds are placed on the number of tokens which may reside on a arc, the number of simultaneously executing operations, or the size of the labels carried on tokens. A program is allowed to unfold in an unconstrained manner, exposing as much parallel activity as possible [7]. In the Tagged Token Dataflow Architecture, resources are in finite supply, allocated explicitly, and reused by necessity. A given machine configuration offers a fixed amount of token storage and a fixed number of processors. The labels carded on tokens are represented by fixed size tags. The ....

Arvind. and K- P. Gostelow. A Computer Capable of Exchanging Processors for Tune. Information Processing 77: Pmceedin oflFIP Congress 77, IFIP, AuguSt, 1977, pp. 849-853.

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