TY  - CONF
N2  - 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.
SN  - 9781467365376
Y1  - 2015///
KW  - Algorithms; Interactive computer systems; Multiprocessing systems; Program processors; Real time systems; Scheduling
KW  -  Algorithm design and analysis; Multiprocessor scheduling algorithms; Real time; Schedulability
KW  -  Scheduling algorithms
TI  - An efficient zero-laxity based real-time multiprocessor scheduling algorithm
N1  - 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
UR  - https://www.scopus.com/inward/record.uri?eid=2-s2.0-84961730771&doi=10.1109%2fICITCS.2015.7292943&partnerID=40&md5=227aeba6ce7cf029acb1258acc2f4904
A1  - Alhussian, H.
A1  - Zakaria, N.
ID  - scholars5672
PB  - Institute of Electrical and Electronics Engineers Inc.
AV  - none
ER  -