Multiprocessor real-time scheduling considering concurrency and urgency

Authors:
Jinkyu Lee;Arvind Easwaran;Insik Shin;Insup Lee
Affiliations:
KAIST, South Korea;Polytechnic Institute of Porto (ISEP-IPP), Portugal;KAIST, South Korea;University of Pennsylvania
Venue:
ACM SIGBED Review - Special Issue on the Work-in-Progress (WIP) Session at the 2009 IEEE Real-Time Systems Symposium (RTSS)
Year:
2010

Citing 8
Cited 2

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

Journal of the ACM (JACM)
Deadline-based scheduling of periodic task systems on multiprocessors

Information Processing Letters
Static-Priority Scheduling on Multiprocessors

RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Multiprocessor Scheduling with Few Preemptions

RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
An Optimal Real-Time Scheduling Algorithm for Multiprocessors

RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Sporadic Multiprocessor Scheduling with Few Preemptions

ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Work-Conserving Optimal Real-Time Scheduling on Multiprocessors

ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Early-release fair scheduling

Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems

Zero-laxity based real-time multiprocessor scheduling

Journal of Systems and Software
Laxity dynamics and LLF schedulability analysis on multiprocessor platforms

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

It has been widely studied how to schedule realtime tasks on multiprocessor platforms. Several studies find optimal scheduling policies for implicit deadline task systems, but it is hard to understand how each policy utilizes the two important aspects of scheduling real-time tasks on multiprocessors: inter-job concurrency and job urgency. In this paper, we introduce a new scheduling policy that considers these two properties. We prove that the policy is optimal for the special case when the execution time of all tasks are equally one and deadlines are implicit, and observe that the policy is a new concept in that it is not an instance of Pfair or ERfair. It remains open to find a scheduliability condition for general task systems under our scheduling policy.