Yifan Zhu, Frank Mueller North Carolina State University Center for Efficient, Secure and Reliable Computing DVSleak: Combining Leakage Reduction and Voltage.

Slides:



Advertisements
Similar presentations
Feedback EDF Scheduling Exploiting Dynamic Voltage Scaling Yifan Zhu and Frank Mueller Department of Computer Science Center for Embedded Systems Research.
Advertisements

Reducing the Number of Preemptions in Real-Time Systems Scheduling by CPU Frequency Scaling Abhilash Thekkilakattil, Anju S Pillai, Radu Dobrin, Sasikumar.
Energy-efficient Task Scheduling in Heterogeneous Environment 2013/10/25.
1 “Scheduling with Dynamic Voltage/Speed Adjustment Using Slack Reclamation In Multi-processor Real-Time Systems” Dakai Zhu, Rami Melhem, and Bruce Childers.
Real- time Dynamic Voltage Scaling for Low- Power Embedded Operating Systems Written by P. Pillai and K.G. Shin Presented by Gaurav Saxena CSE 666 – Real.
Harini Ramaprasad, Frank Mueller North Carolina State University Center for Embedded Systems Research Tightening the Bounds on Feasible Preemption Points.
Introduction and Background  Power: A Critical Dimension for Embedded Systems  Dynamic power dominates; static /leakage power increases faster  Common.
Power Aware Real-time Systems Rami Melhem A joint project with Daniel Mosse, Bruce Childers, Mootaz Elnozahy.
Soft Real-Time Semi-Partitioned Scheduling with Restricted Migrations on Uniform Heterogeneous Multiprocessors Kecheng Yang James H. Anderson Dept. of.
Operating Systems 1 K. Salah Module 2.1: CPU Scheduling Scheduling Types Scheduling Criteria Scheduling Algorithms Performance Evaluation.
Aleksandra Tešanović Low Power/Energy Scheduling for Real-Time Systems Aleksandra Tešanović Real-Time Systems Laboratory Department of Computer and Information.
1 Center for Embedded Systems Research (CESR) Department of Computer Science North Carolina State University Frank Mueller Timing Analysis: In Search of.
NC STATE UNIVERSITY Anantaraman © 2004RTSS–25 Enforcing Safety of Real-Time Schedules on Contemporary Processors using a Virtual Simple Architecture (VISA)
System-Wide Energy Minimization for Real-Time Tasks: Lower Bound and Approximation Xiliang Zhong and Cheng-Zhong Xu Dept. of Electrical & Computer Engg.
Embedded System Design Framework for Minimizing Code Size and Guaranteeing Real-Time Requirements Insik Shin, Insup Lee, & Sang Lyul Min CIS, Penn, USACSE,
Power-aware Computing n Dramatic increases in computer power consumption: » Some processors now draw more than 100 watts » Memory power consumption is.
The Design and Performance of A Real-Time CORBA Scheduling Service Christopher Gill, David Levine, Douglas Schmidt.
CS 423 – Operating Systems Design Lecture 22 – Power Management Klara Nahrstedt and Raoul Rivas Spring 2013 CS Spring 2013.
Folklore Confirmed: Compiling for Speed = Compiling for Energy Tomofumi Yuki INRIA, Rennes Sanjay Rajopadhye Colorado State University 1.
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.
Abhilash Thekkilakattil, Radu Dobrin, Sasikumar Punnekkat Mälardalen Real-time Research Center, Mälardalen University Västerås, Sweden Preemption Control.
Low Power Techniques in Processor Design
Baoxian Zhao Hakan Aydin Dakai Zhu Computer Science Department Computer Science Department George Mason University University of Texas at San Antonio DAC.
ParaScale : Exploiting Parametric Timing Analysis for Real-Time Schedulers and Dynamic Voltage Scaling Sibin Mohan 1 Frank Mueller 1,William Hawkins 2,
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.
Dynamic Slack Reclamation with Procrastination Scheduling in Real- Time Embedded Systems Paper by Ravindra R. Jejurikar and Rajesh Gupta Presentation by.
A S CHEDULABILITY A NALYSIS FOR W EAKLY H ARD R EAL - T IME T ASKS IN P ARTITIONING S CHEDULING ON M ULTIPROCESSOR S YSTEMS Energy Reduction in Weakly.
Probabilistic Preemption Control using Frequency Scaling for Sporadic Real-time Tasks Abhilash Thekkilakattil, Radu Dobrin and Sasikumar Punnekkat.
Scheduling policies for real- time embedded systems.
1 Distributed Energy-Efficient Scheduling for Data-Intensive Applications with Deadline Constraints on Data Grids Cong Liu and Xiao Qin Auburn University.
Real-Time Systems Mark Stanovich. Introduction System with timing constraints (e.g., deadlines) What makes a real-time system different? – Meeting timing.
Abhilash Thekkilakattil, Radu Dobrin, Sasikumar Punnekkat Mälardalen Real-time Research Center, Mälardalen University Västerås, Sweden Towards Preemption.
Company name KUAS HPDS A Realistic Variable Voltage Scheduling Model for Real-Time Applications ICCAD Proceedings of the 2002 IEEE/ACM international conference.
Real-Time Scheduling CS4730 Fall 2010 Dr. José M. Garrido Department of Computer Science and Information Systems Kennesaw State University.
Hard Real-Time Scheduling for Low- Energy Using Stochastic Data and DVS Processors Flavius Gruian Department of Computer Science, Lund University Box 118.
VGreen: A System for Energy Efficient Manager in Virtualized Environments G. Dhiman, G Marchetti, T Rosing ISLPED 2009.
NC STATE UNIVERSITY 1 Feedback EDF Scheduling w/ Async. DVS Switching on the IBM Embedded PowerPC 405 LP Frank Mueller North Carolina State University,
Dynamic Voltage Frequency Scaling for Multi-tasking Systems Using Online Learning Gaurav DhimanTajana Simunic Rosing Department of Computer Science and.
F A S T Frequency-Aware Static Timing Analysis
Critical Power Slope: Understanding the Runtime Effects of Frequency Scaling Akihiko Miyoshi †,Charles Lefurgy ‡, Eric Van Hensbergen ‡, Ram Rajamony ‡,
CSE 522 Real-Time Scheduling (2)
1 Real-Time Scheduling. 2Today Operating System task scheduling –Traditional (non-real-time) scheduling –Real-time scheduling.
CSCI1600: Embedded and Real Time Software Lecture 24: Real Time Scheduling II Steven Reiss, Fall 2015.
ECE555 Topic Presentation Energy-efficient real-time scheduling Xing Fu 20 September 2008 Acknowledge Dr. Jian-Jia Chen from ETH providing PPT Slides for.
QoPS: A QoS based Scheme for Parallel Job Scheduling M. IslamP. Balaji P. Sadayappan and D. K. Panda Computer and Information Science The Ohio State University.
Harini Ramaprasad, Frank Mueller North Carolina State University Center for Embedded Systems Research Bounding Preemption Delay within Data Cache Reference.
CprE 458/558: Real-Time Systems (G. Manimaran)1 Energy Aware Real Time Systems - Scheduling algorithms Acknowledgement: G. Sudha Anil Kumar Real Time Computing.
Undergraduate course on Real-time Systems Linköping University TDDD07 Real-time Systems Lecture 2: Scheduling II Simin Nadjm-Tehrani Real-time Systems.
Determining Optimal Processor Speeds for Periodic Real-Time Tasks with Different Power Characteristics H. Aydın, R. Melhem, D. Mossé, P.M. Alvarez University.
Chapter 4 CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation.
Lecture 6: Real-Time Scheduling
Distributed Process Scheduling- Real Time Scheduling Csc8320(Fall 2013)
Embedded System Scheduling
Reducing the Number of Preemptions in Real-Time Systems Scheduling by CPU Frequency Scaling Abhilash Thekkilakattil, Anju S Pillai, Radu Dobrin, Sasikumar.
EEE 6494 Embedded Systems Design
Chapter 6: CPU Scheduling
Flavius Gruian < >
Module 5: CPU Scheduling
Dynamic Voltage Scaling
Chapter 6: CPU Scheduling
Process Scheduling Decide which process should run and for how long
Processes and operating systems
Aravindh Anantaraman*, Kiran Seth†, Eric Rotenberg*, Frank Mueller‡
FAST: Frequency-Aware Static Timing Analysis
Ch 4. Periodic Task Scheduling
Research Topics Embedded, Real-time, Sensor Systems Frank Mueller moss
Presentation transcript:

Yifan Zhu, Frank Mueller North Carolina State University Center for Efficient, Secure and Reliable Computing DVSleak: Combining Leakage Reduction and Voltage Scaling in Feedback EDF Scheduling

2 Background Dyn. Voltage scaling (DVS): lowers dyn. power — Power ~ Sleep: lowers leakage (static) power Dynamic power was dominating Leakage becoming dominant

3 Real-Time Systems Hard real-time systems — periodic, preemptive, independent tasks [Liu, Layland] –w/ known worst-case execution time (WCET) — jobs: periodically released instances of a task — WCET: measured at the max. freq., w/o DVS — most practical system: U << 1 Earliest-deadline-first (EDF) scheduling —, C i =WCET, P i =period —,  = (0<   1)  DVS scaling factor

4 Motivation Embedded systems with limited power supply DVS for real-time system — trade-off: energy saving vs. timing requirements — lower CPU voltage/frequency  longer to complete Task workloads change dynamically — WCET overestimates actual execution time — wide variation of execution times –Longest vs. shortest times Sleeping: 1-2 orders of magnitude less power — DVS below threshold  more energy than sleeping — Long idle  more energy than sleeping — But wakeup overhead (cold misses in cache)

5 Motivation Prior DVS algorithms: lack adaptability to dynamic workloads Real-world examples: — graphics: 78% of WCET [Wegener/Mueller] — defense: 87%; automotive: 74% — benchmarks: 30-89%; image recognition: 85% [Wolf] Look-ahead DVS [Pillai/ Shin]

6 Contribution A feedback-based framework for dynamic workloads [LCTES’02, RTAS’04, LCTES’05] New: A hybrid sleep+DVS scheme, 2 observations: 1.Limit to DVS  use sleep below certain threshold 2.Trade-off idle vs. sleep  depends on length of inactivity 3.Feedback helps in these decisions Simulation experiments Comparison with prior work

7 Related Work Dynamic Voltage Scaling — General purpose DVS: Weiser, Govil, Pering, Grunwald — Real-time DVS: Lee, Pillai, Aydin — Optimality of DVS: Ishihara, Qu, Lorch, Xie, Saewong Feedback Real-time Scheduling — Stankovic, Lu, Varma, Poellabauer, Minerick Leakage-aware DVS scheduling — Lee, Quan, Jejurikar ’04/’05, Zhang — We compare with Jejurikar’05 (closest related, best scheme)

8 Feedback-DVS Framework V/f selector: error  (V,f) = func(error) Fig. Feedback-DVS Framework Maximum EDF schedule determine slack in EDF schedule assumes: c = WCET

9 Voltage-Frequency Selector : Task splitting with WCET:  + — at freq.  ( 0    100%); at max. freq. — More aggressive: –  < uniform frequency w/o splitting — Objective: –T finishes within the 1 st portion  lower energy consumption   = /( +slack) Still guaranteed to meet deadline  proof in prior paper f t f max Tb 100%  f t Ta / 

10 Extension to Leakage-aware DVS Power ~ Static power exceeds dynamic power when the voltage is reduced below a threshold value, the critical speed — Voltage below threshold  not energy efficient anymore — Sleeping may be better But need to consider wakeup overhead — Mostly due to cache refill — Calculated statically based on time to refill reused lines Dynamic power does NOT dominate anymore!

11 Speed Reduction vs. Task Delaying tt T T Speed reduction Delaying the start time Why delay the start time of a task? — To maximize the CPU sleeping time

12 Delay Dispatching a Task 1. If idle1+idle2 > t th before DVS but < t th afterwards  no DVS 2. idle1+idle2 < t th  no delay 3. If idle1 < C B  no delay 4. Otherwise delay Still guaranteed to meet deadline  proof in paper idle1 idle2 T1T2T3 t (i) Consider Schedule WCET idle1 sleep T1T2T3 t (ii) No Delay WCET idle2 sleep T1T2T3 t (iii) Delay CBCB WCET threshold for sleep

13 Scaling below the Critical Speed Pure DVS: should never scale frequency below critical speed DVS combined with sleeping: — sleep if threshold t th > idle slot — If idle slot is too short (< t th ), scale below critical speed –No other work to do (in contrast to non real-time) –Lower frequency/voltage  power savings

14 Experimental Framework Scheduling simulator — Accurately reflects energy trends [Zhu’05]  PPC405LP Use the same power model as [Jejurikar’04] — Critical speed, wakeup cost Assume four discrete frequency levels: — 25%, 50%, 75%, 100% of f max Compare energy in hyperperiod (const. amount of work) for — Pure Feedback-DVS — DVS+sleep: Feedback-DVS w/ sleep policy (no delay policy) — DSR-DP: dyn. procrastination+slack reclamation [Jejurikar’05] — DVSleak: feedback-DVS w/ sleep & delay now/later policies — Lower-bound schedule: best frequency + sleep for max. idle

15 3 Tasks, Const. Execution, 25% WCET Significant savings w/ sleep, more for low utilizations DVSleak: Delay  most impact for medium to high utilizations — Close to lower bound

16 3 Tasks, Const. Execution, 75% WCET All schemes: resilient to actual/WCET ratio DVSleak never worse than other schemes, savings: — 50% over pure, 20% over DVS+sleep, 8.5% over DSR-DP

17 3 Tasks, Var. Execution (pat1), 75% WCET DVSleak: more resilient to fluctuating exec. times (unchanged)  feedback helps! All others: 5-10% more energy consumption than for const. exec.

18 10 Tasks, Const. Execution, 25% WCET More tasks  5-10% higher energy cost (switching) DVSleak still best of all (~ same margin)

19 Length of Task Periods U=60%, E normalized to hyperperiod task set 2, c=50% WCET Harmonic (1) vs. non-harmonic (2): — 10-27% more energy for non-harmonic  cannot fold jobs released at same time  more uncertainty Longer (2) vs. shorter (3) periods for non-harmonic: — 2-28% more energy for shorter periods  more job releases, less sleep time — DVSleak ~ 15% lower energy than DSR-DP  Feedback more important for shorter periods

20 Conclusion DVSleak: Novel Feedback DVS + leakage (sleep), benefits for — fluctuating execution times — shorter task periods  can scale below critical speed — medium utilizations (most common)  sleep policy by itself enough for high/low utilizations (always sleep/never sleep) DVSleak energy over other schemes: — avg. 50% over DVS-only — avg. 20% more over DVS+sleep — Avg. 8.5% more over [ Jejurikar’05] — Sleep now/later important when actual exec. << WCET Prior: Evaluation on a real embedded platform — V 2 f model works for OS scheduling

21 Future Work Implementation on IBM PPC 405LP test board Has been used for DVS experiments — Oscilloscope, data acquisition card for voltage / current Assessing sleep modes 1. Clock suspend  same power, all still up 2. Suspend  1/10 power, SDRAM up 3. Hibernate  N/A (SDRAM  NVRAM) 4. Standby  N/A (APM over I2C)  Need faster resume (reactivating devices slow  low-power modes)