A Class of Rate-Based Real-Time Scheduling Algorithms

Authors:
Tei-Wei Kuo;Wang-Ru Yang;Kwei-Jay Lin
Affiliations:
National Taiwan Univ., Taipei, Taiwan;First International Corp., Taipei, Taiwan;Univ. of California, Irvine, CA
Venue:
IEEE Transactions on Computers
Year:
2002

Citing 13
Cited 2

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Priority Inheritance Protocols: An Approach to Real-Time Synchronization

IEEE Transactions on Computers
BAP: a class of abort-oriented protocols based on the notion of compatibility

RTCSA '96 Proceedings of the Third International Workshop on Real-Time Computing Systems Application
Distributed pinwheel scheduling with end-to-end timing constraints

RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
An optimal pinwheel scheduler using the single-number reduction technique

RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
A proportional share resource allocation algorithm for real-time, time-shared systems

RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Scheduling real-time applications in an open environment

RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Scheduling for quality of service guarantees via service curves

ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Lottery and Stride Scheduling: Flexible Proportional-share Resource Management

Lottery and Stride Scheduling: Flexible Proportional-share Resource Management
Stride Scheduling: Deterministic Proportional- Share Resource Management

Stride Scheduling: Deterministic Proportional- Share Resource Management

Overrun handling approaches for overload-prone soft real-time systems

Advances in Engineering Software
Contention free scheme for asymmetrical traffic load in IEEE 802.11x wireless LAN

AsiaSim'04 Proceedings of the Third Asian simulation conference on Systems Modeling and Simulation: theory and applications

Quantified Score

Hi-index	15.01

Visualization

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 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.