An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems

Authors:
James H. Anderson;Vasile Bud;UmaMaheswari C. Devi
Affiliations:
University of North Carolina at Chapel Hill;University of North Carolina at Chapel Hill;University of North Carolina at Chapel Hill
Venue:
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Year:
2005

Citing 0
Cited 23

A deadline-based algorithm for dynamic task scheduling with precedence constraints

PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Tardiness bounds under global EDF scheduling on a multiprocessor

Real-Time Systems
An $\mathsf{EDF}$ -based restricted-migration scheduling algorithm for multiprocessor soft real-time systems

Real-Time Systems
Utility accrual real-time scheduling for multiprocessor embedded systems

Journal of Parallel and Distributed Computing
Lock-free synchronization for dynamic embedded real-time systems

ACM Transactions on Embedded Computing Systems (TECS)
T-L plane-based real-time scheduling for homogeneous multiprocessors

Journal of Parallel and Distributed Computing
Soft real-time scheduling with tardiness bounds on prioritized SMT processors

PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
Spin-based reader-writer synchronization for multiprocessor real-time systems

Real-Time Systems
Flexible tardiness bounds for sporadic real-time task systems on multiprocessors

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
On best-effort utility accrual real-time scheduling on multiprocessors

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling

Journal of Systems Architecture: the EUROMICRO Journal
Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound

Real-Time Systems
Sticky-ERfair: a task-processor affinity aware proportional fair scheduler

Real-Time Systems
Gang scheduling in multi-core clusters implementing migrations

Future Generation Computer Systems
Zero-laxity based real-time multiprocessor scheduling

Journal of Systems and Software
On multiprocessor utility accrual real-time scheduling with statistical timing assurances

EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
High performance dynamic voltage/frequency scaling algorithm for real-time dynamic load management

Journal of Systems and Software
A semi-partitioned real-time scheduling approach for periodic task systems on multicore platforms

Proceedings of the 27th Annual ACM Symposium on Applied Computing
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
Harmonic semi-partitioned scheduling for fixed-priority real-time tasks on multi-core platform

DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Resource sharing under server-based multiprocessor scheduling

ACM SIGBED Review - Special Issue on the Work-in-Progress (WiP) session of the 33rd IEEE Real-Time Systems Symposium (RTSS'12)
Integrating independently developed real-time applications on a shared multi-core architecture

ACM SIGBED Review
Implementation and evaluation of global and partitioned scheduling in a real-time OS

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In hard real-time systems, a significant disparity in schedulability exists between EDF-based scheduling algorithms and Pfair scheduling, which is the only known way of optimally scheduling recurrent real-time tasks on multiprocessors. This is unfortunate because EDF-based algorithms entail lower scheduling and task-migration overheads. In work on hard real-time systems, it has been shown that the disparity in schedulability can be lessened by placing caps on per-task utilizations. In this paper, we show that it can also be lessened by easing the requirement that all deadlines be met. Our main contribution is a new EDF-based scheme that ensures bounded deadline tardiness. In this scheme, per-task utilizations must be capped, but overall utilization need not be restricted. The required cap is quite liberal. Hence, our scheme should enable a wide range of soft real-time applications to be scheduled with no constraints on total utilization. We also propose techniques and heuristics that can be used to reduce tardiness.