Real-Time Systems

, Volume 46, Issue 1, pp 88–120 | Cite as

Competitive analysis of online real-time scheduling algorithms under hard energy constraint

Article
First Online:

Abstract

In this paper, we undertake the competitive analysis of the online real-time scheduling problems under a given hard energy constraint. Specifically, we derive worst-case performance bounds that apply to any online algorithm, when compared to an optimal algorithm that has the knowledge of the input sequence in advance. First, by focusing on uniform value-density settings, we prove that no online algorithm can achieve a competitive factor greater than \(1-\frac{e_{\max}}{E}\), where e max  is the upper bound on the size of any job and E is the available energy budget. Then we propose a variant of EDF algorithm, EC-EDF, that is able to achieve this upper bound. We show that a priori information about the largest job size in the actual input sequence makes possible the design of a semi-online algorithm EC-EDF ∗ which achieves a constant competitive factor of 0.5. This turns out to be the best achievable competitive factor in these settings. In non-uniform value density settings, we derive an upper bound on the competitive factor achievable by any online algorithm, as well as the competitive factors of EC-EDF and EC-EDF ∗ algorithms. We also investigate the implications of having additional constraints on the online scheduling algorithm, including non-idling and non-preemptive execution constraints. Moreover, we analyze the case where the processor can adjust its speed at run-time through Dynamic Voltage Scaling (DVS) capability.

Keywords

Real-time systems Energy management Competitive analysis 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. AlEnawy TA, Aydin H (2005) Energy-constrained scheduling for weakly-hard real-time systems. In: Proceedings of the real-time systems symposium (RTSS’05) Google Scholar
  2. AlEnawy TA, Aydin H (2004) On energy-constrained real-time scheduling. In: Proceedings of the European conference on real-time systems (ECRTS’04) Google Scholar
  3. Aydin H, Devadas V, Zhu D (2006) System-level energy management for periodic real-time tasks. In: Proceedings of real-time systems symposium (RTSS’06) Google Scholar
  4. Aydin H, Melhem R, Mosse D, Mejia-Alvarez P (2004) Power-aware scheduling for periodic real-time tasks. IEEE Trans Comput 53(10) Google Scholar
  5. Bansal N, Kimbrel T, Pruhs K (2004) Dynamic speed scaling to manage energy and temperature. In: Symposium on foundations of computer science (FOCS’04) Google Scholar
  6. Baruah S, Rosier L, Howell R (1990) Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. In: Real time systems(2) Google Scholar
  7. Baruah S, Koren G, Mishra B, Raghunathan A, Rosier L, Shasha D (1991a) Online scheduling in the presence of overload. In: Proceedings of the symposium on foundations of computer science (FOCS’91) Google Scholar
  8. Baruah S, Koren G, Mao D, Mishra B, Raghunathan A, Rosier L, Shasha D, Wang F (1991b) On the competitiveness of online real-time task scheduling. In: Proceedings of the real-time systems symposium (RTSS’91) Google Scholar
  9. Baruah S (1998) Overload tolerance for single-processor workloads. In: Proceedings of the real-time technology and application symposium (RTAS’98) Google Scholar
  10. Baruah S, Haritsa J (1997) Scheduling for overload in real-time systems. IEEE Trans Comput 46(9) Google Scholar
  11. Baruah S, Hickey ME (1998) Competitive online scheduling of imprecise computations. IEEE Trans Comput 47(9) Google Scholar
  12. Borodin A, El-Yavin R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge MATHGoogle Scholar
  13. Buttazzo G (2005) Hard real-time computing systems: predictable scheduling algorithms and applications, 2nd edn. Springer, Berlin MATHGoogle Scholar
  14. Chan HL, Chan WT, Lam TW, Lee LK, Mak KS, Wong P (2007) Energy efficient online deadline scheduling. In: Proceedings of the symposium on discrete algorithms (SODA’07) Google Scholar
  15. Chen JJ, Kuo TW (2005) Voltage scaling scheduling for periodic real-time tasks in reward maximization. In: Proceedings of the real-time system symposium (RTSS’05) Google Scholar
  16. Dertouzos M, Mok AK (1989) Multiprocessor online scheduling for hard real-time tasks. IEEE Trans Softw Eng 15(12) Google Scholar
  17. Dertouzos M (1974) Control robotics: the procedural control of physical processes. In: Proceedings of IFIP congress Google Scholar
  18. Ebenlendr T, Sgall J (2009) Semi online preemptive scheduling: one algorithm for all variants. In: Proceedings of international symposium on theoretical aspects of computer science (STACS’09) Google Scholar
  19. Garey MR, Johnson DS (1990) Computers and intractability. A guide to the theory of Np-completeness. Freeman, New York Google Scholar
  20. Iwama K, Taketomi S (2002) Removable online knapsack problems. In: Proceedings of the international colloquium on automata, languages and programming (ICALP’02) Google Scholar
  21. Jeffay K, Stone DL (1993) Accounting for interrupt handling costs in dynamic priority task systems. In: Proceedings of the real-time systems symposium (RTSS’93) Google Scholar
  22. Jeffay K, Stanat DF, Martel CU (1991) On non-preemptive scheduling of periodic and sporadic tasks. In: Proceedings of the real-time systems symposium (RTSS’91) Google Scholar
  23. Kalyanasundaram B, Pruhs K (1995) Speed is as powerful as clairvoyance. In: Proceedings of the symposium on foundations of computer science (FOCS’95) Google Scholar
  24. Koren G, Shasha D (1992) D-over: an optimal online scheduling algorithm for overloaded real-time systems. In: Proceedings of the real-time systems symposium (RTSS’92) Google Scholar
  25. Koren G, Shasha D, Huang SC (1993) MOCA: a multiprocessor online competitive algorithm for real-time scheduling. In: Proceedings of the real-time systems symposium (RTSS’93) Google Scholar
  26. Lee CH, Shin KG (2004) Online dynamic voltage scaling for hard real-time systems using the EDF algorithm. In: Proceedings of the real-time systems symposium (RTSS’04) Google Scholar
  27. Liu J (2000) Real time systems. Prentice Hall, New York Google Scholar
  28. Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementation. Wiley, New York Google Scholar
  29. Palis MA (2004) Competitive algorithms for fine-grain real-time scheduling. In: Proceedings of the real-time systems symposium (RTSS’04) Google Scholar
  30. Phillips C, Stein C, Torng E, Wein J (2002) Optimal time-critical scheduling via resource augmentation. Algorithmica 163–200 Google Scholar
  31. Pillai P, Shin KG (2001) Real-time dynamic voltage scaling for low-power embedded operating systems. In: Proceedings of the symposium on operating systems principles (SOSP’01) Google Scholar
  32. Pruhs K, Sgall J, Torng E (2004) Maximizing rewards for real-time applications with energy constraints. In: Leung JYT (ed) The handbook of scheduling, algorithms, models and performance analysis. CRC press, Boca Raton Google Scholar
  33. Rusu C, Melhem R, Mosse D (2003) Maximizing rewards for real-time applications with energy constraints. ACM Trans Embed Comput Syst 2(4) Google Scholar
  34. Rusu C, Melhem R, Mosse D (2002) Maximizing the system value while satisfying time and energy constraints. In: Proceedings of the real-time system symposium (RTSS’02) Google Scholar
  35. Wu H, Ravindran B, Jensen ED (2007) Utility accrual real-time scheduling under the unimodal arbitrary arrival model with energy bounds. IEEE Trans Comput 56(10) Google Scholar
  36. Yao F, Demers A, Shenker S (1995) A scheduling model for reduced CPU energy. In: Proceedings of the symposium on foundations of computer science (FOCS’95) Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Department of Computer ScienceGeorge Mason UniversityFairfaxUSA

Personalised recommendations