Title :
Pfair scheduling of generalized pinwheel task systems
Author :
Baruah, Sanjoy K. ; Lin, Shun-Shii
Author_Institution :
Dept. of Comput. Sci., Vermont Univ., Burlington, VT, USA
fDate :
7/1/1998 12:00:00 AM
Abstract :
The scheduling of generalized pinwheel task systems is considered. It is shown that pinwheel scheduling is closely related to the fair scheduling of periodic task systems. This relationship is exploited to obtain new scheduling algorithms for generalized pinwheel task systems. When compared to traditional pinwheel scheduling algorithms, these new algorithms are both more efficient from a run-time complexity point of view, and have a higher density threshold, on a very large subclass of generalized pinwheel task systems
Keywords :
computational complexity; processor scheduling; Pfair scheduling; generalized pinwheel task systems; periodic task systems; run-time complexity; Broadcasting; Context; Fault tolerance; Integral equations; Processor scheduling; Real time systems; Resource management; Runtime; Scheduling algorithm;
Journal_Title :
Computers, IEEE Transactions on
