Issue No. 07 - July (1998 vol. 47)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.709381
<p><b>Abstract</b>—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 <it>density threshold</it>, on a very large subclass of generalized pinwheel task systems.</p>
Generalized pinwheels, fairness, real-time scheduling, density threshold.
S. K. Baruah and S. Lin, "Pfair Scheduling of Generalized Pinwheel Task Systems," in IEEE Transactions on Computers, vol. 47, no. , pp. 812-816, 1998.