Name
Abstract | ||
|---|---|---|
This paper proposes an efficient real-time scheduling al- gorithm for multiprocessor platforms. The algorithm is a derivative of the Rate Monotonic (RM) algorithm, with its basis on the portioned scheduling technique. The theoreti- caldesign ofthe algorithmis well implementablefor practi- cal use. The schedulabilityof the algorithm is also analyzed to guarantee the worst-case performance. The simulation results show that the algorithm achieves higher system uti- lizations, in which all tasks meet deadlines, with a small number of preemptions compared to traditional algorithms. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/IPDPS.2008.4536299 | IPDPS |
Keywords | Field | DocType |
multiprocessing systems,processor scheduling,real-time systems,multiprocessors,portioned static-priority scheduling,rate monotonic algorithm | Multiprocessor scheduling,Fair-share scheduling,Computer science,Deadline-monotonic scheduling,Parallel computing,Two-level scheduling,Least slack time scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Distributed computing | Conference |
Citations | PageRank | References |
20 | 1.00 | 22 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shinpei Kato | 1 | 951 | 62.18 |
| Nobuyuki Yamasaki | 2 | 338 | 30.45 |