Browse > Article
http://dx.doi.org/10.7236/JIWIT.2011.11.1.165

Dynamic Pfair Scheduling Using an Improved Reach Function  

Park, Hyun-Sun (단국대학교 컴퓨터과학과)
Kim, In-Guk (단국대학교 컴퓨터과학과)
Publication Information
The Journal of the Institute of Internet, Broadcasting and Communication / v.11, no.1, 2011 , pp. 165-170 More about this Journal
Abstract
The Pfair scheduling algorithm, which is an optimal algorithm in the hard real-time multiprocessor environments, is based on the fixed quantum size. Recently, several methods that can determine the optimal quantum dynamically are developed in the mode change environments. These methods are based on the reach function and in many cases, we have to do the sequential search to find the optimal quantum. In this paper, we propose a new scheduling method, based on the improved reach function, that can determine the optimal quantum more quickly.
Keywords
Real-time Scheduling; Multiprocessor Scheduling; Pfair Algorithm;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 차성덕, 김인국, "Mode Change 환경에 적합한 동적 퀀텀 크기 스케줄링", 콘텐츠학회논문집, 제6권, 제9호, pp.28-41, 2006.
2 김남진, 김인국, "개선된 동적 퀀텀 크기 Pfair 스케줄링의 구현", 한국산학기술학회논문지, 제10권, 제10호, pp.2760-2765, 2009.
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.   DOI
4 D. Zhu, D. Mosse, and R. Melhem, "Multiple-Resource Periodic Scheduling Problem: how much fairness is necessary?" Real-Time Systems Symposium, 2003. RTSS 2003. 24th IEEE, 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 and 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.
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.   DOI   ScienceOn