Data flow on a queue machine

Abstract

An execution model that supports program reantrancy, recurslon, 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.