An efficient zero-laxity based real-time multiprocessor scheduling algorithm

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
Main Authors: Alhussian, H., Zakaria, N.
Format: Conference or Workshop Item
Published: Institute of Electrical and Electronics Engineers Inc. 2015
Online Access:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84961730771&doi=10.1109%2fICITCS.2015.7292943&partnerID=40&md5=227aeba6ce7cf029acb1258acc2f4904
http://eprints.utp.edu.my/31636/
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Teknologi Petronas
id my.utp.eprints.31636
record_format eprints
spelling my.utp.eprints.316362022-03-26T03:25:17Z An efficient zero-laxity based real-time multiprocessor scheduling algorithm Alhussian, H. Zakaria, N. 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. Institute of Electrical and Electronics Engineers Inc. 2015 Conference or Workshop Item NonPeerReviewed https://www.scopus.com/inward/record.uri?eid=2-s2.0-84961730771&doi=10.1109%2fICITCS.2015.7292943&partnerID=40&md5=227aeba6ce7cf029acb1258acc2f4904 Alhussian, H. and Zakaria, N. (2015) An efficient zero-laxity based real-time multiprocessor scheduling algorithm. In: UNSPECIFIED. http://eprints.utp.edu.my/31636/
institution Universiti Teknologi Petronas
building UTP Resource Centre
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Petronas
content_source UTP Institutional Repository
url_provider http://eprints.utp.edu.my/
description 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.
format Conference or Workshop Item
author Alhussian, H.
Zakaria, N.
spellingShingle Alhussian, H.
Zakaria, N.
An efficient zero-laxity based real-time multiprocessor scheduling algorithm
author_facet Alhussian, H.
Zakaria, N.
author_sort Alhussian, H.
title An efficient zero-laxity based real-time multiprocessor scheduling algorithm
title_short An efficient zero-laxity based real-time multiprocessor scheduling algorithm
title_full An efficient zero-laxity based real-time multiprocessor scheduling algorithm
title_fullStr An efficient zero-laxity based real-time multiprocessor scheduling algorithm
title_full_unstemmed An efficient zero-laxity based real-time multiprocessor scheduling algorithm
title_sort efficient zero-laxity based real-time multiprocessor scheduling algorithm
publisher Institute of Electrical and Electronics Engineers Inc.
publishDate 2015
url https://www.scopus.com/inward/record.uri?eid=2-s2.0-84961730771&doi=10.1109%2fICITCS.2015.7292943&partnerID=40&md5=227aeba6ce7cf029acb1258acc2f4904
http://eprints.utp.edu.my/31636/
_version_ 1738657275300544512

Similar Items