An Efficient Zero-Laxity Based Real-Time Multiprocessor Scheduling Algorithm

In this paper, we present an efficient global real- time multiprocessor scheduling algorithm based on the beneficial Zero-Laxity policy. The algorithm selects tasks for execution based on their execution requirements. Tasks with largest execution requirements are always scheduled first; however when...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	2015 5th International Conference on IT Convergence and Security (ICITCS) s. 1 - 4
Hlavní autori:	Alhussian, Hitham, Zakaria, Nordin
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.08.2015
Predmet:	Algorithm design and analysis Program processors Real-time systems Schedules Scheduling Scheduling algorithms
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	In this paper, we present an efficient global real- time multiprocessor scheduling algorithm based on the beneficial Zero-Laxity policy. The algorithm selects tasks for execution based on their execution requirements. Tasks with largest execution requirements are always scheduled first; however when a task reaches zero laxity it is given the highest priority and executed until completion. The simulation showed that the proposed algorithm misses few deadlines and achieves high schedulability levels compared to currently existing zero laxity based algorithms.
DOI:	10.1109/ICITCS.2015.7292943