Adaptive Power Shifting in Server Systems Ming Chen Xue Li.

Slides:



Advertisements
Similar presentations
On Scheduling Vehicle-Roadside Data Access Yang Zhang Jing Zhao and Guohong Cao The Pennsylvania State University.
Advertisements

Reducing Energy Consumption of Disk Storage Using Power Aware Cache Management Qingbo Zhu, Francis M. David, Christo F. Deveraj, Zhenmin Li, Yuanyuan Zhou.
QoS Aware Scheduling in a Cluster-Based Web Server Jiani Guo Architecture Lab Department of Computer Science and Engineering University of California,
Adaptive QoS Control Based on Benefit Optimization for Video Servers Providing Differential Services Ing-Ray Chen, Sheng-Yun Li, I-Ling Yen Presented by.
Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou Susmit Biswas, Heba Saadeldeen,
Operating Systems Chapter 6
1 Threshold-Based Multicast for Continuous Media Delivery Lixin Gao, Member, IEEE, and Don Towsley, Fellow, IEEE IEEE TRANSACTION ON MULTIMEDIA.
Chapter 6: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Feb 2, 2005 Chapter 6: CPU Scheduling Basic.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
System-Wide Energy Minimization for Real-Time Tasks: Lower Bound and Approximation Xiliang Zhong and Cheng-Zhong Xu Dept. of Electrical & Computer Engg.
Proteus: Power Proportional Memory Cache Cluster in Data Centers Shen Li, Shiguang Wang, Fan Yang, Shaohan Hu, Fatemeh Saremi, Tarek Abdelzaher.
UNIVERSITY OF ELECTRONIC SCIENCE & TECHNOLOGY OF CHINA IEEE INFOCOM 2015, Hong Kong RAPIER: Integrating Routing and Scheduling for Coflow-aware Data Center.
Chapter 8 Main Memory Bernard Chen Spring Objectives To provide a detailed description of various ways of organizing memory hardware To discuss.
Power Management for Memory Systems Ming Chen Nov. 10 th, 2009 ECE 692 Topic Presentation 1.
Dynamic and Decentralized Approaches for Optimal Allocation of Multiple Resources in Virtualized Data Centers Wei Chen, Samuel Hargrove, Heh Miao, Liang.
Bargaining Towards Maximized Resource Utilization in Video Streaming Datacenters Yuan Feng 1, Baochun Li 1, and Bo Li 2 1 Department of Electrical and.
Silberschatz, Galvin, and Gagne  Applied Operating System Concepts Module 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
OPTIMAL SERVER PROVISIONING AND FREQUENCY ADJUSTMENT IN SERVER CLUSTERS Presented by: Xinying Zheng 09/13/ XINYING ZHENG, YU CAI MICHIGAN TECHNOLOGICAL.
Power Control for Data Centers Ming Chen Oct. 8 th, 2009 ECE 692 Topic Presentation.
1 Server-level Power Control Ming Chen. 2 Motivations(1) Clusters of hundreds, even thousands of servers; Occupy one room of a building or even a whole.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
임규찬. 1. Abstract 2. Introduction 3. Design Goals 4. Sample-Based Scheduling for Parallel Jobs 5. Implements.
On Energy-Efficient Trap Coverage in Wireless Sensor Networks Junkun Li, Jiming Chen, Shibo He, Tian He, Yu Gu, Youxian Sun Zhejiang University, China.
Silberschatz and Galvin  Operating System Concepts Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor.
Joint Power Optimization Through VM Placement and Flow Scheduling in Data Centers DAWEI LI, JIE WU (TEMPLE UNIVERISTY) ZHIYONG LIU, AND FA ZHANG (CHINESE.
Towards Dynamic Green-Sizing for Database Servers Mustafa Korkmaz, Alexey Karyakin, Martin Karsten, Kenneth Salem University of Waterloo.
Managing Server Energy and Operational Costs Chen, Das, Qin, Sivasubramaniam, Wang, Gautam (Penn State) Sigmetrics 2005.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
Optimal Power Allocation for Multiprogrammed Workloads on Single-chip Heterogeneous Processors Euijin Kwon 1,2 Jae Young Jang 2 Jae W. Lee 2 Nam Sung Kim.
Dynamic Voltage Frequency Scaling for Multi-tasking Systems Using Online Learning Gaurav DhimanTajana Simunic Rosing Department of Computer Science and.
1 11/29/2015 Chapter 6: CPU Scheduling l Basic Concepts l Scheduling Criteria l Scheduling Algorithms l Multiple-Processor Scheduling l Real-Time Scheduling.
An Energy-efficient Task Scheduler for Multi-core Platforms with per-core DVFS Based on Task Characteristics Ching-Chi Lin Institute of Information Science,
L. Bertazzi, B. Golden, and X. Wang Route 2014 Denmark June
Chapter 5: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Feb 2, 2005 Chapter 5: CPU Scheduling Basic.
Algorithms for Resource Allocation in HetNet Jianwei Liu Clemson University.
Storing and Serving Multimedia. What is a Media Server? A scalable storage manager Allocates multimedia data optimally among disk resources Performs memory.
Data Scheduling for Multi-item and transactional Requests in On-demand Broadcast Nitin Pabhu Vijay Kumar MDM 2005.
Silberschatz and Galvin  Operating System Concepts Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor.
1 CS.217 Operating System By Ajarn..Sutapart Sappajak,METC,MSIT Chapter 5 CPU Scheduling Slide 1 Chapter 5 CPU Scheduling.
Power Partitioning for Multiprocessors Kai Ma, Amiri-Kamalabad Mojtaba.
Ensieea Rizwani An energy-efficient management mechanism for large-scale server clusters By: Zhenghua Xue, Dong, Ma, Fan, Mei 1.
CSE 591: Energy-Efficient Computing Lecture 3 SPEED: processor Anshul Gandhi 347, CS building
Power Capping Via Forced Idleness ANSHUL GANDHI Carnegie Mellon Univ. 1.
Presented by Qifan Pu With many slides from Ali’s NSDI talk Ali Ghodsi, Matei Zaharia, Benjamin Hindman, Andy Konwinski, Scott Shenker, Ion Stoica.
Architecture for Resource Allocation Services Supporting Interactive Remote Desktop Sessions in Utility Grids Vanish Talwar, HP Labs Bikash Agarwalla,
Coordinated Performance and Power Management Yefu Wang.
CPU Scheduling G.Anuradha Reference : Galvin. CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time.
Basic Concepts Maximum CPU utilization obtained with multiprogramming
CPU SCHEDULING.
Cloud-Assisted VR.
H.264/SVC Video Transmission Over P2P Networks
Cloud-Assisted VR.
Chapter 6: CPU Scheduling
Xia Zhao*, Zhiying Wang+, Lieven Eeckhout*
ICS 143 Principles of Operating Systems
CPU Scheduling G.Anuradha
Module 5: CPU Scheduling
Multi-hop Coflow Routing and Scheduling in Data Centers
Pricing Model In Cloud Computing
3: CPU Scheduling Basic Concepts Scheduling Criteria
Chapter5: CPU Scheduling
Qingbo Zhu, Asim Shankar and Yuanyuan Zhou
Chapter 6: CPU Scheduling
Chapter 6: CPU Scheduling
Module 5: CPU Scheduling
CPU Scheduling: Basic Concepts
Chapter 6: CPU Scheduling
CPU Scheduling.
Module 5: CPU Scheduling
Chapter 5: CPU Scheduling
Presentation transcript:

Adaptive Power Shifting in Server Systems Ming Chen Xue Li

Introduction  Power is one of the most important resources in data centers.  CPU and main memory are two of the largest power gluttons. 85.4% 92.2% CPU & memCPU : mem

Motivation  Power is a limited and precious resource for a server.  CPU is NEITHER the only, NOR the largest consumer.  Power needs to be controlled within a budget.  Workload is varying in data centers.  Over-provisioning may cause unnecessary cost.  Power needs to be optimally allocated among server components, i.e., CPU and main memory. Goal: 1. Power control in the server-level. 2. Optimized allocation between CPU and main memory.

State of The Art  Power control for CPU [Wang] in ISCA’09, main memory [Diniz] in ISCA’07 − Single component;  Power control for servers [Lefurgy] in ICAC’07 − Assuming CPU is the major consumer  Power shifting in server-level [Felter] in ICS’05 − Power is not controlled at the budget. − Performance is not optimal.  Power control for racks [Wang] in HPCA’08, data centers [Wang] in PACT’09 − Complimentary to that work − Compose a complete power management scheme for data centers.

Who is Waiting? CPU mem CPU mem CPU mem CPU mem CPU mem CPU mem CPU is waiting.Memory is waiting.Coordinated.  CPU: DVFS  Memory: active memory size -> bandwidth

 CPU-intensive workload  Power should be shifted to CPU as much as possible.  f opt = f max  Memory-intensive workload  Power should be shifted to memory as much as possible.  f opt = f min  Memory-intensive workload.  f opt = ? What is the optimal allocation? For any piece of codes, it belongs to one of the following cases:

Proposed Solution − Ratio of the two weights: Memory Access Rate (MAR) − Optimization Weights the # of dispatched instructions in each control period the # of memory access requests in each control period  Intuition − The more the # of activities is, the more power is required.  Problems − MAR can guarantee the optimal allocation? − The weight ratio should be a function of MAR?  Solution: − Power is controlled at the budget.

Schedules  Idea verification (by the end of Sept) − Simulators integration; −Preliminary experiments to show the idea works;  Controller design and tuning (by Oct 20) − Refinement of the idea − Refinement of sleeping scheme − Experiment plan  Experiments and paper writing (until middle of Nov)