Reachability Analysis of Cost-Reward Timed Automata for Energy Efficiency Scheduling
Authors: 
Wei Wang, Guo Dong, Zhigang Deng, Guosun Zeng, Wei Liu, Huanliang XiongAuthors Info & Claims
Wei Wang, Guo Dong, Zhigang Deng, Guosun Zeng, Wei Liu, Huanliang XiongAuthors Info & ClaimsPages 140 - 148
Abstract
As the ongoing scaling of semiconductor technology causing severe increase of on-chip power density in microprocessors, this leads for urgent requirement for power management during each level of computer system design. In this paper, we describe an approach for solving the general class of energy optimal task graph scheduling problems using cost-reward timed automata. We propose a formal technique based on model checking using extended timed automata to solve the processor frequency assignment problem in an energy-constrained multitasking system. To handle the problem of "state space explosion" in symbolic model checking, we also provide an efficient zone-based algorithm for minimum-cost reachability. Our approach is capable of finding efficient solutions under various constraints and applicable to other problem variants as well. Experimental results demonstrate the usefulness and effectiveness of our approach.
References
[1]
M. J. Ellsworth. Chip power density and module cooling technology projections for the current decade. ITHERM, 2004.
[2]
S. Gunther et al., Managing the impact of increasing microprocessor power consumption. ITJ, 2001, 5(1):1--9.
[3]
J. J. Chen et al., Energy-efficient scheduling for real-time systems on dynamic voltage scaling (dvs) platforms. RTCSA, 2007.
[4]
Y. Abdedda, A. Kerbaa, et al., Task graph scheduling using timed automata. In: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), 2008.
[5]
F. Gruian, K. Kuchcinski, Low-energy directed architecture selection and task scheduling. In: Proceeding of the 25th EuroMICRO Conference, 1999, pp. 296--302.
[6]
Marvell, Marvell StrongARM 1100 processor, http://www.marvell.com.
[7]
S. Zhang et al., Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules. ISLPED, 2007.
[8]
W. Wang, P. Mishra, et al., PreDVS: preemptive dynamic voltage scaling for real- time systems using approximation scheme. DAC, 2010.
[9]
H. Aydin et al., Power-aware scheduling for periodic realtime tasks. IEEE Trans. Comput., 53(5):584--600, 2004.
[10]
D. Shin et al., Dynamic voltage scaling of periodic and aperiodic tasks in priority-driven systems. ASP-DAC, 2004.
[11]
R. Jejurikar et al., Leakage aware dynamic voltage scaling for real-time embedded systems. DAC, 2004.
[12]
X. Zhong et al., System-wide energy minimization for realtime tasks: Lower bound and approximation. ICCAD, 2006.
[13]
W. X. Wang, P. Mishra, System-Wide Leakage-Aware Energy Minimization Using Dynamic Voltage Scaling and Cache Reconfiguration in Multitasking Systems, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2012, 20(5): 902--910.
[14]
T. Chantem, R. P. Dick, et al., Temperature-Aware Scheduling and Assignment for Hard Real-Time Applications on MPSoCs, in Proc. of Design, Automation and Test in Europe, 2008, pp. 288--293.
[15]
A. Coskun, T. Rosing, K. et al., Static and Dynamic Temperature-Aware Scheduling for Multiprocessor SoCs, IEEE Transactions on Very Large Scale Integration Systems, 2008, 16(9), pp. 1127--1140.
[16]
W. H. Cunningham, A Network Simplex Method, Mathematical Programming, 1976, 11(1): 105--106.
[17]
X. Qin, P. Mishra, Directed test generation for validation of multicore architectures, ACM Transactions on Design Automation of Electronic Systems, 2012.
[18]
R. Alur et al., A theory of timed automata. Theor. Comput. Sci., 126(2):183--235, 1994.
[19]
C. Norström et al., Timed automata as task models for event-driven systems. RTCSA, 1999.
[20]
E. Fersman et al., Timed automata with asynchronous processes: Schedulability and decidability. TACAS, 2002.
[21]
R. Alur, S. L. Torre, et al., Optimal paths in weighted timed automata, LNCS, 2001, 2034: 49.
[22]
K. Larsen, G. Behrmann, et al., As cheap as possible: Efficient cost-optimal reachability for priced timed automata. LNCS, 2001, 102: 493.
[23]
A. Lungu, P. Bose, et al., Multicore power management: Ensuring robustness via early-stage formal verification, in Proc. of International Conference on Formal Methods and Models for Co-Design, 2009, pp. 78--87.
[24]
S. Shukla, R. Gupta, A model checking approach to evaluating system level dynamic power management policies for embedded systems, in Proc. of High-Level Design Validation and Test Workshop, 2001, pp. 53--57.
[25]
W. X. Wang, X. K. Qin, P. Mishra, Temperature and Energy Constrained Scheduling in Multitasking Systems: A Model Checking Approach, IEEE/ACM International Symposium on Low Power Electronics and Design (ISLPED), Aug. 2010, pp85--90.
[26]
S. M. Martin, K. Flautner, et al., Combined dynamic voltage scaling and adaptive body biasing for lower power microprocessors under dynamic workloads, in: Proc. IEEE/ACM International Conference on Computer Aided Design ICCAD, 2002, pp. 721--725.
[27]
J. I. Rasmussen, K. G. Larsen, K. Subramani, On using priced timed automata to achieve optimal scheduling, Formal Methods in System Design, 2006, 29(1): 97--114.
[28]
C. Lee, M. Potkonjak, W.H. Mangione-smith, Mediabench: a tool for evaluating and synthesizing multimedia and communications systems, in: Proceedings of International Symposium on Microarchitecture, 1997, pp. 330--335.
[29]
M. Guthaus, J. Ringenberg, D. Ernest, T. Austin, T. Mudge, R. Brown, Mibench: a free, commercially representative embedded benchmark suite, in: Proceedings of IEEE International Workshop on Workload Characterization, 2001, pp. 3--14.
[30]
EEMBC, The Embedded Microprocessor Benchmark Consortium, http://www.eembc.org/.
Index Terms
- Reachability Analysis of Cost-Reward Timed Automata for Energy Efficiency Scheduling
Recommendations
Reachability Analysis of Cost-Reward Timed Automata for Energy Efficiency Scheduling
PMAM'14: Proceedings of Programming Models and Applications on Multicores and ManycoresAs the ongoing scaling of semiconductor technology causing severe increase of on-chip power density in microprocessors, this leads for urgent requirement for power management during each level of computer system design. In this paper, we describe an ...
Interrupt Timed Automata: verification and expressiveness
We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.
While the reachability problem is undecidable for ...
Translation of Timed Promela to Timed Automata with Discrete Data
Concurrency Specification and Programming (CS&P)The aim of the work is twofold. In order to face the problem of modeling time constraints in Promela, a timed extension of the language is presented. Next, timed Promela is translated to timed automata with discrete data, that is timed automata extended ...
Comments
Information & Contributors
Information
Published In
February 2014
156 pages
Copyright © 2014 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 07 February 2014
Check for updates
Author Tags
Qualifiers
- Tutorial
- Research
- Refereed limited
Conference
PPoPP '14
Sponsor:
PPoPP '14: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
February 15 - 19, 2014
FL, Orlando, USA
Acceptance Rates
Overall Acceptance Rate 53 of 97 submissions, 55%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 138Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 23 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in