Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling

Authors:
Jeremy P. Erickson;James H. Anderson;Bryan C. Ward
Affiliations:
Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, USA;Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, USA;Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, USA
Venue:
Real-Time Systems
Year:
2014

Citing 18
Cited 0

Deadline-based scheduling of periodic task systems on multiprocessors

Information Processing Letters
Minimizing the sum of the k largest functions in linear time

Information Processing Letters
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks

Journal of Computer and System Sciences
Tardiness bounds under global EDF scheduling on a multiprocessor

Real-Time Systems
EDZL scheduling analysis

Real-Time Systems
Multiprocessor Extensions to Real-Time Calculus

RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Generalized tardiness bounds for global multiprocessor scheduling

Real-Time Systems
Improved Tardiness Bounds for Global EDF

ECRTS '10 Proceedings of the 2010 22nd Euromicro Conference on Real-Time Systems
An Empirical Comparison of Global, Partitioned, and Clustered Multiprocessor EDF Schedulers

RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
Minimizing Task Preemptions and Migrations in Multiprocessor Optimal Real-Time Schedules

RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
Tardiness bounds for global EDF with deadlines different from periods

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Maximizing Contention-Free Executions in Multiprocessor Scheduling

RTAS '11 Proceedings of the 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium
Soft Real-Time on Multiprocessors: Are Analysis-Based Schedulers Really Worth It?

RTSS '11 Proceedings of the 2011 IEEE 32nd Real-Time Systems Symposium
RUN: Optimal Multiprocessor Real-Time Scheduling via Reduction to Uniprocessor

RTSS '11 Proceedings of the 2011 IEEE 32nd Real-Time Systems Symposium
Schedulability Analysis and Priority Assignment for Global Job-Level Fixed-Priority Multiprocessor Scheduling

RTAS '12 Proceedings of the 2012 IEEE 18th Real Time and Embedded Technology and Applications Symposium
Outstanding Paper Award: Fair Lateness Scheduling: Reducing Maximum Lateness in G-EDF-Like Scheduling

ECRTS '12 Proceedings of the 2012 24th Euromicro Conference on Real-Time Systems
Extending Task-level to Job-level Fixed Priority Assignment and Schedulability Analysis Using Pseudo-deadlines

RTSS '12 Proceedings of the 2012 IEEE 33rd Real-Time Systems Symposium
Scheduling and locking in multiprocessor real-time operating systems

Scheduling and locking in multiprocessor real-time operating systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In prior work on soft real-time (SRT) multiprocessor scheduling, tardiness bounds have been derived for a variety of scheduling algorithms, most notably, the global earliest-deadline-first (G-EDF) algorithm. In this paper, we devise G-EDF-like (GEL) schedulers, which have identical implementations to G-EDF and therefore the same overheads, but that provide better tardiness bounds. We discuss how to analyze these schedulers and propose methods to determine scheduler parameters to meet several different tardiness bound criteria. We employ linear programs to adjust such parameters to optimize arbitrary tardiness criteria, and to analyze lateness bounds (lateness is related to tardiness). We also propose a particular scheduling algorithm, namely the global fair lateness (G-FL) algorithm, to minimize maximum absolute lateness bounds. Unlike the other schedulers described in this paper, G-FL only requires linear programming for analysis. We argue that our proposed schedulers, such as G-FL, should replace G-EDF for SRT applications.