IEMEK Journal of Embedded Systems and Applications (대한임베디드공학회논문지)

Institute of Embedded Engineering of Korea (대한임베디드공학회)
권호 표지
DOI QR코드

DOI QR Code

An Improved Pfair Scheduling Algorithm for Tasks with Variable Execution Times

가변 실행 시간 태스크들을 위한 개선된 Pfair 스케줄링 알고리즘

  • 박현선 (단국대학교 대학원 전자계산학과) ;
  • 김인국 (단국대학교 컴퓨터과학과)
  • Received : 2010.12.10
  • Accepted : 2011.01.12
  • Published : 2011.02.28
Download PDF
⟨ Previous Next ⟩

Abstract

The Pfair scheduling algorithm, which is an optimal scheduling algorithm in the hard real-time multiprocessor environments, propose the necessary and sufficient condition for the schedulability and is based on the fixed quantum size. Recently, several methods that determine the optimal quantum size dynamically were proposed in the mode change environments. But these methods considered only the case in which the period of a task is increased or decreased. In this paper, we also consider the case in which the execution time of a task is increased or decreased, and propose new methods that determine the optimal quantum size dynamically.

Keywords

References

  1. 김인국, 흐름 공정 모델의 효율적인 실시간 스케줄링, 아주대학교 박사학위 논문, 1995.
  2. 김인국 외, "Mode Change 환경에 적합한 동적 퀀텀 크기 스케줄링", 콘텐츠학회논문집, 제6권, 제9호, pp. 28-41, 2006.
  3. 김인국 외, "개선된 동적 퀀텀 크기 Pfair 스케줄링의 구현", 한국산학기술학회논문지, 제10권 제10호, pp. 2760-2765, 2009.
  4. 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
  5. 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.
  6. J. Anderson and A. Srinivasan, A New Look at Pfair priorities, Technical report, Dept of Computer Science, Univ. of North Carolina, 1999.
  7. J. Anderson and A. Srinivasan, "Early-release fair scheduling", Proceedings of the 12th Euromicro Conference on Real-time Systems, pp. 35-43, June. 2000.
  8. J. Anderson and A. Srinivasan, "Pfair scheduling: beyond periodic task systems", Proceedings of the 7th International Conference on Real-Time Computing Systems and Applications, pp. 297-306, Dec. 2000.
  9. 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.
  10. W. Jane, S. Liu, Real-time Systems, Prentice Hall, Apr. 2000
  11. 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.
  12. 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