Anshul Gandhi 347, CS building

Slides:



Advertisements
Similar presentations
CSE 691: Energy-Efficient Computing Lecture 20 review Anshul Gandhi 1307, CS building
Advertisements

Energy-efficient Virtual Machine Provision Algorithms for Cloud System Ching-Chi Lin Institute of Information Science, Academia Sinica Department of Computer.
Anshul Gandhi (Carnegie Mellon University) Varun Gupta (CMU), Mor Harchol-Balter (CMU) Michael Kozuch (Intel, Pittsburgh)
CSE 691: Energy-Efficient Computing Lecture 4 SCALING: stateless vs. stateful Anshul Gandhi 1307, CS building
Providing Performance Guarantees for Cloud Applications Anshul Gandhi IBM T. J. Watson Research Center Stony Brook University 1 Parijat Dube, Alexei Karve,
CSE 531: Performance Analysis of Systems Lecture 1: Intro and Logistics Anshul Gandhi 1307, CS building
DotSlash – A Web Hotspot Rescue System Weibin Zhao Henning Schulzrinne Department of Computer Science Columbia University June 11, 2004.
Datacenter Power State-of-the-Art Randy H. Katz University of California, Berkeley LoCal 0 th Retreat “Energy permits things to exist; information, to.
Load Adaptation: Options for Basic Services Vance Maverick ADAPT Bologna Feb. 13, 2003.
Proteus: Power Proportional Memory Cache Cluster in Data Centers Shen Li, Shiguang Wang, Fan Yang, Shaohan Hu, Fatemeh Saremi, Tarek Abdelzaher.
DotSlash: Providing Dynamic Scalability to Web Applications Weibin Zhao and Henning Schulzrinne Department of Computer Science, Columbia University More.
Power Management in Data Centers: Theory & Practice Mor Harchol-Balter Computer Science Dept Carnegie Mellon University 1 Anshul Gandhi, Sherwin Doroudi,
CSE 691: Energy-Efficient Computing Lecture 3 SLEEP: full-system Anshul Gandhi 1307, CS building
Power Management in Data Centers: Theory & Practice Mor Harchol-Balter Computer Science Dept Carnegie Mellon University 1 Anshul Gandhi, Sherwin Doroudi,
Energy Aware Network Operations Authors: Priya Mahadevan, Puneet Sharma, Sujata Banerjee, Parthasarathy Ranganathan HP Labs IEEE Global Internet Symposium.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Black-box and Gray-box Strategies for Virtual Machine Migration Timothy Wood, Prashant.
GreenHadoop: Leveraging Green Energy in Data-Processing Frameworks Íñigo Goiri, Kien Le, Thu D. Nguyen, Jordi Guitart, Jordi Torres, and Ricardo Bianchini.
Basic Computer Structure and Knowledge Project Work.
Continuous resource monitoring for self-predicting DBMS Dushyanth Narayanan 1 Eno Thereska 2 Anastassia Ailamaki 2 1 Microsoft Research-Cambridge, 2 Carnegie.
Introduction To Windows Azure Cloud
University of Michigan Electrical Engineering and Computer Science 1 Dynamic Acceleration of Multithreaded Program Critical Paths in Near-Threshold Systems.
1 Using Multiple Energy Gears in MPI Programs on a Power- Scalable Cluster Vincent W. Freeh, David K. Lowenthal, Feng Pan, and Nandani Kappiah Presented.
AUTHORS: STIJN POLFLIET ET. AL. BY: ALI NIKRAVESH Studying Hardware and Software Trade-Offs for a Real-Life Web 2.0 Workload.
CSE 691: Energy-Efficient Computing Lecture 6 SHARING: distributed vs. local Anshul Gandhi 1307, CS building
CSE 691: Energy-Efficient Computing Lecture 7 SMARTS: custom-made systems Anshul Gandhi 1307, CS building
Web Search Using Mobile Cores Presented by: Luwa Matthews 0.
A dynamic optimization model for power and performance management of virtualized clusters Vinicius Petrucci, Orlando Loques Univ. Federal Fluminense Niteroi,
Hyper Threading Technology. Introduction Hyper-threading is a technology developed by Intel Corporation for it’s Xeon processors with a 533 MHz system.
CSE 451: Operating Systems Autumn 2010 Module 25 Cloud Computing Ed Lazowska Allen Center 570.
Measuring the Capacity of a Web Server USENIX Sympo. on Internet Tech. and Sys. ‘ Koo-Min Ahn.
DynamicMR: A Dynamic Slot Allocation Optimization Framework for MapReduce Clusters Nanyang Technological University Shanjiang Tang, Bu-Sung Lee, Bingsheng.
Scalable and Coordinated Scheduling for Cloud-Scale computing
1 Adaptive Parallelism for Web Search Myeongjae Jeon Rice University In collaboration with Yuxiong He (MSR), Sameh Elnikety (MSR), Alan L. Cox (Rice),
Kingfisher: A System for Elastic Cost-aware Provisioning in the Cloud
CSE 591: Energy-Efficient Computing Lecture 3 SPEED: processor Anshul Gandhi 347, CS building
CSE 591: Energy-Efficient Computing Lecture 1: Intro and Logistics Anshul Gandhi 347, New CS building
CSE 591: Energy-Efficient Computing Lecture 4 SLEEP: full-system Anshul Gandhi 347, CS building
CSE 591: Energy-Efficient Computing Lecture 8 SOURCE: renewables Anshul Gandhi 347, CS building
Power Capping Via Forced Idleness ANSHUL GANDHI Carnegie Mellon Univ. 1.
A Hierarchical Edge Cloud Architecture for Mobile Computing IEEE INFOCOM 2016 Liang Tong, Yong Li and Wei Gao University of Tennessee – Knoxville 1.
CSE 591: Energy-Efficient Computing Lecture 13 SLEEP: sensors
Energy Aware Network Operations
Abhinav Kamra, Vishal Misra CS Department Columbia University
Chang Hyun Park, Taekyung Heo, and Jaehyuk Huh
Anshul Gandhi 347, CS building
Green cloud computing 2 Cs 595 Lecture 15.
CSE 591: Energy-Efficient Computing Lecture 17 SCALING: survey
Scaling the Memory Power Wall with DRAM-Aware Data Management
CSE 591: Energy-Efficient Computing Lecture 20 SPEED: disks
”The Ball” Radical Cloud Resource Consolidation
CSE 591: Energy-Efficient Computing Lecture 21 review
CSE 591: Energy-Efficient Computing Lecture 15 SCALING: storage
Frequency Governors for Cloud Database OLTP Workloads
CSE 591: Energy-Efficient Computing Lecture 10 SLEEP: network
Why Is There A Need For Green Data Center? Data Center Costs Are Rising.
CSE 591: Energy-Efficient Computing Lecture 19 SPEED: memory
HyperLoop: Group-Based NIC Offloading to Accelerate Replicated Transactions in Multi-tenant Storage Systems Daehyeok Kim Amirsaman Memaripour, Anirudh.
CSE 591: Energy-Efficient Computing Lecture 12 SLEEP: memory
Raymond'S Tree DMX Algorithm
CSE 591: Energy-Efficient Computing Lecture 14 SCALING: setup time
CSE 591: Energy-Efficient Computing Lecture 9 SLEEP: processor
Haishan Zhu, Mattan Erez
Zhen Xiao, Qi Chen, and Haipeng Luo May 2013
ElasticTree: Saving Energy in Data Center Networks
TimeTrader: Exploiting Latency Tail to Save Datacenter Energy for Online Search Balajee Vamanan, Hamza Bin Sohail, Jahangir Hasan, and T. N. Vijaykumar.
Energy Efficient Scheduling in IoT Networks
Cross-Layer Optimizations between Network and Compute in Online Services Balajee Vamanan.
CSE 531: Performance Analysis of Systems Lecture 4: DTMC
CSE 591: Energy-Efficient Computing Lecture 18 SPEED: power
Chih-Hsun Chou Daniel Wong Laxmi N. Bhuyan
Presentation transcript:

Anshul Gandhi 347, CS building anshul@cs.stonybrook.edu CSE 591: Energy-Efficient Computing Lecture 6 SHARING: distributed vs. local Anshul Gandhi 347, CS building anshul@cs.stonybrook.edu

energy_routing paper

# servers

workload Predictable

electricity prices Convert 70 $/MWh to 7 c/KWh

network variations DCC paper

softscale paper

Goals of a data center Performance Power Low response times Goal: T95 ≤ 500 ms 70% is wasted Goal: Minimize waste Load Time BUSY: 200 W IDLE: 140 W OFF: 0 W Intel Xeon server

Only if load changes slowly Scalable data centers Performance Power Only if load changes slowly Load Time Setup cost 300 s 200 W (+more) BUSY: 200 W IDLE: 140 W OFF: 0 W Intel Xeon server Reactive: [Leite’10;Horvath’08;Wang’08] Predictive: [Krioukov’10;Chen’08;Bobroff’07]

Problem: Load spikes Load Time x 2x

Prior work Dealing with load spikes Spare servers [Shen’11;Chandra’03] x Load Time 2x Dealing with load spikes Spare servers [Shen’11;Chandra’03] Over provisioning can be expensive Forecasting [Krioukov’10;Padala’09;Lasettre03] Spikes are often unpredictable Compromise on performance [Urgaonkar’08;Adya’04;Cherkasova’02] Admission control, request prioritization

Our approach: SOFTScale No spare servers No forecasting Does not compromise on performance (in most cases) x Load Time 2x Can be used in conjunction with prior approaches

Closer look at data centers Use caching tier to “pick up the slack” Scalable Always on Use caching tier to “pick up the slack”

Leverage spare capacity High-level idea SETUP ON OFF SETUP ON OFF SETUP ON OFF Dual purpose Load Time x 2x Leverage spare capacity

Experimental setup Response time: Time for entry to exit Apache Memcached (memory-bound) PHP (CPU-bound) Response time: Time for entry to exit Average response time: 200ms (with 20X variability) Goal: T95 ≤ 500ms

Experimental setup Apache Memcached (memory-bound) PHP 8-core CPU (CPU-bound) 8-core CPU 4 GB memory 4-core CPU 48 GB memory

Results: Instantaneous load jumps Time 61% 50% 10%  29% baseline = provisioned for initial load T95 (ms) averaged over 5 mins

Conclusion Problem: How to deal with load spikes? Prior work: Over provision, predict, compromise on performance Our (orthogonal) approach: SOFTScale Leverages spare capacity in “always on” data tiers Look at the whole system Can handle a range of load spikes