Abstract 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.
[1]
Chung Laung Liu,et al.
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
,
1989,
JACM.
[2]
Alan Burns,et al.
A survey of hard real-time scheduling for multiprocessor systems
,
2011,
CSUR.
[3]
Shelby Funk,et al.
LRE-TL: an optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines
,
2010,
Real-Time Systems.
[4]
Sanjoy K. Baruah,et al.
Proportionate progress: A notion of fairness in resource allocation
,
1993,
Algorithmica.
[5]
Sanjoy K. Baruah,et al.
A Categorization of Real-Time Multiprocessor Scheduling Problems and Algorithms
,
2004,
Handbook of Scheduling.
[6]
Binoy Ravindran,et al.
An Optimal Real-Time Scheduling Algorithm for Multiprocessors
,
2006,
2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).