Data Flow on a Queue Machine

logo Website of Bruno R. Preiss
next up contents external
Next : Short-Packet Transfer Performance in Up: Conference Papers Previous: A Cache-based Message Passing

  Bruno  Richard Preiss and V.  Carl Hamacher. In Proc. 12th Int. Symp. on Computer Architecture , pages 342-351, Boston, MA, August 1985. Institute of Electrical and Electronics Engineers, Inc.[47].
An execution model that supports program reentrancy, recursion, and automatic run-time loop unravelling is described. This execution model is based on queue machines that execute acyclic data-flow graphs. The use of separate instruction and data token spaces allows program reentrancy. Execution environments called contexts execute acyclic data-flow graphs associated with high-level code blocks. Iteration and function activation are implemented by the dynamic creation of contexts and do not require the use of tagged tokens.

A multiprocessor architecture that supports this execution model is proposed. The system architecture is based on a partitioned ring in which each partition of the ring is a conventional processor/memory bus.

The proposed architecture has been simulated in software. A number of test programs have been developed and their execution on the proposed architecture has been evaluated. The performance of the proposed architecture with various numbers of processing elements is described. In addition, a number of task scheduling algorithms are presented and evaluated.

Copyright 1985 by Institute of Electrical and Electronics Engineers, Inc.

external Full text. external BibTeX entry.



bruno Copyright 2002 by Bruno R. Preiss, P.Eng. All rights reserved.
Tue Jan 1 13:41:25 EST 2002



Data Structures and Algorithms With Object-Oriented Design Patterns in Java
Data Structures and Algorithms with Object-Oriented Design Patterns in Java (Worldwide Series in Computer Science)
ISBN: 0471346136
EAN: 2147483647
Year: 1999
Pages: 100

flylib.com © 2008-2017.
If you may any questions please contact us: flylib@qtcs.net