Journal of KIISE:Computer Systems and Theory (한국정보과학회논문지:시스템및이론)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Task Synchronization Mechanism for Round Robin based Proportional Share Scheduling

라운드 로빈 기반 비례지분 스케줄링을 위한 동기화 기법

  • Published : 2009.08.15
Download PDF
⟨ Previous Next ⟩

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.

라운드 로빈 기반 비례지분 스케줄링(Round Robin based Proportional Share scheduling, RRPS)은 각 태스크에게 지분(share)을 결정하는 비중(weight)이라는 속성을 정의하고 각 태스크의 비중에 비례하여 CPU 자원을 할당한다. 라운드 로빈 기반 비례지분 스케줄링은 공평성(fairness)을 성능의 척도로 사용하며 스케줄링의 높은 공평성을 목표로 한다. 그러나 태스크를 간의 동기화로 인한 스케줄링의 공평성 문제에 대한 연구는 부족하다. 본 논문에서는 라운드 로빈 기반 비례지분 스케줄링에서 동기화로 인한 스케줄링의 지연이 높은 불공평성을 발생시킴을 보인다. 이를 비중역전(weight inversion)이라는 현상으로 설명한다. 다음, 비중역전을 방지하는 동기화 기법인 비중상속 프로토콜(weight inheritance protocol, WIP)을 제안한다. 또한, 공평성분석과 시뮬레이션을 통해 비중상속 프로토콜이 불공평성을 감소시킴을 보인다.

Keywords

References

  1. A. Demers, S. Keshav, and S. Shenker, "Analysis and Simulation of a Fair Queueing Algorithm," Proc. ACM SIGCOMM '89, pp.1-12, Sept. 1989.
  2. 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.
  3. 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.
  4. J. Bennett and H. Zhang, "WF2Q: Worst-case Fair Weighted Fair Queueing," in Proceedings of INFO-COM '96, San Francisco, CA, Mar. 1996.
  5. 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.
  6. 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.
  7. 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.
  8. 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. https://doi.org/10.1109/TC.2006.148
  9. L. Kleinrock, "Queueing Systems, Volume II: Computer Applications," New York: John Wiley & Sons, 1976.
  10. 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.