The Journal of the Institute of Internet, Broadcasting and Communication (한국인터넷방송통신학회논문지)

The Institute of Internet, Broadcasting and Communication (한국인터넷방송통신학회)
권호 표지
DOI QR코드

DOI QR Code

Dynamic Pfair Scheduling Using an Improved Reach Function

개선된 도달 함수를 이용한 동적 Pfair 스케줄링

  • 박현선 (단국대학교 컴퓨터과학과) ;
  • 김인국 (단국대학교 컴퓨터과학과)
  • Received : 2010.12.17
  • Accepted : 2011.02.11
  • Published : 2011.02.28
Download PDF
⟨ Previous Next ⟩

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.

Pfair 알고리즘은 다중 프로세서 환경에서 경성 실시간 태스크 집합을 스케줄링 하는 최적 알고리즘인데, 고정된 퀀텀 크기를 기반으로 한다. 최근 mode change 환경에서 도달 함수를 이용하여 최적 퀀텀을 동적으로 결정하는 방법들이 제안되었는데, 이 방법들에서는 최적 퀀텀을 구하기 위해 순차 탐색을 해야 되는 경우가 많이 발생하였다. 본 논문에서는 개선된 도달 함수를 이용하여 최적 퀀텀을 보다 빠르게 구할 수 있는 새로운 방법을 제안하였다.

Keywords

References

  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. 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, 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. https://doi.org/10.1007/BF01940883