Actions for Strategies for concurrent processing of complex algorithms in data driven architectures

Email RIS file
Bookmark
Report an Issue

Strategies for concurrent processing of complex algorithms in data driven architectures

Author
Mielke, Roland R.
Published
Apr 1, 1990.
Physical Description
1 electronic document
Additional Creators
Som, Sukhamony and Stoughton, John W.
Online Version

Availability

I Want It
I Want It

Finding items...

Restrictions on Access
Unclassified, Unlimited, Publicly available.
Free-to-read Unrestricted online access
Summary
The performance modeling and enhancement for periodic execution of large-grain, decision-free algorithms in data flow architectures is examined. Applications include real-time implementation of control and signal processing algorithms where performance is required to be highly predictable. The mapping of algorithms onto the specified class of data flow architectures is realized by a marked graph model called ATAMM (Algorithm To Architecture Mapping Model). Performance measures and bounds are established. Algorithm transformation techniques are identified for performance enhancement and reduction of resource (computing element) requirements. A systematic design procedure is described for generating operating conditions for predictable performance both with and without resource constraints. An ATAMM simulator is used to test and validate the performance prediction by the design procedure. Experiments on a three resource testbed provide verification of the ATAMM model and the design procedure.
Other Subject(s)
Collection
NASA Technical Reports Server (NTRS) Collection.
Note
Document ID: 19900012219.
Accession ID: 90N21535.
NAS 1.26:186515.
NASA-CR-186515.
Terms of Use and Reproduction
No Copyright.
View MARC record | catkey: 15686675