Journal of the Korea Academia-Industrial cooperation Society (한국산학기술학회논문지)

The Korea Academia-Industrial cooperation Society (한국산학기술학회)
권호 표지
DOI QR코드

DOI QR Code

An Implementation of Improved Dynamic Quantum-Size Pfair Scheduling

개선된 동적 퀀텀 크기 Pfair 스케줄링의 구현

  • Kim, Nam-Jin (Department of Computer Science, Dankook University) ;
  • Kim, In-Guk (Department of Computer Science, Dankook University)
  • Published : 2009.10.31
Download PDF
⟨ Previous Next ⟩

Abstract

Pfair scheduling algorithm, which is an optimal scheduling algorithm in the hard real-time multiprocessor environments, is based on the fixed quantum size. Recently, several methods that determine the maximum quantum size dynamically were proposed in the mode change environments. But these methods considered the case in which the period of a task can only be decreased. In this paper, we consider the case in which the period of a task can be decreased or increased, and propose an improved method that determine the maximum quantum size dynamically in the mode change environments. A simulation shows that the proposed method is effective.

다중 프로세서 환경에서 경성 실시간 태스크 집합의 스케줄링 문제를 해결하는 Pfair 스케줄링 알고리즘은 고정된 퀀텀 크기를 기반으로 한다. 최근 mode change 환경에서 최대 퀀텀 크기를 동적으로 결정하는 방법이 제안되었는데, 이 방법에서는 태스크들의 주기가 감소되는 경우만을 다루고 있다. 본 논문에서는 태스크들의 주기가 증가되는 경우까지도 고려하여 최대 퀀텀 크기를 동적으로 결정하는 개선된 방법을 제안하였고 모의실험에서 이를 구현하여 효율성을 입증하였다.

Keywords

References

  1. 김인국, 흐름 공정 모델의 효율적인 실시간 스케줄링, 아주대학교 박사학위 논문, 1995.
  2. 김인국 외, "Mode Change 환경에 적합한 동적 퀀텀 크기 스케줄링", 콘텐츠학회논문집, 제6권, 제9호, pp.28-41, 2006.
  3. C. L. Liu and J. W. Layland, "Scheduling Algorithm for Multiprogramming in a hard real-time environment," JACM, Vol.20. pp.46-61, 1973. https://doi.org/10.1145/321738.321743
  4. D. Zhu, D. Mosse, and R. Melhem, "Multiple-Resource Periodic Scheduling Problem: how much fairness is necessary?," Real-Time Systems Symposium, Proceedings of the 24th IEEE Real-time Systems Symposium, pp.142-151, Dec. 2003.
  5. J. Anderson and A. Srinivasan, A New Look at Pfair priorities, Technical report, Dept of Computer Science, Univ. of North Carolina, 1999.
  6. J. Anderson and A. Srinivasan, "Early-release fair scheduling," Proceedings of the 12th Euromicro Conference on Real-time Systems, pp.35-43, June. 2000.
  7. J. Anderson and A. Srinivasan, "Pfair Scheduling: Beyond Periodic Task Systems," Proceedings of the 7th International Conference on Real-Time Computing Systems nad Applications, pp.297-306, Dec. 2000.
  8. J. Anderson, A. Block, and A. Srinivasan, "Quick-release Fair Scheduling," Proceedings of the 24th IEEE Real-time Systems Symposium, pp.130-141, Dec. 2003. https://doi.org/10.1109/REAL.2003.1253261
  9. S. Baruah, J. Gehrke, and C. G. Plaxton. "Fast Scheduling of Periodic Tasks on Multiple Resource," Proceedings of the 9th International Parallel Processing Symposium, pp.280-288, Apr. 1995.
  10. S. Baruah, N. Cohen, C. G. Plaxton, and D. Varvel, "Proportionate Progress: A notion of fairness in resource allocation," Algorithmica, Vol.15, pp.600-625, 1996. https://doi.org/10.1007/BF01940883