Date of Award

Spring 1996

Document Type

Thesis

Degree Name

Master of Science (MS)

Department

Electrical & Computer Engineering

Program/Concentration

Electrical Engineering

Committee Director

James F. Leathrum, Jr.

Committee Member

Roland R. Mielke

Committee Member

Martin D. Meyer

Call Number for Print

Special Collections LD4331.E55 N37

Abstract

The development of a procedure to obtain cyclo-static schedules for distributed, critical real-time applications is presented in this thesis. The applications considered in this thesis are characterized by hard deadlines and periodic inputs. The applica­ tions are described by a data flow graph model which guarantees performance. Given the data flow graph representation, processors are scheduled to complete tasks as specified in the representation. The scheduling technique separates the scheduling of tasks in time and the assignment of processors to tasks. While different criteria exist for task scheduling, a schedule which minimizes latency and maximizes throughput is used in this thesis. Given the task schedule, a cyclo-static schedule is obtained. The process utilizes a matrix to describe the graph topology and relative times resulting in a programmable procedure. This cyclo-static schedule is then integrated with the data flow graph to create a corresponding resource/data flow graph (RDFG). In the RDFG, both data and processors are treated as resources, and all required resources must be available before a node can be executed.

Rights

In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).

DOI

10.25777/vn7n-z963

Download

Share

COinS