The Community for Technology Leaders
Green Image
<p><it>Abstract—</it>This paper discusses a static algorithm for allocating and scheduling components of periodic tasks across sites in distributed systems. Besides dealing with the <it>periodicity constraints</it>, (which have been the sole concern of many previous algorithms), this algorithm handles <it>precedence</it>, <it>communication</it>, as well as <it>replication</it> requirements of subtasks of the tasks. The algorithm determines the allocation of subtasks of periodic tasks to sites, the scheduled start times of subtasks allocated to a site, and the schedule for communication along the communication channel(s). Simulation results show that the heuristics and search techniques incorporated in the algorithm are very effective.</p><p><it>Index Terms—</it>Real-time systems, task allocation, scheduling, periodic tasks, precedence constraints, distributed systems.</p>
Krithi Ramamritham, "Allocation and Scheduling of Precedence-Related Periodic Tasks", IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 412-420, April 1995, doi:10.1109/71.372795
108 ms
(Ver 3.3 (11022016))