By Topic

A class of rate-based real-time scheduling algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tei-Wei Kuo ; Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; Wang-Ru Yang ; Kwei-Jay Lin

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 of Parekh and Gallager (1993) 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

Published in:

Computers, IEEE Transactions on  (Volume:51 ,  Issue: 6 )