A class of rate-based real-time scheduling algorithms

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

6 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)708-720
Journal / PublicationIEEE Transactions on Computers
Volume51
Issue number6
Publication statusPublished - Jun 2002
Externally publishedYes

Abstract

This paper investigates a class of rate-based real-time scheduling algorithms based on the idea of general processor sharing (GPS). We extend the GPS framework in [18] for periodic and sporadic process scheduling and show the optimality of GPS-based scheduling. In particular, we propose the Earliest-Completion-Time GPS (EGPS) scheduling algorithm to simulate the GPS algorithm with much lower run-time overheads. The schedulability of each process is enforced by a guaranteed CPU service rate, independent of the demands of other processes. We provide a theoretical foundation to assign proper CPU service rates to processes to satisfy their individual stringent response time requirements. We also propose a GPS-based scheduling mechanism for jitter control. Finally, the performance of the proposed algorithms is studied using a generic avionics platform example and simulation experiments on jitter control and mixed soft and hard real-time process scheduling.

Research Area(s)

  • Generalized processor sharing, Jitter control, Real-time process scheduling, Service rate adjustment, Soft real-time process scheduling, Sporadic process scheduling

Citation Format(s)

A class of rate-based real-time scheduling algorithms. / Kuo, Tei-Wei; Yang, Wang-Ru; Lin, Kwei-Jay.

In: IEEE Transactions on Computers, Vol. 51, No. 6, 06.2002, p. 708-720.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review