Name
Abstract | ||
|---|---|---|
In this paper, we introduce the notion of decoupled speed scaling, wherein the speed scaling function is completely decoupled from the scheduling policy used in a simple single-server computer system. As an initial result, we first demonstrate that the Fair Sojourn Protocol (FSP) scheduling policy does not work properly with coupled (native) speed scaling, but that it can and does work well with decoupled speed scaling. We then compare the performance of PS, SRPT, and FSP scheduling policies under decoupled speed scaling, and demonstrate significant advantages for FSP. Our simulation results suggest that it might be possible to simultaneously achieve fairness, robustness, and near optimality with decoupled speed scaling. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.peva.2013.04.002 | Quantitative Evaluation of Systems |
Keywords | Field | DocType |
speed scaling,decoupled speed scaling,significant advantage,initial result,simple single-server computer system,simulation result,fair sojourn protocol,fsp scheduling policy,scheduling policy,near optimality,efficiency | Mathematical optimization,Speed scaling,Control theory,Scheduling (computing),Computer science,Robustness (computer science),Real-time computing | Journal |
Volume | ISSN | ISBN |
73, | 0166-5316 | 978-0-7695-4781-7 |
Citations | PageRank | References |
8 | 0.66 | 20 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maryam Elahi | 1 | 9 | 2.04 |
| C. Williamson | 2 | 2998 | 417.38 |
| Philipp Woelfel | 3 | 432 | 38.40 |