17th Euromicro Conference on Real-Time Systems (ECRTS'05)
DOI: 10.1109/ecrts.2005.18
|View full text |Cite
|
Sign up to set email alerts
|

Improved Schedulability Analysis of EDF on Multiprocessor Platforms

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
193
0
1

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 164 publications
(195 citation statements)
references
References 15 publications
0
193
0
1
Order By: Relevance
“…Second, the partitioned approach cannot produce optimal real-time schedules -one that meets all task deadlines when task utilization demand does not exceed the total processor capacity -for periodic task sets [63], since the partitioning problem is analogous to the bin-packing problem which is known to be NP-hard in the strong sense. Third, in some embedded processor architectures with no cache and simpler structures, the overhead of migration has a lower impact on the performance [15]. Finally, global scheduling can theoretically contribute to an increased understanding of the properties and behaviors of real-time scheduling algorithms for multiprocessors.…”
Section: Multiprocessor Real-time Schedulingmentioning
confidence: 99%
See 4 more Smart Citations
“…Second, the partitioned approach cannot produce optimal real-time schedules -one that meets all task deadlines when task utilization demand does not exceed the total processor capacity -for periodic task sets [63], since the partitioning problem is analogous to the bin-packing problem which is known to be NP-hard in the strong sense. Third, in some embedded processor architectures with no cache and simpler structures, the overhead of migration has a lower impact on the performance [15]. Finally, global scheduling can theoretically contribute to an increased understanding of the properties and behaviors of real-time scheduling algorithms for multiprocessors.…”
Section: Multiprocessor Real-time Schedulingmentioning
confidence: 99%
“…Under Pfair, tasks can be decomposed into several small uniform segments, which are then scheduled, causing frequent scheduling and migration. Thus, scheduling algorithms other than Pfair-e.g., global-EDF [15,10,2] have also been intensively studied though their schedulable utilization bounds are lower. Figure 1.2(a) shows an example task set that global-EDF cannot feasibly schedule.…”
Section: Multiprocessor Real-time Schedulingmentioning
confidence: 99%
See 3 more Smart Citations