PFAIR SCHEDULING OF GENERALIZED PINWHEEL TASK SYSTEMS

Authors
BARUAH SK LIN SS
Citation
Sk. Baruah et Ss. Lin, PFAIR SCHEDULING OF GENERALIZED PINWHEEL TASK SYSTEMS, I.E.E.E. transactions on computers, 47(7), 1998, pp. 812-816
Citations number
20
Categorie Soggetti
Computer Science Hardware & Architecture","Engineering, Eletrical & Electronic","Computer Science Hardware & Architecture
Journal title
I.E.E.E. transactions on computers → ACNP
ISSN journal
00189340
Volume
47
Issue
7
Year of publication
1998
Pages
812 - 816
Database
ISI
SICI code
0018-9340(1998)47:7<812:PSOGPT>2.0.ZU;2-C
Abstract
The scheduling of generalized pinwheel task systems is considered. It is shown that pinwheel scheduling is closely related to the fair sched uling of periodic task systems. This relationship is exploited to obta in new scheduling algorithms for generalized pinwheel task systems. Wh en compared to traditional pinwheel scheduling algorithms, these new a lgorithms are both more efficient from a runtime complexity point of v iew, and have a higher density threshold, on a very large subclass of generalized pinwheel task systems.