Abstract
Dynamic Voltage Scaling (DVS), which adjusts the clock speed and supply voltage dynamically, is an effective technique in reducing the energy consumption of embedded real-time systems. However, most existing DVS algorithms focus on reducing the energy consumption of CPU only, ignoring their negative impacts on task scheduling and system wide energy consumption. In this paper, we address one of such side effects, an increase in task preemptions due to DVS. We present energy-efficient Fixed-priority with preemption threshold (EE-FPPT) scheduling algorithm to solve this problem. First, we propose an appropriate schedulability analysis, based on response time analysis, for supporting energy-efficient FPPT scheduling in hard real-time systems. Second, we prove that a task set achieves the minimal energy consumptions under Maximal Preemption Threshold Assignment (MPTA).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kim, W., Kim, J., Min, S.L.: A dynamic voltage scaling algorithm for dynamic-priority hard real-time systems using slack time analysis. In: Paris, F. (ed.) Design, Automation and Test in Europe Conference and Exposition, pp. 788–794. IEEE Computer Society, Los Alamitos (2002)
Kim, W., Kim, J., Min, S.L.: Dynamic voltage scaling algorithm for fixed-priority real-time systems using work-demand analysis. In: Roh, I.V., Hyung (eds.) ISLPED, Seoul, Korea, pp. 396–401. ACM, New York (2003)
Sakurai, T., Newton, A.R.: Alpha-power law mosfet model and its applications to cmos inverterdelay and other formulas. IEEE Journal of Solid-State Circuits 25(2), 584–594 (1990)
Padmanabhan Pillai, K.G.S.: Real-time dynamic voltage scaling for low-power embedded operating systems. In: 18th ACM Symposium on Operating System Principles, Chateau Lake Louise, Banff, Alberta, Canada, vol. 35, pp. 89–102. ACM, New York (2001)
Kim, W., Shin, D., Yun, H.S., Kim, J., Min, S.L.: Performance comparison of dynamic voltage scaling algorithms for hard real-time systems. In: 8th IEEE Real Time Technology and Applications Symposium, San Jose, CA, USA, pp. 219–228. IEEE Computer Society, Los Alamitos (2002)
Lee, S., Min, S.L., Kim, C.-S., Lee, C.-G., Lee, M.: Cache-conscious limited preemptive scheduling. Real-Time Systems 17(2-3), 257–282 (1999)
Saewong, S., Rajkumar, R.: Practical voltage-scaling for fixed-priority rt-systems. In: 9th IEEE Real-Time and Embedded Technology and Applications Symposium, Toronto, Canada, pp. 106–114. IEEE Computer Society, Los Alamitos (2003)
Vishnu Swaminathan, K.C.: Pruning-based, energy-optimal, deterministic i/o device scheduling for hard real-time systems. ACM Transactions on Embeded Computing Systems 4(1), 141–167 (2005)
Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM 20(1), 46–61 (1973)
George, L., Nicolas Rivierre, M.S.: Preemptive and non-preemptive real-time uniprocessor scheduling. Technical Report RR-2966, INRIA, France (1996)
Manas Saksena, Y.W.: Scalable real-time system design using preemption thresholds. In: 21st IEEE Real-Time Systems Symposium, pp. 25–34 (2000)
Wang, Y., Saksena, M.: Scheduling fixed-priority tasks with preemption threshold. In: 6th International Workshop on Real-Time Computing and Applications Symposium, Hong Kong, China, pp. 328–335. IEEE Computer Society, Los Alamitos (1999)
Chen, J., Ashif Harji, P.B.: Solution space for fixed-priority with preemption threshold. In: 11th IEEE Real Time and Embedded Technology and Applications Symposium (RTAS 2005), San Francisco, CA, USA, pp. 385–394. IEEE Computer Society Press, Los Alamitos (2005)
Regehr, J.: Scheduling tasks with mixed preemption relations for robustness to timing faults. In: IEEE Real-Time Systems Symposium, pp. 315–326 (2002)
Muller, F.: Timing analysis for instruction caches. Real-Time Systems 18(2/3), 217–247 (2000)
Park, C.Y.: Predicting program execution times by analyzing static and dynamic program paths. Real-Time Systems 5(1), 31–62 (1993)
Chen, J.: Extensions to Fixed Priority with PreemptionThreshold and Reservation-Based Schedulin. Ph.D thesis, University of Waterloo (2005)
University, E.: The paparazzi project (2007)
Nemer, F., Cassé, H., Sainrat, P., Bahsoun, J.P., De Michiel, M.: Papabench: a free real-time benchmark. In: Mueller, F. (ed.) 6th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis, Germany, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. Dagstuhl Seminar Proceedings, vol. 06902 (2006)
Shin, Y., Choi, K., Sakurai, T.: Power optimization of real-time embedded systems on variable speed processors. In: Sentovich, E. (ed.) 2000 IEEE/ACM International Conference on Computer-Aided Design, San Jose, California, USA, IEEE, Los Alamitos (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, X., Jia, Y. (2008). Leakage-Aware Energy Efficient Scheduling for Fixed-Priority Tasks with Preemption Thresholds. In: Tang, C., Ling, C.X., Zhou, X., Cercone, N.J., Li, X. (eds) Advanced Data Mining and Applications. ADMA 2008. Lecture Notes in Computer Science(), vol 5139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88192-6_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-88192-6_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88191-9
Online ISBN: 978-3-540-88192-6
eBook Packages: Computer ScienceComputer Science (R0)