A modified LRE-TL real-time multiprocessor scheduling algorithm

A modified version of Local Remaining Execution-TL (LRE-TL) real-time multiprocessor scheduling algorithm is presented. LRE-TL uses two events to make scheduling decisions: The Bottom (B) event and the Critical (C) event. Event B occurs when a task consumes its local utilization meaning that it has...

Full description

Main Authors: Alhussian, H., Zakaria, N., Hussin, F.A., Bahbouh, H.T.
Format: Article
Institution: Universiti Teknologi Petronas
Record Id / ISBN-0: utp-eprints.31720 /
Published: Springer Verlag 2014
Online Access: https://www.scopus.com/inward/record.uri?eid=2-s2.0-84958536993&doi=10.1007%2f978-981-4585-18-7_38&partnerID=40&md5=9a3f5a7621aa479c33475f95ff9f4cae
http://eprints.utp.edu.my/31720/
Tags: Add Tag
No Tags, Be the first to tag this record!
id utp-eprints.31720
recordtype eprints
spelling utp-eprints.317202022-03-29T03:35:56Z A modified LRE-TL real-time multiprocessor scheduling algorithm Alhussian, H. Zakaria, N. Hussin, F.A. Bahbouh, H.T. A modified version of Local Remaining Execution-TL (LRE-TL) real-time multiprocessor scheduling algorithm is presented. LRE-TL uses two events to make scheduling decisions: The Bottom (B) event and the Critical (C) event. Event B occurs when a task consumes its local utilization meaning that it has to be preempted. Event C occurs when a task's local laxity becomes zero meaning that the task should directly be scheduled for execution. Event C always results in a task migration, therefore we modified the initialization procedure of LRE-TL to select the tasks that have a higher probability of firing a C event to be scheduled for execution firstly, and thereby tasks migration will be reduced. We have conducted an independent-samples t-test to compare tasks migration using the original LRE-TL algorithm and the modified algorithm. The results obtained showed that there was a significance reduction in tasks migration when the proposed solution is applied. © Springer Science+Business Media Singapore 2014. Springer Verlag 2014 Article NonPeerReviewed https://www.scopus.com/inward/record.uri?eid=2-s2.0-84958536993&doi=10.1007%2f978-981-4585-18-7_38&partnerID=40&md5=9a3f5a7621aa479c33475f95ff9f4cae Alhussian, H. and Zakaria, N. and Hussin, F.A. and Bahbouh, H.T. (2014) A modified LRE-TL real-time multiprocessor scheduling algorithm. Lecture Notes in Electrical Engineering, 285 LN . pp. 335-344. http://eprints.utp.edu.my/31720/
institution Universiti Teknologi Petronas
collection UTP Institutional Repository
description A modified version of Local Remaining Execution-TL (LRE-TL) real-time multiprocessor scheduling algorithm is presented. LRE-TL uses two events to make scheduling decisions: The Bottom (B) event and the Critical (C) event. Event B occurs when a task consumes its local utilization meaning that it has to be preempted. Event C occurs when a task's local laxity becomes zero meaning that the task should directly be scheduled for execution. Event C always results in a task migration, therefore we modified the initialization procedure of LRE-TL to select the tasks that have a higher probability of firing a C event to be scheduled for execution firstly, and thereby tasks migration will be reduced. We have conducted an independent-samples t-test to compare tasks migration using the original LRE-TL algorithm and the modified algorithm. The results obtained showed that there was a significance reduction in tasks migration when the proposed solution is applied. © Springer Science+Business Media Singapore 2014.
format Article
author Alhussian, H.
Zakaria, N.
Hussin, F.A.
Bahbouh, H.T.
spellingShingle Alhussian, H.
Zakaria, N.
Hussin, F.A.
Bahbouh, H.T.
A modified LRE-TL real-time multiprocessor scheduling algorithm
author_sort Alhussian, H.
title A modified LRE-TL real-time multiprocessor scheduling algorithm
title_short A modified LRE-TL real-time multiprocessor scheduling algorithm
title_full A modified LRE-TL real-time multiprocessor scheduling algorithm
title_fullStr A modified LRE-TL real-time multiprocessor scheduling algorithm
title_full_unstemmed A modified LRE-TL real-time multiprocessor scheduling algorithm
title_sort modified lre-tl real-time multiprocessor scheduling algorithm
publisher Springer Verlag
publishDate 2014
url https://www.scopus.com/inward/record.uri?eid=2-s2.0-84958536993&doi=10.1007%2f978-981-4585-18-7_38&partnerID=40&md5=9a3f5a7621aa479c33475f95ff9f4cae
http://eprints.utp.edu.my/31720/
_version_ 1741197624565825536
score 11.62408

Similar Items