Issue No. 07 - July (1994 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.296323
<p>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.</p>
Index Termsscheduling; multiprocessing systems; real-time systems; periodic real-time applications;multicomputers; task-flow graphs; schedulability analysis; communication requirements;segmenting messages; task allocation; message routing; contention-based objectivefunction; interval sequencing; message-interval assignment; path assignment; periodicreal-time; scheduled routing; task-flow graph
D. Agrawal and S. Shukla, "A Framework for Mapping Periodic Real-Time Applications on Multicomputers," in IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 778-784, 1994.