loading...
 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
Nianmin Yao, Harbin Engineering University, China
Wenbin Yao, Harbin Engineering University, China
Shaobin Cai, Harbin Engineering University, China
Jun Ni, Harbin Engineering University, China
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.