Name
Abstract | ||
|---|---|---|
Existing multiprocessor real-time scheduling algorithms follow partitioning/global scheduling approaches or some hybrid approaches of the two. Under partitioning, all tasks are assigned to specific processors. Under global scheduling, tasks may migrate among processors. Global scheduling has the advantage of better schedulability compared to partitioning. However, optimal algorithms based on global scheduling such as PD2 [5] and LLREF [3] incur significant overhead. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1145/2518148.2518167 | SIGBED Review |
Keywords | DocType | Volume |
RUN algorithm,multiprocessor real-time scheduling algorithm,specific processor,global scheduling,hybrid approach,better schedulability,significant overhead,optimal algorithm,global scheduling approach | Journal | 10 |
Issue | Citations | PageRank |
2 | 0 | 0.34 |
References | Authors | |
5 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hiroyuki Chishiro | 1 | 54 | 8.96 |
| James H. Anderson | 2 | 3492 | 291.90 |
| Nobuyuki Yamasaki | 3 | 338 | 30.45 |