가변 실행 시간 태스크들을 위한 개선된 Pfair 스케줄링 알고리즘
An Improved Pfair Scheduling Algorithm for Tasks with Variable Execution Times
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
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.
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.
참고문헌 (12)
- 김인국, "흐름 공정 모델의 효율적인 실시간 스케줄링", 박사, pp.1995
- 차성덕, "Mode Change 환경에 적합한 동적 퀀텀 크기 스케줄링", 한국콘텐츠학회 논문지, 6(9), pp.28~41 (2006), 한국콘텐츠학회
- 김남진, "개선된 동적 퀀텀 크기 Pfair 스케줄링의 구현", 한국산학기술학회논문지, 10(10), pp.2760~2765 (2009), 한국산학기술학회
- C.L. Liu, "Scheduling algorithm for multiprogramming in a hard real-time environment", JACM, 20, pp.46~61 (1973)
- D. Zhu, "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 (2003)
- A New Look at Pfair priorities, Technical report, Dept of Computer Science, "J. Anderson", Univ. of North Carolina, ~ (1999)
- J. Anderson, "Early-release fair scheduling", Proceedings of the 12th Euromicro Conference on Real-time Systems, pp.35~43 (2000)
- J. Anderson, "Pfair scheduling: beyond periodic task systems", Proceedings of the 7th International Conference on Real-Time Computing Systems and Applications, pp.297~306 (2000)
- J. Anderson, "Quick-release fair scheduling", Proceedings of the 24th IEEE Real-time Systems Symposium, pp.130~141 (2003)
- W. Jane, "Real-time Systems" (2000), Prentice Hall
- S. Baruah, "Fast scheduling of periodic tasks on multiple resource", Proceedings of the 9th International Parallel Processing Symposium, pp.280~288 (1995)
- S. Baruah, "Proportionate progress: a notion of fairness in resource allocation", Algorithmica, 15, pp.600~625 (1996)