By Topic

A flow graph analysis algorithm for a data driven reconfigurable parallel pipelined computer architecture

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
J. Cochran ; IBM, Houston, TX, USA ; J. R. Heath ; W. A. Chren

A flow graph analysis algorithm (FGAA) and its proof, utilized in conjunction with a data-driven reconfigurable parallel-pipelined computer architecture system, are presented. The architectural system was developed such that any real-time data-driven application describable as a data-flow graph could be executed on the system. A requirement for utilization of the architectural system is an ability to describe the structure and linkages of the data-flow graph to the operating system (OS). This requirement is accomplished by a data-flow language and interpreter, which is described. A second requirement is that the OS must have the capability of algorithmically assigning processes of a flow graph to specific computing elements (CEs) of the architecture, in a manner that assures that real-time timing constraints from input node to output node of any data flow graph can be met. A third requirement is that processes must be assigned to CEs in a manner which minimizes system resources. The FGAA was developed to meet these latter requirements

Published in:

Southeastcon '89. Proceedings. Energy and Information Technologies in the Southeast., IEEE

Date of Conference:

9-12 Apr 1989