A FRAMEWORK FOR MAPPING PERIODIC REAL-TIME APPLICATIONS ON MULTICOMPUTERS

This short paper presents a framework for periodic execution of task-f low graphs that enables schedulability analysis of the communication r equirements. The analysis performs the steps of segmenting messages, a ssigning the segments to specific links and time intervals, and orderi ng 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 co ntention-based objective function. Usefulness of the proposed scheme i n ensuring guaranteed communication performance is demonstrated by an appropriate example.