This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Utility Accrual Real-Time Scheduling Under the Unimodal Arbitrary Arrival Model with Energy Bounds
October 2007 (vol. 56 no. 10)
pp. 1358-1371
In this paper, we consider timeliness and energy optimization in battery-powered, dynamic, embedded real-time systems, which must remain functional during an operation/mission with a bounded energy budget. We consider application activities that are subject to time/utility function time constraints, statistical assurance requirements on timeliness behavior, and an energy budget, which cannot be exceeded at run-time. To account for the inevitable variability in activity arrivals in dynamic systems, we describe arrival behaviors using the unimodal arbitrary arrival model (or UAM) [15]. For such a model, we present a DVS (dynamic voltage scaling)-based, CPU scheduling algorithm called Energy-Bounded Utility Accrual Algorithm (or EBUA). Since the scheduling problem is intractable, EBUA allocates CPU cycles, scales clock frequency, and heuristically computes schedules using statistical estimates of cycle demands, in polynomial-time. We analytically establish EBUA's properties including satisfaction of energy bounds, statistical assurances on individual activity timeliness behavior, optimal timeliness during under-loads, and bounded time for mutually exclusively accessing shared non-CPU resources. Our simulation experiments validate our analytical results and illustrate the algorithm's effectiveness and superiority over past algorithms.

[1] Advanced Micro Devices Corp., “Mobile AMD-K6-2+ Processor Data Sheet,” Publication #23446, June 2000.
[2] T.A. AlEnawy and H. Aydin, “On Energy-Constrained Real-Time Scheduling,” Proc. 16th IEEE Euromicro Conf. Real-Time Systems (ECRTS '04), pp. 165-174, June 2004.
[3] H. Aydin, R. Melhem, D. Mosse, and P. Mejia-Alvarez, “Dynamic and Aggressive Scheduling Techniques for Power-Aware Real-Time Systems,” Proc. 22nd IEEE Real-Time Systems Symp. (RTSS '01), pp. 95-105, Dec. 2001.
[4] T.P. Baker, “Stack-Based Scheduling of Real-Time Processes,” J.Real-Time Systems, vol. 3, no. 1, pp. 67-99, Mar. 1991.
[5] S.K. Baruah, L.E. Rosier, and R.R. Howell, “Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor,” Real-Time Systems, vol. 2, no. 4, pp. 301-324, Nov. 1990.
[6] G.C. Buttazzo, Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications, second ed. Kluwer Academic, 2005.
[7] R. Clark, E.D. Jensen, A. Kanevsky, J. Maurer, P. Wallace, T. Wheeler, Y. Zhang, D. Wells, T. Lawrence, and P. Hurley, “An Adaptive, Distributed Airborne Tracking System,” Proc. IEEE Workshop Parallel and Distributed Systems, pp. 353-362, Apr. 1999.
[8] R.K. Clark, “Scheduling Dependent Real-Time Activities,” PhD dissertation, CMU-CS-90-155, Carnegie Mellon Univ., http:/www.real-time.org. 2006.
[9] R.K. Clark, E.D. Jensen, and N.F. Rouquette, “Software Organization to Facilitate Dynamic Processor Scheduling,” Proc. IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '04), Apr. 2004.
[10] M. Dertouzos, “Control Robotics: The Procedural Control of Physical Processes,” Information Processing, vol. 74, 1974.
[11] K. Flautner and T. Mudge, “Vertigo: Automatic Performance-Setting for Linux,” Proc. Fifth Symp. Operating Systems Design and Implementation, Dec. 2002.
[12] R. Graybill and R. Melhem, Power Aware Computing. Kluwer Academic/Plenum, 2002.
[13] F. Gruian, “Hard Real-Time Scheduling for Low Energy Using Stochastic Data and DVS Processors,” Proc. Int'l Symp. Lower-Power Electronics and Design, Aug. 2001.
[14] D. Grunwald, P. Levis, K. Farkas, C.M. III, and M. Neufeld, “Policies for Dynamic Clock Scheduling,” Proc. Fourth Usenix Symp. Operating Systems Design and Implementation (OSDI '00), Oct. 2000.
[15] J.-F. Hermant and G.L. Lann, “A Protocol and Correctness Proofs for Real-Time High-Performance Broadcast Networks,” Proc. 18th Int'l Conf. Distributed Computing Systems (ICDCS '98), pp. 360-369, 1998.
[16] W. Horn, “Some Simple Scheduling Algorithms,” Naval Research Logistics Quarterly, vol. 21, pp. 177-185, 1974.
[17] E.D. Jensen, “Asynchronous Decentralized Real-Time Computer Systems,” Proc. NATO Advanced Study Inst. on Real-Time Computing, Oct. 1992.
[18] E.D. Jensen, C.D. Locke, and H. Tokuda, “A Time-Driven Scheduling Model for Real-Time Systems,” Proc. Sixth IEEE Real-Time Systems Symp. (RTSS '85), pp. 112-122, Dec. 1985.
[19] D.-I. Kang, S.P. Cargo, and J. Suh, “A Fast Resource Synthesis Technique for Energy-Efficient Real-Time Systems,” Proc. 23rd IEEE Real-Time Systems Symp. (RTSS '02), Dec. 2002.
[20] W. Kim, J. Kim, and S.L. Min, “A Dynamic Voltage Scaling Algorithm for Dynamic-Priority Hard Real-Time Systems Using Slack Time Analysis,” Proc. IEEE/ACM Design, Automation and Test in Europe (DATE '02), Mar. 2002.
[21] W. Kim, J. Kim, and S.L. Min, “Dynamic Voltage Scaling Algorithm for Fixed-Priority Real-Time Systems Using Work-Demand Analysis,” Proc. Int'l Symp. Lower-Power Electronics and Design, Aug. 2003.
[22] G.L. Lann, “Proof-Based System Engineering and Embedded Systems,” Proc. European Educational Forum School on Embedded Systems. G. Rozenberg and F. Vaandrager, eds., pp. 208-248, http://www-rocq.inria.fr/novaltis/publications PBSE%20 &%20EmS%201998.pdf, Oct. 1998.
[23] P. Li and B. Ravindran, “Fast Real-Time Scheduling Algorithms,” IEEE Trans. Computers, vol. 53, no. 9, pp. 1159-1175, Sept. 2004.
[24] P. Li, H. Wu, B. Ravindran, and E.D. Jensen, “A Utility Accrual Scheduling Algorithm for Real-Time Activities with Mutual Exclusion Resource Constraints,” IEEE Trans. Computers, vol. 55, no. 4, pp. 454-469, Apr. 2006.
[25] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 46-61, 1973.
[26] C.D. Locke, “Best-Effort Decision Making for Real-Time Scheduling,” PhD dissertation, CMU-CS-86-134, Carnegie Mellon Univ., http:/www.real-time.org, 2006.
[27] J. Lorch and A. Smith, “Improving Dynamic Voltage Scaling Algorithms with PACE,” Proc. Joint Int'l Conf. Measurement and Modeling of Computer Systems (SIGMETRICS '01/Performance '01), pp. 50-61, June 2001.
[28] T. Martin, “Balancing Batteries, Power and Performance: System Issues in CPU Speed-Setting for Mobile Computing,” PhD dissertation, Carnegie Mellon Univ., Aug. 1999.
[29] D.P. Maynard, S.E. Shipman, R.K. Clark, J.D. Northcutt, R.B. Kegley, B.A. Zimmerman, and P.J. Keleher, “An Example Real-Time Command, Control, and Battle Management Application for Alpha,” Archons Project Technical Report 88121, Dept. of Computer Science, Carnegie Mellon Univ., Dec. 1988.
[30] T. Pering, T. Burd, and R. Brodersen, “Voltage Scheduling in the lpARM Microprocessor System,” Proc. Int'l Symp. Lower-Power Electronics and Design, July 2000.
[31] P. Pillai and K.G. Shin, “Real-Time Dynamic Voltage Scaling for Low-Power Embedded Operating Systems,” Proc. 18th ACM Symp. Operating Systems Principles (SOSP '01), pp. 89-102, 2001.
[32] C. Rusu, R. Melhem, and D. Mosse, “Maximizing the System Value while Satisfying Time and Energy Constraints,” IBM J. Research and Development, vol. 47, nos. 5/6, pp. 689-702, Sept./Nov. 2003.
[33] C. Rusu, R. Melhem, and D. Mosse, “Multi-Version Scheduling in Rechargeable Energy-Aware Real-Time Systems,” Proc. 15th IEEE Euromicro Conf. Real-Time Systems (ECRTS '03), July 2003.
[34] L. Sha, R. Rajkumar, and J.P. Lehoczky, “Priority Inheritance Protocols: An Approach to Real-Time Synchronization,” IEEE Trans. Computers, vol. 39, no. 9, pp. 1175-1185, Sept. 1990.
[35] A. Varga, “OMNeT++ Discrete Event Simulation System,” http:/www.omnetpp.org/, 2006.
[36] J. Wang, B. Ravindran, and T. Martin, “A Power Aware Best-Effort Real-Time Task Scheduling Algorithm,” Proc. First IEEE Workshop Software Technologies for Future Embedded Systems (WSTFEUS '03), pp. 21-28, May 2003.
[37] M. Weiser, B. Welch, A. Demers, and S. Shenker, “Scheduling for Reduced CPU Energy,” Proc. First USENIX Symp. Operating Systems Design and Implementation (OSDI '94), pp. 13-23, Nov. 1994.
[38] H. Wu, “Energy-Efficient, Utility Accrual Real-Time Scheduling,” PhD dissertation, Virginia Polytechnic Inst. and State Univ., http://scholar.lib.vt.edu/theses/available etd-08242005-145355/, 2005.
[39] H. Wu, B. Ravindran, and E.D. Jensen, “Energy-Efficient, Utility Accrual Real-Time Scheduling under the Unimodal Arbitrary Arrival Model,” Proc. IEEE/ACM Design, Automation and Test in Europe (DATE '05), pp. 474-479, Mar. 2005.
[40] H. Wu, B. Ravindran, and E.D. Jensen, “On Bounding Energy Consumption in Dynamic, Embedded Real-Time Systems,” Proc. 21st Ann. ACM Symp. Applied Computing (SAC '06), Apr. 2006.
[41] H. Wu, B. Ravindran, E.D. Jensen, and U. Balli, “Utility Accrual Scheduling under Arbitrary Time/Utility Functions and Multi-Unit Resource Constraints,” Proc. 10th Int'l Conf. Real-Time and Embedded Computing Systems and Applications (RTCSA '04), pp. 80-98, Aug. 2004.
[42] H. Wu, B. Ravindran, E.D. Jensen, and P. Li, “CPU Scheduling for Statistically-Assured Real-Time Performance and Improved Energy Efficiency,” Proc. Second IEEE/ACM/IFIP Int'l Conf. Hardware/Software Codesign and System Synthesis (CODES+ISSS '04), pp. 110-115, Sept. 2004.
[43] H. Wu, B. Ravindran, E.D. Jensen, and P. Li, “Energy-Efficient, Utility Accrual Scheduling under Resource Constraints for Mobile Embedded Systems,” Proc. Fourth ACM Int'l Conf. Embedded Software (EMSOFT '04), pp. 64-73, Sept. 2004.
[44] H. Wu, B. Ravindran, E.D. Jensen, and P. Li, “Energy-Efficient, Utility Accrual Scheduling under Resource Constraints for Mobile Embedded Systems,” ACM Trans. Embedded Computing Systems, vol. 5, no. 3, Aug. 2006.
[45] W. Yuan and K. Nahrstedt, “Energy-Efficient Soft Real-Time CPU Scheduling for Mobile Multimedia Systems,” Proc. 19th ACM Symp. Operating Systems Principles (SOSP '03), pp. 149-163, 2003.

Index Terms:
Real-time systems, energy-efficient scheduling, time/utility functions, utility accrual scheduling
Citation:
Haisang Wu, Binoy Ravindran, E. Douglas Jensen, "Utility Accrual Real-Time Scheduling Under the Unimodal Arbitrary Arrival Model with Energy Bounds," IEEE Transactions on Computers, vol. 56, no. 10, pp. 1358-1371, Oct. 2007, doi:10.1109/TC.2007.1072
Usage of this product signifies your acceptance of the Terms of Use.