Minimizing scheduling overhead in LRE-TL real-time multiprocessor scheduling algorithm
Autor: | Mohamed Nordin Bin Zakaria, Fawnizu Azmadi Hussin, Hitham Alhussian |
---|---|
Rok vydání: | 2017 |
Předmět: |
Earliest deadline first scheduling
Rate-monotonic scheduling General Computer Science Least slack time scheduling Computer science Real-time computing 020206 networking & telecommunications 02 engineering and technology Dynamic priority scheduling Parallel computing Fair-share scheduling Multiprocessor scheduling Fixed-priority pre-emptive scheduling Two-level scheduling 0202 electrical engineering electronic engineering information engineering Electrical and Electronic Engineering Algorithm |
Zdroj: | TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES. 25:263-277 |
ISSN: | 1303-6203 1300-0632 |
DOI: | 10.3906/elk-1403-273 |
Popis: | In this paper, we present a modification of Local Remaining Execution-Time and Local time domain (LRE-TL) real-time multiprocessor scheduling algorithm, aimed at reducing the scheduling overhead in terms of task migrations. LRE-TL achieves optimality by employing the fairness rule at the end of each time slice in a fluid schedule model. LRE-TL makes scheduling decisions using two scheduling events. The Bottom (B) event, which occurs when a task consumes its local utilization thus; it has to be preempted in order to resume the execution of another task, if any, or to idle the processor if none exist. The Critical (C) event occurs when a task consumes its local laxity which means that the task cannot wait any more and has to be scheduled for execution immediately otherwise, it will miss its deadline. 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 considered for execution first. This will ensure that the number of C events will always be at the minimum; thereby reducing the number of task migrations. |
Databáze: | OpenAIRE |
Externí odkaz: |