An unfair semi-greedy real-time multiprocessor scheduling algorithm

Most real-time multiprocessor scheduling algorithms for achieving optimal processor utilization, adhere to the fairness rule. Accordingly, tasks are executed in proportion to their utilizations at each time quantum or at the end of each time slice in a fluid schedule model. Obeying the fairness rule...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & electrical engineering Jg. 50; S. 143 - 165
Hauptverfasser: Alhussian, Hitham, Zakaria, Nordin, Patel, Ahmed
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Ltd 01.02.2016
Schlagworte:
Algorithms
Computer simulation
Migration
Multiprocessor
Preemption
Real time
Scheduling
Semi-greedy
Task scheduling
Tasks
Utilization
Multiprocessor
Preemption
Semi-greedy
Scheduling
Real-time
Migration
ISSN:0045-7906, 1879-0755
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Most real-time multiprocessor scheduling algorithms for achieving optimal processor utilization, adhere to the fairness rule. Accordingly, tasks are executed in proportion to their utilizations at each time quantum or at the end of each time slice in a fluid schedule model. Obeying the fairness rule results in a large number of scheduling overheads, which affect the practicality of the algorithm. This paper presents a new algorithm for scheduling independent real-time tasks on multiprocessors, which produces very few scheduling overheads while maintaining high schedulability. The algorithm is designed by totally relaxing the fairness rule and adopting a new semi-greedy criterion instead. Simulations have shown promising results, i.e. the scheduling overheads generated by the proposed algorithm are significantly fewer than those generated by state-of-the-art algorithms. Although the proposed algorithm sometimes misses a few deadlines, these are sufficiently few to be tolerated in view of the considerable reduction achieved in the scheduling overheads.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0045-7906
1879-0755
DOI:10.1016/j.compeleceng.2015.07.003