loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ninth International Conference on Parallel and Distributed Systems (ICPADS'02)
Three remedied algorithms for Advanced Waiting Time Scheduler
Taiwan, ROC
December 17-December 20
ISBN: 0-7695-1760-9
Yuan-Cheng Lai, National Taiwan University of Science and Technology
Wei-Hsi Li, National Taiwan University of Science and Technology
The advanced waiting time priority scheduler (AWTP), modified from the waiting time priority scheduler (WTP), was proposed to achieve proportional delay differentiation. AWTP not only achieves more accurate delay proportion than the WTP scheduler no matter in short or long timescales, but also greatly reduces the overall queuing delay when the traffic load is moderate. In this paper, we find that AWTP can not steadily keep the delay ratio under different traffic load distributions because its scheduling sometimes ignores considering packet waiting time. Thus, three remedied algorithms, named Minus-WTP (MWTP), Existing-WTP (EWTP), and Counting-WTP (CWTP), are proposed to resolve this problem. All remedies simultaneously consider the packet waiting time and packet transmission time. Simulation results reveal that these modifications inherit the merit of AWTP and actually alleviate this side effect.
Citation:
Yuan-Cheng Lai, Wei-Hsi Li, "Three remedied algorithms for Advanced Waiting Time Scheduler," icpads, pp.617, Ninth International Conference on Parallel and Distributed Systems (ICPADS'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.