2017
DOI: 10.3906/elk-1403-273
|View full text |Cite
|
Sign up to set email alerts
|

Minimizing scheduling overhead in LRE-TL real-time multiprocessor scheduling algorithm

Abstract: Abstract:In this paper, we present a modification of the 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, has to be preempted in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 17 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?