Real-Time Multiprocessor Scheduling Algorithm Based on Information Theory Principles

Reducing job migrations is essential for any global multiprocessor scheduling algorithm. In this letter, we present a global, dynamic-priority, laxity-based algorithm that reduces the number of migrations on multiprocessor embedded systems by leveraging information theory principles. A simplificatio...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE embedded systems letters Ročník 9; číslo 4; s. 93 - 96
Hlavní autoři: Rincón C, Carlos A., Xingliang Zou, Cheng, Albert M. K.
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.12.2017
Témata:
Algorithm design and analysis
Global scheduling
Information theory
migration minimization
multiprocessor scheduling
Multiprocessor systems
Processor scheduling
Program processors
Real-time systems
ISSN:1943-0663, 1943-0671
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Reducing job migrations is essential for any global multiprocessor scheduling algorithm. In this letter, we present a global, dynamic-priority, laxity-based algorithm that reduces the number of migrations on multiprocessor embedded systems by leveraging information theory principles. A simplification of the proposed scheduling theory is presented to reduce the overhead caused by using information theory. Our results show that the proposed algorithm is able to reduce the number of migrations by up to 41.21% when compared with other global, dynamic-priority, laxity-based algorithms. As the utilization per task set and the number of processors increase, simplified information-theoretic scheduling algorithm is able to improve its performance in terms of the number of migrations.
ISSN:1943-0663
1943-0671
DOI:10.1109/LES.2017.2761540