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ženo v:

Podrobná bibliografie
Vydáno v:	2015 5th International Conference on IT Convergence and Security (ICITCS) s. 1 - 4
Hlavní autoři:	Alhussian, Hitham, Zakaria, Nordin
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 01.08.2015
Témata:	Algorithm design and analysis Program processors Real-time systems Schedules Scheduling Scheduling algorithms
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í:	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