Browse > Article

Task Synchronization Mechanism for Round Robin based Proportional Share Scheduling  

Park, Hyeon-Hui (숭실대학교 컴퓨터학과)
Yang, Seung-Min (숭실대학교 컴퓨터학부)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.36, no.4, 2009 , pp. 291-303 More about this Journal
Abstract
Round robin based proportional share scheduling(RRPS) defines weight which determines share for each task and allocates CPU resource to each task in proportional to its respective weight. RRPS uses fairness as the measure of performance and aims at high fairness of scheduling. However, researches for scheduling fairness problem due to synchronization among tasks have been rarely investigated. In this paper, we discuss that scheduling delay due to synchronization may result high unfairness in RRPS. We explain such a situation as weight inversion. We then propose weight inheritance protocol(WIP), a synchronization mechanism, that prevents weight inversion. We also show that WIP can reduce unfairness using fairness analysis and simulation.
Keywords
Round Robin based Proportional Share Scheduling; Group Ratio Round Robin; Synchronization Mechanism; Semaphore; Weight Inheritance Protocol; Weight Inversion;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J. Nieh, C. Vaill, and H. Zhong, "Group Ratio Round-Robin: An O(1) Proportional Share Scheduler," Proc. General Track: 2004 USENIX Ann. Technical Conf., pp.245-259, June 2004.
2 A. Sarkar, P. P. Chakrabarti, and R. Kumar, "Frame-Based Proportional Round-Robin," IEEE Transactions on computers, vol.55, no.9, pp.1121-1129, Sep. 2006.   DOI
3 L. Kleinrock, "Queueing Systems, Volume II: Computer Applications," New York: John Wiley & Sons, 1976.
4 L. Sha, R. Jajkumar, and J. P. Lechoczky, "Priority Inheritance protocols: An Approach to real-time synchronization," IEEE Transactions on Computers, vol.39, no.9, Sept. 1990.
5 A. Demers, S. Keshav, and S. Shenker, "Analysis and Simulation of a Fair Queueing Algorithm," Proc. ACM SIGCOMM '89, pp.1-12, Sept. 1989.
6 C. A. Waldspurger, "Lottery and Stride Scheduling: Flexible Proportional-Share Resource Management," PhD Thesis No. MIT/LCS/TR-667, Dept. of Electrical Eng. and Computer Science, Massachusetts Inst. of Technology, 1995.
7 I. Stoica, H. Abdel-Wahab, K. Jeffay, S. Baruah, J. Gehrke, and C. Plaxton, "A Proportional Share Resource Allocation Algorithm for Real-Time, Time-Shared Systems," Proc. IEEE Real-Time Systems Symp., p.288, Dec. 1996.
8 J. Bennett and H. Zhang, "WF2Q: Worst-case Fair Weighted Fair Queueing," in Proceedings of INFO-COM '96, San Francisco, CA, Mar. 1996.
9 J. Nieh, C. Vaill, and H. Zhong, "Virtual-Time Round-Robin: An O(1) Proportional Share Scheduler," Proc. General Track: 2002 USENIX Ann. Technical Conf., pp.245-259, June 2001.
10 S. Ramabhadran and J. Pasquale, "Stratified Round Robin: A Low Complexity Packet Scheduler with Bandwidth Fairness and Bounded Delay," Proc. ACM SIGCOMM, pp.239-249, 2003.