Large grain data-flow graph restructuring for EMSP signal processing benchmarks on the ECOS workstation system

Download
Author
Swank, David P.
Date
1993-06Advisor
Shukla, Shridhar B.
Second Reader
Zaky, Amr
Metadata
Show full item recordAbstract
This thesis documents a procedure for implementing the Revolving Cylinder scheduling algorithm for parallel programs on the ECOS Workstation System (EWS), designed specifically by AT&T for simulation of the Enhanced Modular Signal Processor (EMSP) currently in use by the United States Navy. The Revolving Cylinder (RC) algorithm provides a methodology for forcing First Come First Served (FCFS) schedulers to follow a more systematic utilization of available resources. The methods of implementation used take advantage of the Graphical Editor (gred) to insert additional data dependencies into the program structure. The thesis utilizes applications written in Signal Processing Graph Notation (SPGN), viz., a simple correlator function and the active subroutine of the U.S. Navy Sonobuoy benchmark. Results for standard FCFS scheduling and RC modified scheduling are presented for both. Special attention is paid throughout the thesis to enhancement of manufacturer supplied documentation with regard to implementation of the non-standard RC structures. Impact of the algorithm on throughput and latency is discussed, as well as performance determination using the tools provided with the ECOS Workstation System
Collections
Related items
Showing items related by title, author, creator and subject.
-
Linear optimization and image reconstruction
Rhoden, Christopher A. (Monterey, California. Naval Postgraduate School, 1994-06);The Simplex algorithm, developed by George B. Dantzig in 1947 represents a quantum leap in the ability of applied scientists to solve complicated linear optimization problems. Subsequently, its utility in solving finite ... -
The minimization of multiple valued logic expressions using parallel processors
Oral, Sabri Onur (Monterey, California. Naval Postgraduate School, 1991-09);The process of finding an exact minimization for a multiple-valued logic (MVL) expression requires an extensive search and enormous computation time. One of the heuristics to reduce this computation time is the Neighborhood ... -
Implementation of a multi-robot coverage algorithm on a two-dimensional, grid-based environment
Huang, Jo-Wen (Monterey, California: Naval Postgraduate School, 2017-06);With the development and advancement in the technology of control and multi-robot systems, robot agents are likely to take over mine countermeasure (MCM) missions one day. The path planning coverage algorithm is an essential ...