jayar@utecfa.UUCP (Jonathan Rose) (06/07/85)
Cider Seminar Series
Part CXVI
Data Flow on a Queue Machine
By Bruno Preiss
Room GB 244
Time: 12:05
Date: Friday June 14, 1985
Abstract
A data-flow execution model that supports program reentrancy,
recursion, and automatic run-time loop unravelling will be
described. It uses queue machines that execute acyclic data-flow
graphs. Separate instruction and data token spaces allow reen-
trancy. Execution environments called contexts execute acyclic
data-flow graphs associated with high-level code blocks. Itera-
tion and function activation are implemented by the dynamic crea-
tion of contexts and do not require the use of tagged tokens.
A multiprocessor architecture that supports this execution model
is proposed. The results of simulating the execution of several
test programs will be presented.
(To be presented at the Computer Architecture Symposium in Bos-
ton, June 16-19, 1985.)