Name
Abstract | ||
|---|---|---|
The scheduling of systems of periodic tasks upon multiprocessor platforms is considered. Utilization-based conditions are derived for determining whether a periodic task system meets all deadlines when scheduled using the earliest deadline first scheduling algorithm (EDF) upon a given multiprocessor platform. A new priority-driven algorithm is proposed for scheduling periodic task systems upon multiprocessor platforms: this algorithm is shown to successfully schedule some task systems for which EDF may fail to meet all deadlines. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1023/A:1025120124771 | Realtime systems |
Keywords | Field | DocType |
multiprocessor scheduling,periodic tasks,earliest deadline first | Fixed-priority pre-emptive scheduling,Multiprocessor scheduling,Fair-share scheduling,Computer science,Parallel computing,Real-time computing,Two-level scheduling,Least slack time scheduling,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Distributed computing | Journal |
Volume | Issue | ISSN |
25 | 2-3 | 1573-1383 |
Citations | PageRank | References |
150 | 9.93 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joël Goossens | 1 | 666 | 49.22 |
| Shelby Funk | 2 | 348 | 23.89 |
| Sanjoy K. Baruah | 3 | 4664 | 374.79 |