ENERGY-EFFICIENT ALGORITHMS INTRODUCTION TO DETERMINISTIC ONLINE POWER-DOWN ALGORITHMS Len Matsuyama CS 695.

Slides:



Advertisements
Similar presentations
Computer Engineering and Networks Technische Informatik und Kommunikationsnetze Jan Beutel, ETH Zurich Wireless Sensor Networks for Extreme Environments.
Advertisements

1 EE5900 Advanced Embedded System For Smart Infrastructure Energy Efficient Scheduling.
Computer Structure Power Management Lihu Rappoport and Adi Yoaz Thanks to Efi Rotem for many of the foils.
Computer Abstractions and Technology
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.
Power Reduction Techniques For Microprocessor Systems
Introduction and Background  Power: A Critical Dimension for Embedded Systems  Dynamic power dominates; static /leakage power increases faster  Common.
Power Management Algorithms An effort to minimize Processor Temperature and Energy Consumption.
Zheming CSCE715.  A wireless sensor network (WSN) ◦ Spatially distributed sensors to monitor physical or environmental conditions, and to cooperatively.
Improving Software Quality with Generic Autonomics Support Richard Anthony The University of Greenwich.
Adaptive Data Collection Strategies for Lifetime-Constrained Wireless Sensor Networks Xueyan Tang Jianliang Xu Sch. of Comput. Eng., Nanyang Technol. Univ.,
Dynamic Power Management for Systems with Multiple Power Saving States Sandy Irani, Sandeep Shukla, Rajesh Gupta.
Low Power Design for Wireless Sensor Networks Aki Happonen.
Embedded Computing From Theory to Practice November 2008 USTC Suzhou.
Optimization Of Power Consumption For An ARM7- BASED Multimedia Handheld Device Hoseok Chang; Wonchul Lee; Wonyong Sung Circuits and Systems, ISCAS.
ECE 510 Brendan Crowley Paper Review October 31, 2006.
Power-aware Computing n Dramatic increases in computer power consumption: » Some processors now draw more than 100 watts » Memory power consumption is.
Multi-core processors. History In the early 1970’s the first Microprocessor was developed by Intel. It was a 4 bit machine that was named the 4004 The.
Energy Model for Multiprocess Applications Texas Tech University.
Energy, Energy, Energy  Worldwide efforts to reduce energy consumption  People can conserve. Large percentage savings possible, but each individual has.
Juanjo Noguera Xilinx Research Labs Dublin, Ireland Ahmed Al-Wattar Irwin O. Irwin O. Kennedy Alcatel-Lucent Dublin, Ireland.
CS 423 – Operating Systems Design Lecture 22 – Power Management Klara Nahrstedt and Raoul Rivas Spring 2013 CS Spring 2013.
Task Alloc. In Dist. Embed. Systems Murat Semerci A.Yasin Çitkaya CMPE 511 COMPUTER ARCHITECTURE.
Folklore Confirmed: Compiling for Speed = Compiling for Energy Tomofumi Yuki INRIA, Rennes Sanjay Rajopadhye Colorado State University 1.
A Survey of Mobile Cloud Computing Application Models
Low-Power Wireless Sensor Networks
1 Overview 1.Motivation (Kevin) 1.5 hrs 2.Thermal issues (Kevin) 3.Power modeling (David) Thermal management (David) hrs 5.Optimal DTM (Lev).5 hrs.
Last Time Performance Analysis It’s all relative
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.
Online Power Saving Strategies Sandy Irani Joint work with Rajesh Gupta, Sandeep Shukla, Dinesh Ramanathan.
Energy Savings with DVFS Reduction in CPU power Extra system power.
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
1 Distributed Energy-Efficient Scheduling for Data-Intensive Applications with Deadline Constraints on Data Grids Cong Liu and Xiao Qin Auburn University.
Recognizing Potential Parallelism Introduction to Parallel Programming Part 1.
80-Tile Teraflop Network-On- Chip 1. Contents Overview of the chip Architecture ▫Computational Core ▫Mesh Network Router ▫Power save features Performance.
CPU Inside Maria Gabriela Yobal de Anda L#32 9B. CPU Called also the processor Performs the transformation of input into output Executes the instructions.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
A new Ad Hoc Positioning System 컴퓨터 공학과 오영준.
Hard Real-Time Scheduling for Low- Energy Using Stochastic Data and DVS Processors Flavius Gruian Department of Computer Science, Lund University Box 118.
Power and Control in Networked Sensors E. Jason Riedy and Robert Szewczyk Presenter: Fayun Luo.
Jennifer Campbell November 30,  Problem Statement and Motivation  Analysis of previous work  Simple - competitive strategy  Near optimal deterministic.
Lev Finkelstein ISCA/Thermal Workshop 6/ Overview 1.Motivation (Kevin) 2.Thermal issues (Kevin) 3.Power modeling (David) 4.Thermal management (David)
CS 546: Intelligent Embedded Systems Gaurav S. Sukhatme Robotic Embedded Systems Lab Center for Robotics and Embedded Systems Computer Science Department.
Computer Science and Engineering Power-Performance Considerations of Parallel Computing on Chip Multiprocessors Jian Li and Jose F. Martinez ACM Transactions.
Determining Optimal Processor Speeds for Periodic Real-Time Tasks with Different Power Characteristics H. Aydın, R. Melhem, D. Mossé, P.M. Alvarez University.
CS203 – Advanced Computer Architecture
M V Ganeswara Rao Associate Professor Dept. of ECE Shri Vishnu Engineering College for Women Bhimavaram Hardware Architecture of Low-Power ALU using Clock.
MAHARANA PRATAP COLLEGE OF TECHNOLOGY SEMINAR ON- COMPUTER PROCESSOR SUBJECT CODE: CS-307 Branch-CSE Sem- 3 rd SUBMITTED TO SUBMITTED BY.
Industrial Automation Part I Real Time Control Embedded Systems.
Overview Motivation (Kevin) Thermal issues (Kevin)
Crusoe Processor Seminar Guide: By: - Prof. H. S. Kulkarni Ashish.
Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental
Green cloud computing 2 Cs 595 Lecture 15.
SECTIONS 1-7 By Astha Chawla
Multi-core processors
CSE 591: Energy-Efficient Computing Lecture 20 SPEED: disks
Multi-core processors
Intel Atom Architecture – Next Generation Computing
Cellular and Wireless Networks Power Management and Consumption
Flavius Gruian < >
Bluetooth Based Smart Sensor Network
Hui Chen, Shinan Wang and Weisong Shi Wayne State University
CS294-1 Reading Aug 28, 2003 Jaein Jeong
Authors: Ing-Ray Chen; Yating Wang Present by: Kaiqun Fu
Energy Efficient Scheduling in IoT Networks
Outline - Energy Management
Chih-Hsun Chou Daniel Wong Laxmi N. Bhuyan
Optimal Power-Down Strategies
Presentation transcript:

ENERGY-EFFICIENT ALGORITHMS INTRODUCTION TO DETERMINISTIC ONLINE POWER-DOWN ALGORITHMS Len Matsuyama CS 695

Introduction  Energy-Efficient Algorithms - Susanne Albers [Communications of the ACM, Vol. 53]  Energy consumption is critical for Cost and Availability  The article surveys Algorithmic solutions (as opposed to hardware/system design).

Projection of Significant Power Consumption Costs  If power consumption continues to grow, it can take over hardware costs by a large margin (Google).

Evidence of Significant Power Consumption Costs  Office environment: Computer and monitor energy consumption is significant.  2009: HSBC (deployed nightly power down software) Saved $1M energy costs, reduced CO2 emmissions by 3M kg.  Battery-Powered devices  Portable devices: Laptops, mobile phones  Autonomous distributed devices: Sensor networks  Heat dissipation  Wear, reduced reliability of components.

Overview  Power Down with Two States  A Deterministic Algorithm  Analysis of Deterministic Algorithm  Power Down with Multiple (>2) States  Lower Envelope Algorithm  Analysis of Lower Envelope  Dynamic Speed Scaling (Time Permitting)  YDS Algorithm  Average Rate Algorithm

Power Down with Two States - Setup  Consider a system with two power states: active and sleep. (e.g. computer monitor)  Let r be the power consumption rate in the active state. (Assume r=0 in sleep state)  Let B energy units be required to transition from the sleep state to the active state. (B > 0)  The system experiences an idle period T which is not known in advance (by definition of our online algorithm).

Power Down with Two States - OPT  If rT < B then remain in the active state  Otherwise transition to the sleep state at the beginning of T. And transition to the active state at the end of T.

Power Down with Two States – Online ALG-Det  In an idle period T, first remain in the active state.  After B/r time units if T has still not ended yet, transition to the sleep state.  Just like the ski rental problem where T is the number of days skiing, B is the cost of buying skis, and r is the rental fee per time unit (1 day of skiing).

Power Down with Two States – Online ALG-Det (cont’d)  Easy to see that ALG-Det is 2-competitive. Only need to consider the two cases:  If rT < B then ALG-Det consumes rT energy during T. (Same as OPT)  If rT >= B then ALG-Det consumes r * (B/r) = B energy during T, plus B for transitioning to the active state. So 2B units of energy. (B for OPT)

Power Down with Two States – Online ALG-Det (cont’d)  Verify that the best which any deterministic ALG can do is a competitive ratio of 2:  ALG transitions to sleep state in exactly t time units  Worst case would be T = t This would mean ALG was active for exactly the amount of time the system was idle.  Cost of ALG = rt + B  Cost of OPT = min{rt, B}  Clearly, competitive ratio is 2.

Power Down with Multiple States  Real World: Many modern devices have not only one but several low-power states.  E.g. Intel Core i7 Mobile Processor  Full OnProcessor executing code  Auto-HaltProcessor no longer executing code.  Deep SleepCores flush caches. Clocks shut off to each core.  Deep Power Down Cores save architectural state and removes core voltage.

Power Down with Multiple States  Referenced Paper: Irani, Shukla, Gupta - Online Strategies for dynamic power management in systems with multiple power-saving states. [ACM Trans. Embedded Computing Systems 2 (2003)

Power Down with Multiple States - Setup  Consider a deterministic system with K power states S1, …, SK. S1 being the active state and the rest being low-power states.  Each state Si has power consumption rate Ri  States are ordered such that R1 > … > RK  Each state will have a transition cost Bi when going back to the active state such that B1 <= … <= BK  Transition energies are assumed to be additive. Transition cost from state j to i is Bj – Bi where i < j.

Power Down with Multiple States - OPT  Observe that OPT will only change states at the beginning and end of the idle period T. (The state that it’s in consumes the least energy for idle period T).  We know for OPT that state Si is used for the entire T so total energy consumption is Ri*T + Bi  OPT simply chooses the state that minimizes the cost:  OPT(T) = min {Ri*T + Bi} where 1 <= i <= K

Power Down with Multiple States – Lower Envelope  Illustration of the optimum cost in a four-state system  Note: Point on line represents energy consumed during idle duration T for OPT.

Power Down with Multiple States – Lower Envelope  Let Sopt(t) be the state used by OPT in an idle period of total length t  Sopt(t) = Si for min {Ri*T + Bi} where 1 <= i <= K  Lower Envelope:  In an idle period, at any time t use state Sopt(t).

Power Down with Multiple States – Lower Envelope (cont’d)  How to calculate energy consumed by LowerEnvelope:  If t = t’ then energy consumed = e0 + e1 + e’ + B2

Lower Envelope Analysis – 2 Competitive  First, establish that the worst case is just after a transition time. ( t_j: time of transition to state j)  Consider (amount of time in idle state)  Where  Where there are k total states  LE:  OPT:  Ratio of above (LE/OPT) is maximized with

Lower Envelope Analysis (cont’d)  Now with we have:  Thus, it suffices to prove that:

Lower Envelope Analysis (cont’d)  In LE, each tl was chosen so that:  where tl is the solution to  We can substitute these values into:  (a0*t1 – a0*t0) + (a1*t2 – a1*t1) + (a2*t3 – a2*t2) + (a3*t4 – a3*t3)…  We have:

Lower Envelope Analysis (cont’d)  Collapsing the telescoping sum, we get:  Using the fact that B0 = 0, t0 = 0, and that alpha_j >= 0, t_j >= 0. The inequality holds. Q.E.D.

Take Away  The fundamentals of online power management algorithms are analogous to the ski rental problem  The basic model presented forms a foundation for more sophisticated power management algorithms.

Dynamic Speed Scaling  Consider n jobs J1, … Jn that have to be processed on a variable-speed processor.  Jobs are defined by:  Ri: release time (job is available for processing)  Di: Deadline  Wi: Processing Volume. (can be viewed as #CPU cycles necessary to finish the job)  If Ji is executed at constant speed s, it takes Wi/s time units to complete the job.

Dynamic Speed Scaling (cont’d)  Preemption of jobs is allowed  Goal: Construct a feasible schedule that minimizes total energy consumption.  Assumtions:  No upper bound on the maximum processor speed. (Hence there always exists a feasible schedule)  Continuous spectrum of speeds is available.

YDS  YDS Algorithm (Yao, Demers, Shenker)  First we consider the offline algorithm Define interval I = [t, t’] for which contains a set of a number of jobs Ji where their release and deadline times Ri, Di are within the interval. Define the density of I Δ I as the total work to be completed in I divided by the length of I.

YDS (cont’d)  Can also be thought of as the minimum average speed necessary to complete all jobs within the interval I.

YDS (cont’d)  YDS proceeds in a series of iterations.  In each iteration, a time interval I of maximum density ∆ I is identified and a corresponding partial schedule is constructed.  Once the interval I is identified, the jobs are scheduled according to Earliest Deadline First (EDF)  The scheduled jobs are then removed from the problem instance, and the partial schedule becomes part of the final ordering of the jobs

YDS (cont’d)  The final step of an iteration is to take into account those jobs that are not entirely in the interval I. But have either of their release or deadline times in the interval.

YDS (cont’d)  ALG:  Intially J:={J1, …, Jn}  While J Not Empty: Determine the interval I of maximum density. In I, process the jobs of SI at speed ∆ I according to EDF. Set J:=J\SI Update the release and deadline times of unscheduled jobs.

YDS Example  Lets say we have the following jobs Ji = (Ri, Di, Wi)  J1 = (0, 25, 9)  J2 = (3, 8, 7)  J3 = (5, 7, 4)  J4 = (13, 20, 4)  J5 = (15, 18, 3)

YDS Example (cont’d)  I1 = [5, 7]  ∆ I = 4/2 = 2  I1 = [3, 8]  ∆ I = (4+7)/5 = 2.2  I2 = [15, 18]  ∆ I = 3/3 = 1  I2 = [13, 20]  ∆ I = 7/7 = 1  I3 = [0, 25] (what remains)

YDS Example (cont’d)  I1 = [3, 8]  I2 = [13, 20]  I3 = [0, 25]

Average Rate (Online ALG)  At any time t, use speed of s(t):  Jobs are scheduled using EDF.  Yao et al. Comp Ratio Upper Bound:  2^( α -1) α ^ α for any α > 2  If a processor runs at speed s, then the required power is s^ α where α >1 is a constant.

Questions?