A framework for mapping periodic real-time applications on multicomputers

Author

Shukla, Shridhar B. ; Agrawal, Dharma P.

Author_Institution

Dept. of Electr. & Comput. Eng., Naval Postgraduate Sch., Monterey, CA, USA

Volume

5

Issue

7

fYear

1994

fDate

7/1/1994 12:00:00 AM

Firstpage

778

Lastpage

784

Abstract

This short paper presents a framework for periodic execution of task-flow graphs that enables schedulability analysis of the communication requirements. The analysis performs the steps of segmenting messages, assigning the segments to specific links and time intervals, and ordering them within the intervals to generate node switching schedules that provide contention-free message routing at run-time. The analysis is also used to integrate task allocation with message routing using a contention-based objective function. Usefulness of the proposed scheme in ensuring guaranteed communication performance is demonstrated by an appropriate example

Keywords

multiprocessing systems; real-time systems; scheduling; communication requirements; contention-based objective function; interval sequencing; message routing; message-interval assignment; multicomputers; path assignment; periodic real-time; periodic real-time applications; schedulability analysis; scheduled routing; segmenting messages; task allocation; task-flow graph; task-flow graphs; Channel allocation; Communication switching; Delay; Mathematical programming; Performance analysis; Radar signal processing; Resource management; Routing; Runtime; Telecommunication traffic;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.296323

Filename

296323