On-Line Scheduling of Real-Time Tasks

Authors:
Kwang S. Hong;Joseph Y.-T. Leung
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1992

Citing 4
Cited 12

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
A Level Algorithm for Preemptive Scheduling

Journal of the ACM (JACM)
Preemptive Scheduling of Uniform Processor Systems

Journal of the ACM (JACM)
Operating Systems Theory

Operating Systems Theory

Scheduling Queries to Improve the Freshness of a Website

World Wide Web
LRE-TL: an optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines

Real-Time Systems
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
Online algorithms for advance resource reservations

Journal of Parallel and Distributed Computing
Real-time scheduling using regularity criteria and a geometrical approach

International Journal of Critical Computer-Based Systems
DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling

Real-Time Systems
Integrating PFairness within a model based scheduling tool

VECoS'10 Proceedings of the Fourth international conference on Verification and Evaluation of Computer and Communication Systems
Off-line (Optimal) multiprocessor scheduling of dependent periodic tasks

Proceedings of the 27th Annual ACM Symposium on Applied Computing
A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions

Discrete Optimization
Scheduling on identical machines: How good is LPT in an on-line setting?

Operations Research Letters
Job partitioning strategies for multiprocessor scheduling of real-time periodic tasks with restricted migrations

Proceedings of the 20th International Conference on Real-Time and Network Systems
Online parallel scheduling of non-uniform tasks: trading failures for energy

FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	14.98

Visualization

Abstract

An optimal on-line scheduler is given for a set of real-time tasks with one common deadline on m processors. It is shown that no optimal scheduler can exist for tasks with two distinct deadlines. Finally, an optimal on-line scheduler is given for situations where processors can go down unexpectedly.