Mode Selection and Mode Dependency Modeling for Power-Aware Embedded Systems Dexin Li, Pai H. Chou, Nader Bagherzadeh University of California, Irvine.

Slides:



Advertisements
Similar presentations
© 2004 Wayne Wolf Topics Task-level partitioning. Hardware/software partitioning.  Bus-based systems.
Advertisements

Energy Efficiency through Burstiness Athanasios E. Papathanasiou and Michael L. Scott University of Rochester, Computer Science Department Rochester, NY.
Solutions for Scheduling Assays. Why do we use laboratory automation? Improve quality control (QC) Free resources Reduce sa fety risks Automatic data.
1 of 14 1 /23 Flexibility Driven Scheduling and Mapping for Distributed Real-Time Systems Paul Pop, Petru Eles, Zebo Peng Department of Computer and Information.
A system Performance Model Instructor: Dr. Yanqing Zhang Presented by: Rajapaksage Jayampthi S.
Courseware Power-aware scheduling Jan Madsen Informatics and Mathematical Modelling Technical University of Denmark Richard Petersens Plads, Building 321.
High-level System Modeling and Power Management Techniques Jinfeng Liu Dept. of ECE, UC Irvine Sep
Investigating the Effect of Voltage- Switching on Low-Energy Task Scheduling in Hard Real-Time Systems Paper review Presented by Chung-Fu Kao.
1 Scheduling Mapping of tasks to time slots  Computation  Communication Mapping of power usage to time slots  Mechanical devices  Thermal subsystems.
Performance and Energy Bounds for Multimedia Applications on Dual-processor Power-aware SoC Platforms Weng-Fai WONG 黄荣辉 Dept. of Computer Science National.
Extended Gantt-chart in real-time scheduling for single processor
System-Wide Energy Minimization for Real-Time Tasks: Lower Bound and Approximation Xiliang Zhong and Cheng-Zhong Xu Dept. of Electrical & Computer Engg.
1 Integrated Management of Power Aware Computing & Communication Technologies PI Meeting Nader Bagherzadeh, Pai H. Chou, Fadi Kurdahi University of California,
1 Scheduling Mapping of tasks to time slots  Computation  Communication Mapping of power usage to time slots  Mechanical devices  Thermal subsystems.
Power Modeling and Power Management Framework Dexin Li December 2002.
1 Mode Selection Determine when what component is running at what mode Mode selection is non-trivial  Scheduler will be overwhelmed to determine component.
Processor Frequency Setting for Energy Minimization of Streaming Multimedia Application by A. Acquaviva, L. Benini, and B. Riccò, in Proc. 9th Internation.
BRASS Analysis of QuasiStatic Scheduling Techniques in a Virtualized Reconfigurable Machine Yury Markovskiy, Eylon Caspi, Randy Huang, Joseph Yeh, Michael.
Adaptive Video Coding to Reduce Energy on General Purpose Processors Daniel Grobe Sachs, Sarita Adve, Douglas L. Jones University of Illinois at Urbana-Champaign.
1 Energy Efficient Communication in Wireless Sensor Networks Yingyue Xu 8/14/2015.
Minimizing Response Time Implication in DVS Scheduling for Low Power Embedded Systems Sharvari Joshi Veronica Eyo.
VOLTAGE SCHEDULING HEURISTIC for REAL-TIME TASK GRAPHS D. Roychowdhury, I. Koren, C. M. Krishna University of Massachusetts, Amherst Y.-H. Lee Arizona.
UPC/SHMEM PAT High-level Design v.1.1 Hung-Hsun Su UPC Group, HCS lab 6/21/2005.
OPTIMAL SERVER PROVISIONING AND FREQUENCY ADJUSTMENT IN SERVER CLUSTERS Presented by: Xinying Zheng 09/13/ XINYING ZHENG, YU CAI MICHIGAN TECHNOLOGICAL.
A Fast On-Chip Profiler Memory Roman Lysecky, Susan Cotterell, Frank Vahid* Department of Computer Science and Engineering University of California, Riverside.
Baoxian Zhao Hakan Aydin Dakai Zhu Computer Science Department Computer Science Department George Mason University University of Texas at San Antonio DAC.
A Framework for Energy- Saving Data Gathering Using Two-Phase Clustering in Wireless Sensor Networks Wook Chio, Prateek Shah, and Sajal K. Das Center for.
Low-Power Wireless Sensor Networks
Computer Science Department University of Pittsburgh 1 Evaluating a DVS Scheme for Real-Time Embedded Systems Ruibin Xu, Daniel Mossé and Rami Melhem.
Low Power Design for Real-Time Systems Low power (energy) consumption is a key design for embedded systems Battery’s life during operation Reliability.
1 EE5900 Advanced Embedded System For Smart Infrastructure Energy Efficient Scheduling.
Probabilistic Preemption Control using Frequency Scaling for Sporadic Real-time Tasks Abhilash Thekkilakattil, Radu Dobrin and Sasikumar Punnekkat.
1 Integrated Management of Power Aware Computing & Communication Technologies PI Meeting Nader Bagherzadeh, Pai H. Chou, Fadi Kurdahi University of California,
Jiwon Hahn ECE295 Seminar December 2, 2002 Integrated Management of Power Aware Computing & Communication Technologies.
1 Distributed Energy-Efficient Scheduling for Data-Intensive Applications with Deadline Constraints on Data Grids Cong Liu and Xiao Qin Auburn University.
Hardware/Software Co-design Design of Hardware/Software Systems A Class Presentation for VLSI Course by : Akbar Sharifi Based on the work presented in.
Real-Time Systems Mark Stanovich. Introduction System with timing constraints (e.g., deadlines) What makes a real-time system different? – Meeting timing.
A Graph Based Algorithm for Data Path Optimization in Custom Processors J. Trajkovic, M. Reshadi, B. Gorjiara, D. Gajski Center for Embedded Computer Systems.
Resource Mapping and Scheduling for Heterogeneous Network Processor Systems Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinha, Arunabha Sen and Andrea.
Managing Server Energy and Operational Costs Chen, Das, Qin, Sivasubramaniam, Wang, Gautam (Penn State) Sigmetrics 2005.
Power Estimation and Optimization for SoC Design
Chapter 1 Computer Abstractions and Technology. Chapter 1 — Computer Abstractions and Technology — 2 The Computer Revolution Progress in computer technology.
Hard Real-Time Scheduling for Low- Energy Using Stochastic Data and DVS Processors Flavius Gruian Department of Computer Science, Lund University Box 118.
Dynamic Voltage Frequency Scaling for Multi-tasking Systems Using Online Learning Gaurav DhimanTajana Simunic Rosing Department of Computer Science and.
Power and Control in Networked Sensors E. Jason Riedy and Robert Szewczyk Presenter: Fayun Luo.
A Systematic Approach to the Design of Distributed Wearable Systems Urs Anliker, Jan Beutel, Matthias Dyer, Rolf Enzler, Paul Lukowicz Computer Engineering.
Real-Time Support for Mobile Robotics K. Ramamritham (+ Li Huan, Prashant Shenoy, Rod Grupen)
High-level System Modeling and Power Management Techniques Jinfeng Liu Dept. of ECE, UC Irvine Sep
Adaptive Sleep Scheduling for Energy-efficient Movement-predicted Wireless Communication David K. Y. Yau Purdue University Department of Computer Science.
Multimedia Computing and Networking Jan Reduced Energy Decoding of MPEG Streams Malena Mesarina, HP Labs/UCLA CS Dept Yoshio Turner, HP Labs.
VLSI Design & Embedded Systems Conference January 2015 Bengaluru, India Few Good Frequencies for Power-Constrained Test Sindhu Gunasekar and Vishwani D.
Workload Clustering for Increasing Energy Savings on Embedded MPSoCs S. H. K. Narayanan, O. Ozturk, M. Kandemir, M. Karakoy.
Physically Aware HW/SW Partitioning for Reconfigurable Architectures with Partial Dynamic Reconfiguration Sudarshan Banarjee, Elaheh Bozorgzadeh, Nikil.
1 Hardware-Software Co-Synthesis of Low Power Real-Time Distributed Embedded Systems with Dynamically Reconfigurable FPGAs Li Shang and Niraj K.Jha Proceedings.
University of Maryland at College Park Smart Dust Digital Processing, 1 Digital Processing Platform Low power design and implementation of computation.
Architectural-level Design Exploration for Power Aware System Dexin Li October 2000.
Determining Optimal Processor Speeds for Periodic Real-Time Tasks with Different Power Characteristics H. Aydın, R. Melhem, D. Mossé, P.M. Alvarez University.
Resource Optimization for Publisher/Subscriber-based Avionics Systems Institute for Software Integrated Systems Vanderbilt University Nashville, Tennessee.
On the Relation Between Simulation-based and SAT-based Diagnosis CMPE 58Q Giray Kömürcü Boğaziçi University.
INTRODUCTION TO WIRELESS SENSOR NETWORKS
Jacob R. Lorch Microsoft Research
Andrea Acquaviva, Luca Benini, Bruno Riccò
Flavius Gruian < >
Digital Processing Platform
Dynamic Voltage Scaling
Presented By: Darlene Banta
Kyoungwoo Lee, Minyoung Kim, Nikil Dutt, and Nalini Venkatasubramanian
Fast Min-Register Retiming Through Binary Max-Flow
Presentation transcript:

Mode Selection and Mode Dependency Modeling for Power-Aware Embedded Systems Dexin Li, Pai H. Chou, Nader Bagherzadeh University of California, Irvine 5th International Conference on VLSI Design and 7th Asia and South Pacific Design Automation Conference Bangalore, India, January 11, 2002

2 Outline Introduction Related work Mode dependency modeling Mode selection Experimental results Conclusions

3 Introduction Power-aware systems  Low power  High performance as required Use components with multiple power modes  Power modes: full-on, doze, nap, sleep, deep sleep, shutdown, …  voltage and frequency settings  Peripheral devices with diff. bus transfer rate, encodings Mode selection  Choose combinations of power modes over time  Satisfy power performance constraints

4 Mode Selection Choosing mode combinations  Many power modes are available  Few modes are considered Current limitations  OS/API limitations  Difficult to track the details Select modes in isolation  e.g., processor only  Lack of system-level view Satisfying constraints  Power  Timing

5 Related Work Dynamic Power Management (DPM)  Low power, low-latency as a design goal (rather than a constraint)  [Benini99], [Hwang97], [Qiu00], …  Lack of real time guarantees  Not considering inter-component dependency Dynamic voltage scaling (DVS)  Slow down processor greedily  [Yao95], [Hong98], [Shin99], [Quan01]  Limited to single processor  Can have counter-intuitive effects at system-level

6 Example: tasks on multiple components Component R1 is voltage scalable R2, R3 are NOT voltage scalable R3 co-active with R1 (R1 on => R3 on) original schedule original power profile R1 R2 R3 P max A B C C A B Time view Power viewdeadline

7 Example -- applying DVS Greedily slow down R1, stretch A all the way to deadline Co-activation => stretch C by same amount as A Problems: Max violation (overlap B), plus higher energy! DVS schedule DVS power profile R1 R2 R3 P max C' A' B B Time view Power viewdeadline C' A'

8 Example: optimal solution Slow down R1 partially to eliminate power spike Reduces co-active energy due to task C No overlap with B => eliminates max power violation Feasible time schedule Optimal power profile R1 R2 R3 P max A'' B B C'' Time view Power viewdeadline

9 Our approach Constraint-driven  Power, performance as hard constraints Mode change overhead  Timing, power  Will not change mode if overhead cannot be amortized System-level modeling  Co-activation  Selection dependency across components Exponential search space  Pruning required

10 Outline Introduction Related work Mode dependency modeling  Mode dependency graph (MDG)  Legal configurations Mode selection Experimental results Conclusions

11 System modeling Resource R  M = {m1, m2, … } mutually exclusive modes notation: R.m1, R.m2, …  H = subset of M x Mset of overhead functions (power, time) on changing mode Component  = container of one or more resources System  Set of resources { R 1, R 2, R 3, …}  Set of dependencies between modes  Configuration = member of M R1 x M R2 x M R3 x …  Workload  Constraints

12 Mode dependency across resources Necessary condition:  m1 is necessary for m2  !m2 is sufficient for !m1 Operators  AND, OR, XOR Mode dependency graph  Vertices: set of modes set of operators  Edges:direction of dependency Purpose: generate set of “legal” configurations  Assignments that satisfy all mode dependencies  Independent of workload and timing/power constraints m1 m2 m1 ANDOR m2 R1 R2

13 Example: Sensor Node (MIT) Components:Modes  processor Aactive, idle, sleep  memory Mon, off  radio Rrx_tx, rx, tx, off  sensor Son, off # of possible configurations  3 x 2 x 4 x 2 = 48 (grows multiplicatively) # of legal configurations  5 as given by MIT group (closer to linearly)  Manually generated  Want to automate this

14 Mode dependencies in sensor node Betw. CPU and {sensor, radio}  CPU may sleep if both radio and sensor are off  CPU may sleep or idle if either sensor or radio is “working” Betw. Memory and CPU  CPU co-activation with memory (asymmetric) Betw. sensor and radio  Radio ON only if sensor ON S.off R.off AND A.sleep S.on R.rx_tx R.rx XOR A.sleep A.idle A.activeM.on A.idle A.sleep M.off R.onS.on

15 Generating legal configurations Idea: one “counter” per resource  Binary encoding for modes in a resource Interresource dependency graph  Dependency between counters  An edge (R1.m1, R2.m2) in MDG => add edge (R1, R2) Linearize the counters  Topological sort  break cycle if necessary Run the counters  Count next digit only if there is an edge in original MDG radio sensor CPU mem CPU radio sensor off sleepoffonoffsleepoffidleoffonidleoffactiveon

16 Outline Introduction Related work Mode dependency modeling Mode selection  Legal vs. feasible configurations  Mode schedule Experimental results Conclusions

17 Mode Selection: input Mode dependency graph A schedule of workload  Independent of power/energy, timing Component library  Maps workload into power, timing  Maps mode change into power/timing overhead Constraints  Timing:min/max separation  Power:min/max power levels

18 Output: feasible mode schedule Feasibility  All configurations are “legal” (satisfy MDG)  All timing & power constraints are satisfied Mode schedule  Original workload mapped to configuration (selected modes) over time  Overhead tasks inserted between changed modes  Idle power also considered Solutions  Dynamic programming  Backtracking

19 Example – Mars Pathfinder Rover Component-based system  Power sources: solar panel, non-rechargeable batteries  Power consumers Digital: computer, wireless, camera, hazard detector Mechanical: driving motors, steering motors Thermal: heaters Design constraints:  Power consumption Max/min power constraints  Timing Hard real-time Pair-wise precedence  Mode dependency Co-activation Enabling/disabling

20 Application Example: Mars Rover Behaviors and tasks  Moving around on Mars surface  Communicating with the Lander  Taking pictures (IMP)  Performing scientific experiments (APXS, ASI/MET) Components in the entire system  Hazard detector (HAZ),  Driving motor (DRV)  Steer motor (STR)  Radio frequency modem (RF)  Camera (CAM)  Microprocessor (PPC),  Micro-controller (MC)

21 Example: Mars Rover Components:  hazard detector, driving motor, steering motor Constraints:  hazard detector and motors should not be working at the same time Legal configurations str.on drv.o n OR str.off str: steering motor drv: driving motor haz: hazard detector hazard detectordriving motorsteering motor off onoff on offon off m0 m1 m2 m3 m4

22 Results Base line  Only: on/off modes  Relaxed constraints  Mode change overhead  No max power constraint Mode selection  Energy saving: 3.7% to 11.9% 8.7% average  Meets max power  More general timing

23 Results: Min power Free energy source  e.g., solar panel  Thermal battery Cost:  above min power Saving:  From 6.9% to 49.3%  average 26.5%

24 Exploring Different Working Scenarios Explore different working scenarios and compare results  Three mission tasks Moving around (MOV) Taking picture (CAM) Scientific experiment (SCI)  Three scenarios A: MOV, CAM, SCI B: CAM, MOV, SCI C: CAM, SCI, MOV

25 Result III Different working scenarios have different energy consumption  Scenario C consumes 12% more energy than scenario A (by mode selection) Mode selection always does better than simply on/off modes

26 Conclusions Mode selection problem  Choosing modes of component  Minimize energy at system level, satisfy timing constraints  Handles mode-change overhead Mode dependency modeling  Enabling relationship between modes of diff resources  Helps prune out illegal configurations Mode selection algorithm  Iterate over legal config’s to find feasible mode schedule  Satisfies power & timing constraints  Improve existing solution by 8-25% in energy cost  Give designers confidence in power-aware systems Tool available from

27 Mode Selection Algorithm (sketch) Exploration techniques  Backtracking  Cutting exploration space with multi-dimensional constraints Two steps in design exploration:  Find feasible mode selection for operating tasks Timing constraints Dependency between tasks  Find feasible mode selections for idle intervals System power/energy constraints: min, max, or power profile Mode change overhead, both time and power overheads Speedup techniques  Sorting component modes with power numbers

28 Legal configurations Sensor Node example  Mode combinations given by MIT group: 5 combinations  Mode combination generated from dependency graph  Add constraint When sensor is off, all other component should be off (proactive)  Automatically obtain same results as MIT group conf SRAM s0 ontx_rxon s1 onrxidleoff s2 onrxsleepoff s3 onoffsleepoff s4 offtx_rxon s5 off rxidleoff s6 offrxsleepoff s7 off sleepoff Not given by MIT group

29 Bibliography [Benini99] L. Benini, G. Paleologo, A. Bogliolo, and G. De Micheli. Policy optimization for dynamic power management. IEEE Trans. Computer-Aided Design, 18:813–833, June [Hwang97] C.-H. Hwang and A. Wu. A predictive system shutdown method for energy saving of event-driven computation. In Proc. of DAC, November [Qiu00] Q. Qiu, Q.Wu, and M. Pedram. Dynamic power management of complex systems using Generalized Stochastic Petri Nets. In Proc. of DAC, pages 352–356, [Hong98] I. Hong, D. Kirovski, G. Qi, M. Potkonjak, and M. B. Srivastava. Power optimization of variable voltage core-based systems. In Proc. of DAC, pages 176–181, [Quan01] G. Quan and X. S. Hu. Energy efficient fixed-priority scheduling for real-time systems on variable voltage processors. In Proc. of DAC, pages 828–833, [Shin99], Y. Shin and K. Choi. Power conscious fixed priority scheduling for hard real-time systems. In Proc. of DAC, pages 134–139, [Yao95] F. Yao, A. Demers, and S. Shenker. A scheduling model for reduced CPU energy. IEEE Annual Foundation of Computer Science, pages 374–382, 1995.

30 Acknowledgements DARPA PACC F NASA/Cal-Tech/JPL:  N. Aranki  M. Mojarradi  J. U. Patel  N. Toomarian

31 Tool Prototype Language  Python, Tkinter Graphical User Interface  Time window and power window  View tasks, overheads, power profile  Interactive command line  Incorporate with the scheduler (to be completed)  On-line help (to be completed)

32 Scenario A

33 Scenario B

34 Scenario C

35 System Power Representation Schedule  Gantt Chart Time view Power view Mode selection  Gantt chart Tasks marked with mode settings  Added non-operating tasks Idle intervals mode change overheads  Power profile view

36 Mode Selection: Problem Statement Input  A schedule  MDG  Constraints (power, timing) Output  a mode schedule Problem statement  Find feasible mode selection for the tasks/idle intervals for the components that meets system power and timing constraints Mode selector schedule Component library System constraints Mode selections

37 Comparison of three scenarios OriginalDVSOptimal No Timing Violations NoYesNo Power Violations Energy Cost Original  Does not apply dynamic voltage scaling technique DVS  Ignores mode dependency between R1 and R3 Optimal solution  Must consider mode dependency  Energy saving due to dynamic voltage scaling