한국콘텐츠학회논문지 (The Journal of the Korea Contents Association)

  • 제10권1호
  • /
  • Pages.103-113
  • /
  • 2010
  • /
  • 1598-4877(pISSN)
  • /
  • 2508-6723(eISSN)
한국콘텐츠학회 (The Korea Contents Association)
권호 표지
DOI QR코드

DOI QR Code

비선점 구간을 갖는 태스크들을 위한 저전력 실시간 스케줄링

Low Power Real-Time Scheduling for Tasks with Nonpreemptive Sections

  • 김남진 (단국대학교 공학대학 컴퓨터과학과) ;
  • 김인국 (단국대학교 공학대학 컴퓨터과학과)
  • 발행 : 2010.01.28
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

RM이나 EDF에 기반을 둔 실시간 스케줄링 알고리즘들은 태스크들이 선점 가능함을 가정하고 있지만 현실적으로는 선점 불가능한 부분이 존재할 수도 있다. 또한 프로세서의 전력 소모를 줄이기 위한 기존의 스케줄링 알고리즘은 태스크 이용률을 기반으로 하여 블로킹 구간이 있는 경우와 없는 경우를 기준으로 두 가지 프로세서 속도($S_H$, $S_L$)를 결정한다. 이 알고리즘에서 높은 속도로 동작하는 $S_H$ 구간은 블로킹에 의한 우선순위 역전이 발생하는 구간이며 이 구간의 길이는 블로킹 구간을 포함한 태스크 종료시한까지로 설정된다. 본 논문에서는 $S_H$ 구간의 길이를 기존의 알고리즘보다 더 짧게 하여 전력소모율을 낮추는 방법을 제안하였다. 모의실험을 통해, 제안된 알고리즘의 전력소모율이 기존 알고리즘에 비하여 최대 13%만큼 감소되었음을 볼 수 있었다.

The basic real-time scheduling algorithms based on RM or EDF approaches assume that the tasks are preemptive, but the tasks may contain nonpreemptive sections in many cases. Also the existing scheduling algorithm for reducing the power consumption of the processor is based on the task utilizations and determines the processor speed $S_H$ or $S_L$ according to the existence of the blocking intervals. In this algorithm, the $S_H$ interval that operates in high speed is the interval during which the priority inversion by blocking occurs, and the length of this interval is set to the task deadline that includes the blocking intervals. In this paper, we propose an improved algorithm that can reduce the power consumption ratio by shortening the length of the $S_H$ interval. The simulation shows that the power consumption ratio of the proposed algorithm is reduced as much as 13% compared to the existing one.

키워드

참고문헌

  1. J. Lehoczky, L. Sha, and Y. Ding, "The rate monotonic scheduling algorithm: Exact characterization and average case behavior," In Proceedings of RTSS, pp.166-171, 1989. https://doi.org/10.1109/REAL.1989.63567
  2. C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard real time environment," Journal of the ACM, Vol. 20, No.1, pp.46-61, 1973. https://doi.org/10.1145/321738.321743
  3. W. Kim, J. Kim, and S. Min, "A Dynamic Voltage Scaling Algorithm for Dynamic- Priority Hard Real-Time Systems Using Slack Time Analysis," Proceedings of the conference on Design, p.788, 2002. https://doi.org/10.1109/DATE.2002.998389
  4. Y. Shin, K. Choi, and T. Sakurai, "Power Optimization of Real-Time Embedded Systems on Variable Speed Processors," ICCAD, p.365, 2000. https://doi.org/10.1109/ICCAD.2000.896499
  5. A. Qadi, and S. Goddard, "A Dynamic Voltage Scaling Algorithm for Sporadic Tasks," Proceedings of the 24rd IEEE Real-Time Systems Symposium, 2003. https://doi.org/10.1109/REAL.2003.1253253
  6. F. Yao, A. Demers, and S. Shenker, "A scheduling model for reduced CPU energy," in Proc. IEEE Annual Foundations of Computer Science, pp.374-382, 1995. https://doi.org/10.1109/SFCS.1995.492493
  7. H. Aydin, R. Melhem, and D. Mosse, "Determining Optimal Processor Speeds for Periodic Real-Time Tasks with Different Power Characteristics," Proceedings of the 13th Euromicro Conference on Real-Time Systems 2001, p.225, 2001. https://doi.org/10.1109/EMRTS.2001.934038
  8. I. Hong, M. Potkonjak, and M. B. Srivastava, "Online Scheduling of Hard Real-Time Tasks on Variable Voltage Processor," ICCAD1998, 1998. https://doi.org/10.1109/ICCAD.1998.144338
  9. W.C. Athas, and J. G. Koller, "An energy-efficient CMOS line driver using adiabatic switching," 1994 IEEE Great Lakes Symposium on VLSI, 1994. https://doi.org/10.1109/GLSV.1994.289970
  10. A. P. Chandrakasan, S. Sheng, and R. W. Brodersen , "Low-power CMOS digital design," IEEE Journal of Solid State Circuits, 1995. https://doi.org/10.1109/4.126534
  11. K. Govil, E. Chan, and H. Wasserman, "Comparing Algorithms for Dynamic Speed-Setting of a Low-Power CPU," International Conference on Mobile Computing and Networking, 1995. https://doi.org/10.1145/215530.215546
  12. M. Weiser, B. Welch, and A. Demers, S. Shenker, "Scheduling for reduced CPU energy," in Proc. USENIX Symposium on Operating Systems Design and Implementation, pp.13-23, 1994.
  13. T. P. Baker, "Stack-base Scheduling of Real-Time Processes," The Journal of Real-Time Systems, pp.67-99, 1991. https://doi.org/10.1007/BF00365393
  14. F. Zhang, and S. Chanson, "Processor Voltage Scheduling for Real-Time Tasks with Non-Preemptible Sections," In Proceedings of RTSS'02, 2002. https://doi.org/10.1109/REAL.2002.1181578
  15. L. Sha, R. Rajkumar, and J. Lehoczky, "Priority Inheritance Protocols, An Approach to Real-Time Synchronization," Technical report CMU-CS-87-181, 1987.
  16. M. I. Chen, and K. J. Lin, "Dynamic Priority Ceilings: A Concurrency Control Protocol for Real-Time Systems," The Journal of Real-Time Systems, Vol.2, No.4, pp.325-346, 1990. https://doi.org/10.1007/BF01995676