Energy-Efficient Computing Strategies for Data Centers

Slide Note
Embed
Share

This lecture discusses energy-efficient computing strategies for data centers, focusing on sharing resources between distributed and local systems. It covers topics such as workload distribution, electricity prices, network variations, and goals of a data center in terms of performance and power efficiency. The approach of SOFTScale is introduced as a way to manage load spikes without spare servers or forecasting, ensuring performance while minimizing waste.


Uploaded on Sep 25, 2024 | 0 Views


Download Presentation

Please find below an Image/Link to download the presentation.

The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. Download presentation by click this link. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.

E N D

Presentation Transcript


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

  2. energy_routing paper

  3. # servers

  4. workload

  5. electricity prices

  6. network variations

  7. softscale paper

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

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

  10. Problem: Load spikes 2x Load x Time 10

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

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

  13. Closer look at data centers Scalable Always on Use caching tier to pick up theslack 13

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

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

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

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

  18. 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 18

Related


More Related Content