T-L plane-based real-time scheduling for homogeneous multiprocessors

Authors:
Hyeonjoong Cho;Binoy Ravindran;E. Douglas Jensen
Affiliations:
Department of Computer and Information Science, Korea University, South Korea;ECE Department, Virginia Tech., Blacksburg, VA 24061, USA;The MITRE Corporation Bedford, MA 01730, USA
Venue:
Journal of Parallel and Distributed Computing
Year:
2010

Citing 8
Cited 2

Multiprocessor Online Scheduling of Hard-Real-Time Tasks

IEEE Transactions on Software Engineering
The Case for Fair Multiprocessor Scheduling

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors

Real-Time Systems
Deadline Fair Scheduling: Bridging the Theory and Practice of Proportionate Fair Scheduling in Multiprocessor Systems

RTAS '01 Proceedings of the Seventh Real-Time Technology and Applications Symposium (RTAS '01)
Multiple-Resource Periodic Scheduling Problem: how much fairness is necessary?

RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems

ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Tardiness Bounds under Global EDF Scheduling on a Multiprocessor

RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Adapting Pfair scheduling for symmetric multiprocessors

Journal of Embedded Computing - Cache exploitation in embedded systems

Cluster scheduling for real-time systems: utilization bounds and run-time overhead

Real-Time Systems
Hard-real-time scheduling of data-dependent tasks in embedded streaming applications

EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider optimal real-time scheduling of periodic tasks on multiprocessors-i.e., satisfying all task deadlines, when the total utilization demand does not exceed the utilization capacity of the processors. We introduce a novel abstraction for reasoning about task execution behavior on multiprocessors, called T-L plane and present T-L plane-based real-time scheduling algorithms. We show that scheduling for multiprocessors can be viewed as scheduling on repeatedly occurring T-L planes, and feasibly scheduling on a single T-L plane results in an optimal schedule. Within a single T-L plane, we analytically show a sufficient condition to provide a feasible schedule. Based on these, we provide two examples of T-L plane-based real-time scheduling algorithms, including non-work-conserving and work-conserving approaches. Further, we establish that the algorithms have bounded overhead. Our simulation results validate our analysis of the algorithm overhead. In addition, we experimentally show that our approaches have a reduced number of task migrations among processors when compared with a previous algorithm.