Cider Seminar: Data Flow on a Queue Machine

Article View: ut.general

Article #176

#176

From: Jonathan Rose
Date: Fri, 07 Jun 1985 18:32

27 lines
1642 bytes

		    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.)

Technical Details

Message-ID: <1723@utecfa.UUCP>

Path: arc1-ca.pugleaf.net!utzoo!utcsri!utai!uthub!utecfa!jayar

Show Full Headers

Complete Article Headers

Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10 beta 3/9/83; site utecfa.UUCP
Path: arc1-ca.pugleaf.net!utzoo!utcsri!utai!uthub!utecfa!jayar
From: jayar@utecfa.UUCP (Jonathan Rose)
Newsgroups: ut.general
Subject: Cider Seminar: Data Flow on a Queue Machine
Message-ID: <1723@utecfa.UUCP>
Date: Fri, 7-Jun-85 14:32:27 EDT
Article-I.D.: utecfa.1723
Posted: Fri Jun  7 14:32:27 1985
Date-Received: Fri, 7-Jun-85 16:46:11 EDT
Organization: Engineering Computing Facility, University of Toronto
Lines: 27