Impact of Power-Management Granularity on The Energy-Quality Trade-off for Soft And Hard Real-Time Applications International Symposium on System-on-Chip,

Slides:



Advertisements
Similar presentations
Reducing Network Energy Consumption via Sleeping and Rate- Adaption Sergiu Nedevschi, Lucian Popa, Gianluca Iannaccone, Sylvia Ratnasamy, David Wetherall.
Advertisements

Energy Efficiency through Burstiness Athanasios E. Papathanasiou and Michael L. Scott University of Rochester, Computer Science Department Rochester, NY.
International Symposium on Low Power Electronics and Design Energy-Efficient Non-Minimal Path On-chip Interconnection Network for Heterogeneous Systems.
Evaluating an Adaptive Framework For Energy Management in Processor- In-Memory Chips Michael Huang, Jose Renau, Seung-Moon Yoo, Josep Torrellas.
1 MemScale: Active Low-Power Modes for Main Memory Qingyuan Deng, David Meisner*, Luiz Ramos, Thomas F. Wenisch*, and Ricardo Bianchini Rutgers University.
Content-aware and context-aware resource adaptation Juan Hamers – Faculteit Ingenieurswetenschappen – Vakgroep Elektronica en Informatiesystemen.
Soft Real-Time Semi-Partitioned Scheduling with Restricted Migrations on Uniform Heterogeneous Multiprocessors Kecheng Yang James H. Anderson Dept. of.
Towards Feasibility Region Calculus: An End-to-end Schedulability Analysis of Real- Time Multistage Execution William Hawkins and Tarek Abdelzaher Presented.
Green Governors: A Framework for Continuously Adaptive DVFS Vasileios Spiliopoulos, Stefanos Kaxiras Uppsala University, Sweden.
Preemptive Behavior Analysis and Improvement of Priority Scheduling Algorithms Xiaoying Wang Northeastern University China.
1 Soft Timers: Efficient Microsecond Software Timer Support For Network Processing Mohit Aron and Peter Druschel Rice University Presented By Jonathan.
1 Center for Embedded Systems Research (CESR) Department of Computer Science North Carolina State University Frank Mueller Timing Analysis: In Search of.
System-Wide Energy Minimization for Real-Time Tasks: Lower Bound and Approximation Xiliang Zhong and Cheng-Zhong Xu Dept. of Electrical & Computer Engg.
Adaptive Cache Compression for High-Performance Processors Alaa R. Alameldeen and David A.Wood Computer Sciences Department, University of Wisconsin- Madison.
Processor Frequency Setting for Energy Minimization of Streaming Multimedia Application by A. Acquaviva, L. Benini, and B. Riccò, in Proc. 9th Internation.
1 Quality of Experience Control Strategies for Scalable Video Processing Wim Verhaegh, Clemens Wüst, Reinder J. Bril, Christian Hentschel, Liesbeth Steffens.
ECE 510 Brendan Crowley Paper Review October 31, 2006.
Marco Paolieri RePP Workshop October 15 th 1 Efficient Execution of Mixed Application Workloads in a Hard Real-Time Multicore System Marco Paolieri (BSC/UPC)
Scheduling for Reduced CPU Energy M. Weiser, B. Welch, A. Demers, and S. Shenker.
Towards Eco-friendly Database Management Systems W. Lang, J. M. Patel (U Wisconsin), CIDR 2009 Shimin Chen Big Data Reading Group.
Exploring the Tradeoffs of Configurability and Heterogeneity in Multicore Embedded Systems + Also Affiliated with NSF Center for High- Performance Reconfigurable.
Soner Yaldiz, Alper Demir, Serdar Tasiran Koç University, Istanbul, Turkey Paolo Ienne, Yusuf Leblebici Swiss Federal Institute of Technology (EPFL), Lausanne,
Folklore Confirmed: Compiling for Speed = Compiling for Energy Tomofumi Yuki INRIA, Rennes Sanjay Rajopadhye Colorado State University 1.
VOLTAGE SCHEDULING HEURISTIC for REAL-TIME TASK GRAPHS D. Roychowdhury, I. Koren, C. M. Krishna University of Massachusetts, Amherst Y.-H. Lee Arizona.
Roza Ghamari Bogazici University.  Current trends in transistor size, voltage, and clock frequency, future microprocessors will become increasingly susceptible.
Low Contention Mapping of RT Tasks onto a TilePro 64 Core Processor 1 Background Introduction = why 2 Goal 3 What 4 How 5 Experimental Result 6 Advantage.
ParaScale : Exploiting Parametric Timing Analysis for Real-Time Schedulers and Dynamic Voltage Scaling Sibin Mohan 1 Frank Mueller 1,William Hawkins 2,
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.
Window-Based Greedy Contention Management for Transactional Memory Gokarna Sharma (LSU) Brett Estrade (Univ. of Houston) Costas Busch (LSU) 1DISC 2010.
Low-Power Wireless Sensor Networks
Integrating Fine-Grained Application Adaptation with Global Adaptation for Saving Energy Vibhore Vardhan, Daniel G. Sachs, Wanghong Yuan, Albert F. Harris,
Computer Science Department University of Pittsburgh 1 Evaluating a DVS Scheme for Real-Time Embedded Systems Ruibin Xu, Daniel Mossé and Rami Melhem.
Energy-Efficient Soft Real-Time CPU Scheduling for Mobile Multimedia Systems Wanghong Yuan, Klara Nahrstedt Department of Computer Science University of.
1 Single-ISA Heterogeneous Multi-Core Architectures: The Potential for Processor Power Reduction Rakesh Kumar, Keith I. Farkas, Norman P. Jouppi, Parthasarathy.
Thread Criticality Predictors for Dynamic Performance, Power, and Resource Management in Chip Multiprocessors Abhishek Bhattacharjee and Margaret Martonosi.
« Performance of Compressed Inverted List Caching in Search Engines » Proceedings of the International World Wide Web Conference Commitee, Beijing 2008)
Critical Power Slope Understanding the Runtime Effects of Frequency Scaling Akihiko Miyoshi, Charles Lefurgy, Eric Van Hensbergen Ram Rajamony Raj Rajkumar.
Probabilistic Preemption Control using Frequency Scaling for Sporadic Real-time Tasks Abhilash Thekkilakattil, Radu Dobrin and Sasikumar Punnekkat.
1 Distributed Energy-Efficient Scheduling for Data-Intensive Applications with Deadline Constraints on Data Grids Cong Liu and Xiao Qin Auburn University.
A Mixed Time-Criticality SDRAM Controller MeAOW Sven Goossens, Benny Akesson, Kees Goossens COBRA – CA104 NEST.
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.
1 Tuning Garbage Collection in an Embedded Java Environment G. Chen, R. Shetty, M. Kandemir, N. Vijaykrishnan, M. J. Irwin Microsystems Design Lab The.
Scheduling Periodic Real-Time Tasks with Heterogeneous Reward Requirements I-Hong Hou and P.R. Kumar 1 Presenter: Qixin Wang.
Managing Server Energy and Operational Costs Chen, Das, Qin, Sivasubramaniam, Wang, Gautam (Penn State) Sigmetrics 2005.
Object-Oriented Design and Implementation of the OE-Scheduler in Real-time Environments Ilhyun Lee Cherry K. Owen Haesun K. Lee The University of Texas.
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.
Image Compression Based On BTC-DPCM And It ’ s Data-Driven Parallel Implementation Author : Xiaoyan Yu 、 Iwata, M. Source : Image Processing, ICIP.
Critical Power Slope: Understanding the Runtime Effects of Frequency Scaling Akihiko Miyoshi †,Charles Lefurgy ‡, Eric Van Hensbergen ‡, Ram Rajamony ‡,
Outline Models Design of experiments Current Scheduler Completely Fair Scheduler(CFS) ◦ Since Linux ◦ /kernel/sched.c ◦ Maintain balance (fairness)
Multimedia Computing and Networking Jan Reduced Energy Decoding of MPEG Streams Malena Mesarina, HP Labs/UCLA CS Dept Yoshio Turner, HP Labs.
Workload Clustering for Increasing Energy Savings on Embedded MPSoCs S. H. K. Narayanan, O. Ozturk, M. Kandemir, M. Karakoy.
Ensieea Rizwani An energy-efficient management mechanism for large-scale server clusters By: Zhenghua Xue, Dong, Ma, Fan, Mei 1.
CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems Energy-aware QoS packet scheduling.
Optimality and Improvement of Dynamic Voltage Scaling Algorithms for Multimedia Applications Authors: Zhen Cao, Brian Foo, Lei He and Mihaela van der Schaar.
E-MOS: Efficient Energy Management Policies in Operating 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.
The CRISP Performance Model for Dynamic Voltage and Frequency Scaling in a GPGPU Rajib Nath, Dean Tullsen 1 Micro 2015.
Unified Adaptivity Optimization of Clock and Logic Signals Shiyan Hu and Jiang Hu Dept of Electrical and Computer Engineering Texas A&M University.
Real-Time Soft Shadows with Adaptive Light Source Sampling
Flavius Gruian < >
Haishan Zhu, Mattan Erez
Elastic Task Model For Adaptive Rate Control
Dynamic Voltage Scaling
Virtual-Time Round-Robin: An O(1) Proportional Share Scheduler
Progress Report 2013/08/08.
Research Topics Embedded, Real-time, Sensor Systems Frank Mueller moss
Presentation transcript:

Impact of Power-Management Granularity on The Energy-Quality Trade-off for Soft And Hard Real-Time Applications International Symposium on System-on-Chip, 2008 A. Milutinovic, K. Goossens, and G.J.M. Smit Advisor: Shiann-Rong Kuang Speaker: Hao-Yi Jheng ( 鄭浩逸 )

Outline  Introduction  Application model  Work and slack  Policy Conservativeness and Granularity  Experimental Results  Conclusions 2

Application model 3  In this paper they evaluate two power-management policies for a number of different granularities on an MPEG4 application, on energy and quality (deadline misses).  Granularity (N) : frequency of operating point changes  Hard real-time applications  Don’t allow any frame miss deadline  Use conservative power-management  Soft real-time applications  Allow a limited number of frame miss deadline  Use non-conservative power-management

Work and slack 4  Work : the number of processor cycles  Relative deadline :  Relative deadline miss means this frame over deadline  Relative slack (r) :  Absolute deadline :  Absolute deadline miss means that the accumulative execution time frame 0 to i is over the total deadline  Absolute slack(s) :

Outline 5  Introduction  Application model  Work and slack  Policy Conservativeness and Granularity  Experimental Results  Conclusions

Conservative Policy  Conservative power-management policy :  Does not introduce any deadline misses compared to operating at.  Non-conservative power-management policy :  Some frames maybe miss it’s deadline. 6

Policy 7  Perfect predictor policy (non-conservative) :  Accurately predicts the next N frames workload and scaled the average frequency for those frame   Proven slack policy (conservative) :  Proven slack : the cumulative slack of the frames before it  Assume that the next N frames all require the worst-case work, but use all the proven slack of previous group to reduce the frequency of the processor 

Outline 8  Introduction  Application model  Work and slack  Policy Conservativeness and Granularity  Experimental Results  Conclusions

Experimental Results (1/5)  An MPEG4 decoder running on an ARM946 at 86 MHz  25 frames per second (fps), and a resolution of 176*144 pixel 9

Experimental Results (2/5)  Energy savings w.r.t. operating at are around 30% for frames  2% cost for the power management  Above 128 frames the proven-slack policy energy linearly raise 10

Experimental Results (3/5) 11  The proven-slack policy cannot always exploit the accumulated slack Average slack : Worst-case slack :

Experimental Results (4/5) 12  Perfect predictor policy :  95% quality improvement costs only 3% additional energy  Optimum is mJ

Experimental Results (5/5) 13  Many frames can be processed in the range of MHz.

Outline 14  Introduction  Application model  Work and slack  Policy Conservativeness and Granularity  Experimental Results  Conclusions

Conclusions A long tail in the work distribution results in a steep quality improvement : from almost 0% to almost 100% at an additional energy cost of only 3%. 2. The proven-slack policy offers 100% quality at only 0.3% more energy than the perfect-predictor policy, which is theoretical upper bound and hard to achieve in practice. 3. The energy of the policies increases by only 2% when increasing the granularity to 128 frames.

Conclusions  Non-conservation  Conservation  Tardiness  (sum of frame delay time / frame number)/deadline 16

Comparison 17

Progress report 18 Advisor: Shiann-Rong Kuang Speaker: Hao-Yi Jheng

Outline  Adaptive Inter-compensation  How to choose voltage/frequency level  Adaptive  Experimental Result  Future Work 19

How to choose voltage/frequency level

Why need inter-compensation 21

Inter-compensation  PID  Adaptive inter-compensation  If (previous frame predictive cycle number is more  cycles)  current frame predictive voltage level decreases one  else  current frame predictive voltage doesn’t change  If( )   = 2000  else   =

Inter-compensation 23

Experimental Result 24 Energy(e+08)No-inter adaptive API_ API_ API_ API_ API_ API_ FRVNo-inter adaptive API_ API_ API_ API_ API_ API_

Future Work  We need Hardware GM and RM cycle numbers to verify the experimental Result  Driver is needed to support the GM and RM dump cycle number for prediction 25