eprintid: 5672
rev_number: 2
eprint_status: archive
userid: 1
dir: disk0/00/00/56/72
datestamp: 2023-11-09 16:17:25
lastmod: 2023-11-09 16:17:25
status_changed: 2023-11-09 16:03:32
type: conference_item
metadata_visibility: show
creators_name: Alhussian, H.
creators_name: Zakaria, N.
title: An efficient zero-laxity based real-time multiprocessor scheduling algorithm
ispublished: pub
keywords: Algorithms; Interactive computer systems; Multiprocessing systems; Program processors; Real time systems; Scheduling, Algorithm design and analysis; Multiprocessor scheduling algorithms; Real time; Schedulability, Scheduling algorithms
note: 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
abstract: 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.
date: 2015
publisher: Institute of Electrical and Electronics Engineers Inc.
official_url: https://www.scopus.com/inward/record.uri?eid=2-s2.0-84961730771&doi=10.1109%2fICITCS.2015.7292943&partnerID=40&md5=227aeba6ce7cf029acb1258acc2f4904
id_number: 10.1109/ICITCS.2015.7292943
full_text_status: none
publication: 2015 5th International Conference on IT Convergence and Security, ICITCS 2015 - Proceedings
refereed: TRUE
isbn: 9781467365376
citation:   Alhussian, H. and Zakaria, N.  (2015) An efficient zero-laxity based real-time multiprocessor scheduling algorithm.  In: UNSPECIFIED.