%T An efficient zero-laxity based real-time multiprocessor scheduling algorithm
%J 2015 5th International Conference on IT Convergence and Security, ICITCS 2015 - Proceedings
%R 10.1109/ICITCS.2015.7292943
%I Institute of Electrical and Electronics Engineers Inc.
%D 2015
%A H. Alhussian
%A N. Zakaria
%L scholars5672
%K Algorithms; Interactive computer systems; Multiprocessing systems; Program processors; Real time systems; Scheduling, Algorithm design and analysis; Multiprocessor scheduling algorithms; Real time; Schedulability, Scheduling algorithms
%X 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. © 2015 IEEE.
%O cited By 3; Conference of 5th International Conference on IT Convergence and Security, ICITCS 2015 ; Conference Date: 24 August 2015 Through 27 August 2015; Conference Code:118426