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...

Full description

Saved in:

Bibliographic Details
Published in:	2015 5th International Conference on IT Convergence and Security (ICITCS) pp. 1 - 4
Main Authors:	Alhussian, Hitham, Zakaria, Nordin
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.08.2015
Subjects:	Algorithm design and analysis Program processors Real-time systems Schedules Scheduling Scheduling algorithms
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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