Sporadic Multiprocessor Scheduling with Few Preemptions

Authors:
Björn Andersson;Konstantinos Bletsas
Affiliations:
-;-
Venue:
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Year:
2008

Citing 0
Cited 18

Optimal virtual cluster-based multiprocessor scheduling

Real-Time Systems
Supporting execution on multiprocessor platforms

ACM SIGAda Ada Letters
Multiprocessor real-time scheduling considering concurrency and urgency

ACM SIGBED Review - Special Issue on the Work-in-Progress (WIP) Session at the 2009 IEEE Real-Time Systems Symposium (RTSS)
Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling

Journal of Systems Architecture: the EUROMICRO Journal
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
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
DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling

Real-Time Systems
Zero-laxity based real-time multiprocessor scheduling

Journal of Systems and Software
Dispatching domains for multiprocessor platforms and their representation in ada

Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
Implementing multicore real-time scheduling algorithms based on task splitting using ada 2012

Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
Preliminary multiprocessor support of ada 2012 in GNU/Linux systems

Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
Laxity dynamics and LLF schedulability analysis on multiprocessor platforms

Real-Time Systems
A global optimal scheduling algorithm for multiprocessor low-power platforms

Proceedings of the 20th International Conference on Real-Time and Network Systems
Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors

Real-Time Systems
Support for multiprocessor platforms

ACM SIGAda Ada Letters
Task assignment algorithms for two-type heterogeneous multiprocessors

Real-Time Systems
Real-time scheduling with resource sharing on heterogeneous multiprocessors

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider the problem of scheduling n sporadic tasks so as to meet deadlines on m identical processors. A task is characterised by its minimum interarrival time and its worst-case execution time. Tasks are preemptible and may migrate between processors. We propose an algorithm with limited migration, configurable for a utilisation bound of 88% with few preemptions (and arbitrarily close to 100% with more preemptions).