|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2006 First International Multi-Symposiums on Computer and Computational Sciences
A New Scheduling Algorithm for Servers
Hangzhou, Zhejiang, China
June 20-June 24
ISBN: 0-7695-2581-4
| ASCII Text | x | ||
| Nianmin Yao, Wenbin Yao, Shaobin Cai, Jun Ni, "A New Scheduling Algorithm for Servers," Computer and Computational Sciences, International Multi-Symposiums on, vol. 1, pp. 639-643, 2006 First International Multi-Symposiums on Computer and Computational Sciences, 2006. | |||
| BibTex | x | ||
| @article{ 10.1109/IMSCCS.2006.17, author = {Nianmin Yao and Wenbin Yao and Shaobin Cai and Jun Ni}, title = {A New Scheduling Algorithm for Servers}, journal ={Computer and Computational Sciences, International Multi-Symposiums on}, volume = {1}, year = {2006}, isbn = {0-7695-2581-4}, pages = {639-643}, doi = {http://doi.ieeecomputersociety.org/10.1109/IMSCCS.2006.17}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Computer and Computational Sciences, International Multi-Symposiums on TI - A New Scheduling Algorithm for Servers SN - 0-7695-2581-4 SP639 EP643 A1 - Nianmin Yao, A1 - Wenbin Yao, A1 - Shaobin Cai, A1 - Jun Ni, PY - 2006 VL - 1 JA - Computer and Computational Sciences, International Multi-Symposiums on ER - | |||
Slowdown is used to measure the fairness degree of a scheduling algorithm in existing work. However, the fairness degree should be considered within a scheduling algorithm; rather than being tired with system environment. An innovative fairness model is proposed named hereby to intuitively measure the fairness of a server within through a scheduling algorithm. The new scheduling algorithm is called MPQ-LP which compromises both the fairness of PS and the highest performance of SRPT. Namely, MPQ-LP can easily adjust the performance and fairness degree of the scheduling algorithm. In addition, MPQ-LP allows each job have the fixed completion time with less computational complexity compared to SRPT when assigning the jobs to the queues. Simulation tests have been conducted to support our model verification.
Citation:
Nianmin Yao, Wenbin Yao, Shaobin Cai, Jun Ni, "A New Scheduling Algorithm for Servers," imsccs, vol. 1, pp.639-643, 2006 First International Multi-Symposiums on Computer and Computational Sciences, 2006
Usage of this product signifies your acceptance of the Terms of Use.