Reducing power consumption of non-preemptive real-time systems

被引:0
作者
Saleh Alrashed
机构
[1] University of Dammam,Department of Computer Information Systems, College of Computer Science and Information Technology
来源
The Journal of Supercomputing | 2017年 / 73卷
关键词
Power-efficient scheduling; Real-time systems; Non-preemptive scheduling; Feasibility analysis; Online schedulability tests;
D O I
暂无
中图分类号
学科分类号
摘要
With introduction of dynamic voltage scaling techniques, promising results have been obtained for minimizing overall power consumptions of the real-time systems by exploiting the hardware characteristics of latest processors. Traditionally, preemptive systems have been investigated in depth and interesting results are established accordingly. The non-preemptive counterpart, though equally important, has received very little attention. Due to its simple implementation and lesser number of context switching, non-preemptive systems offer even more opportunities to be exploited for reducing power consumption of the system. In this paper, we establish mathematical foundations for determining the system speed appropriate to non-preemptive nature of tasks such that the timing constraints remain intact and overall power consumption is reduced. We compare our results with closely related techniques, and our analysis shows that the reduction in power consumptions is significant with proposed technique.
引用
收藏
页码:5402 / 5413
页数:11
相关论文
共 38 条
  • [1] Chandrakasan AP(1992)Low power CMOS digital design IEEE J Solid State Circuits 27 472-484
  • [2] Sheng S(1906)Sur les fonctions convexes et les inegalites entreles valeurs moyennes Acta Math 30 175-193
  • [3] Brodersen RW(2005)Energy aware wireless systems with adaptive power-fidelity tradeoffs IEEE Trans Very Large Scale Integr Syst 13 211-225
  • [4] Jensen JLWV(1973)Scheduling algorithms for multiprogramming in a hard real-time environment J ACM 20 40-61
  • [5] Raghunthan V(2016)An efficient schedulability condition for non-preemptive real-time systems at common scheduling points J Supercomput 72 4651-4661
  • [6] Cristiano LP(2017)Solving linear optimization over arithmetic constraint formula J Glob Optim 50 548-584
  • [7] Liu CL(2014)Precautious-RM: a predictable non-preemptive scheduling algorithm for harmonic tasks Real Time Syst 73 1066-1075
  • [8] Layland JW(2013)Lowest priority first based feasibility analysis of real-time systems J Parallel Distrib Comput 59 1419-1430
  • [9] Alrashed S(2012)A comparative study of rate monotonic schedulability tests J Supercomput 29 5-26
  • [10] Alhiyafi J(2005)Rate monotonic vs. EDF: judgment day Real Time Syst 25 449-456