Low Power Real-Time Scheduling for Tasks with Nonpreemptive Sections

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

  • 김남진 (단국대학교 공학대학 컴퓨터과학과) ;
  • 김인국 (단국대학교 공학대학 컴퓨터과학과)
  • Published : 2010.01.28


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.


Real-Time Scheduling;Low Power;Nonpreemptive


  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.
  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.
  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.
  4. Y. Shin, K. Choi, and T. Sakurai, "Power Optimization of Real-Time Embedded Systems on Variable Speed Processors," ICCAD, p.365, 2000.
  5. A. Qadi, and S. Goddard, "A Dynamic Voltage Scaling Algorithm for Sporadic Tasks," Proceedings of the 24rd IEEE Real-Time Systems Symposium, 2003.
  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.
  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.
  8. I. Hong, M. Potkonjak, and M. B. Srivastava, "Online Scheduling of Hard Real-Time Tasks on Variable Voltage Processor," ICCAD1998, 1998.
  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.
  10. A. P. Chandrakasan, S. Sheng, and R. W. Brodersen , "Low-power CMOS digital design," IEEE Journal of Solid State Circuits, 1995.
  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.
  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.
  14. F. Zhang, and S. Chanson, "Processor Voltage Scheduling for Real-Time Tasks with Non-Preemptible Sections," In Proceedings of RTSS'02, 2002.
  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.