A Modified LRE-TL Real-Time Multiprocessor Scheduling Algorithm

Alhussian, Hitham and Zakaria, Mohd Nordin and Hussin, Fawnizu Azmadi and Bahbouh, Hussein T (2013) A Modified LRE-TL Real-Time Multiprocessor Scheduling Algorithm. In: First International Conference on Advanced Data and Information Engineering (DaEng-2013), 2013, Singapore.

[thumbnail of A Modified LRE-TL Real-time Multiprocessor Scheduling Algorithm.pdf] PDF
A Modified LRE-TL Real-time Multiprocessor Scheduling Algorithm.pdf - Published Version
Restricted to Registered users only

Download (382kB) | Request a copy

Abstract

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.

Item Type: Conference or Workshop Item (Paper)
Departments / MOR / COE: Centre of Excellence > Center for Intelligent Signal and Imaging Research
Depositing User: Dr Fawnizu Azmadi Hussin
Date Deposited: 07 Oct 2016 01:42
Last Modified: 19 Jan 2017 08:21
URI: http://scholars.utp.edu.my/id/eprint/11972

Actions (login required)

View Item
View Item