Reducing Tasks Migration in LRE-TL Real-time Multiprocessor Scheduling Algorithm

Alhussian, Hitham and Nordin, Zakaria M and Hussin, Fawnizu Azmadi and Bahbouh, Hussein T. (2013) Reducing Tasks Migration in LRE-TL Real-time Multiprocessor Scheduling Algorithm. In: 4th International Conference on Electrical Engineering and Informatics (ICEEI2013), 24-25 June 2013, Selangor, Malaysia.

[img] PDF - Published Version
Restricted to Registered users only



In this paper we present a modification of Local Remaining Execution (LRE-TL) real-time multiprocessor scheduling algorithm to reduce tasks migration significantly. LRE-TL, which is based on the concept of fluid scheduling, makes scheduling decisions using two events. The Bottom (B) event occurs when a task consumes its local utilization thus; it has to be pre-empted. The Critical (C) event occurs when a task consumes its local laxity thus; it has to be scheduled for execution. Event C always results in a task migration. We have modified the initialization procedure of LRE-TL to make sure that tasks which have higher probability of firing a C event will always be scheduled for execution first. This will ensure that the number of C events will always be the minimum; thereby tasks migration will be reduced. To verify our work, an independent-samples t-test is used to compare tasks migration using the original LRE-TL algorithm and the modified one. The results showed that there was a significance reduction in tasks migrations when we apply our proposed solution.

Item Type:Conference or Workshop Item (Paper)
Academic Subject One:Academic Department - Electrical And Electronics - Pervasisve Systems - Digital Electronics - Microprocessor
Departments / MOR / COE:Centre of Excellence > Center for Intelligent Signal and Imaging Research
ID Code:11983
Deposited By: Dr Fawnizu Azmadi Hussin
Deposited On:07 Oct 2016 01:42
Last Modified:19 Jan 2017 08:21

Repository Staff Only: item control page

Document Downloads

More statistics for this item...