Pfair scheduling of generalized pinwheel task systems

Sanjoy K. Baruah*, Shun Shii Lin

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

37 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)812-816
Number of pages5
JournalIEEE Transactions on Computers
Issue number7
Publication statusPublished - 1998


  • Density threshold
  • Fairness
  • Generalized pinwheels
  • Real-time scheduling

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics


Dive into the research topics of 'Pfair scheduling of generalized pinwheel task systems'. Together they form a unique fingerprint.

Cite this