Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou...
-
Upload
coral-mccoy -
Category
Documents
-
view
216 -
download
1
Transcript of Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou...
![Page 1: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/1.jpg)
Power-aware Resource Allocation for Cpu- and Memory Intense
Internet ServicesVlasia Anagnostopoulou ([email protected]),
Susmit Biswas, Heba Saadeldeen, Ricardo Bianchini, Tao Yang, Diana Franklin, Frederic T. Chong
University of California, Santa Barbara
First E2DC Workshop08/05/2012
![Page 2: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/2.jpg)
Cpu- and Memory Intense Internet-Services
MapReduce, Hadoop,…
• Latency-bound• Intense
computation (=>high cpu utilization)
• Petascale data
![Page 3: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/3.jpg)
Datacenter clusters
![Page 4: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/4.jpg)
Datacenter cluster operation
![Page 5: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/5.jpg)
Challenges• Standard middleware algorithms are inefficient
for cpu- and memory-intense internet services• Resource allocation operates at a fine-
granularity– But is oblivious of the SLA
• Power management is SLA-aware– But is only driven by the CPU– Coarse-grained
• Request distribution does not operate at a resource granularity
![Page 6: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/6.jpg)
Overview of solution
• SLA-aware and fine-grained• Two steps:– Configure states of servers (basic power-aware resource
allocation)– Allocate resources to servers (cpu and memory)
Resource Allocation
Power Management
Request distribution
Power-aware Resource Allocation for cpu and memory
Adjusted Request distribution
Standard Middleware Optimized Middleware
![Page 7: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/7.jpg)
Contents
• Introduction• Power-aware Resource Allocation– Basic– With Support for Multiple Applications– Adjusted Request Distribution
• Methodology• Experiments• Conclusion
![Page 8: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/8.jpg)
Basic Power-aware Resource Allocation
• Configure server states: – Active, off, low-power state
• Problem of memory being inaccessible– Internet-services have high memory demand (for
caching)• Solution: use a memory-active, low-power
state (barely-alive)– Memory is on– Server is not operational, but memory can be
remotely accessed– Memory contributes to global cache
![Page 9: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/9.jpg)
Details of Barely-alive state
![Page 10: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/10.jpg)
Basic Power-aware Resource Allocation
• Calculations:• Active servers to service load– N_cpu_act = Load_demand / Cpu_capacity
• Memory-active servers to satisfy memory demand– Active or barely-alive– N_mem_act = Memory_demand/ Mem_capacity
• Configure to maximize energy savings, or to maximize memory allocation
![Page 11: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/11.jpg)
Example• N=5 servers• Cpu-capacity = 1,000 conn.• Mem-capacity = 1GB• Load = 3,000 conn.• Target mem-alloc = 4GB• Maximize energy-savings:
• Maximize memory alloc.:• Mem. usage: 0.8GB/server
• How to control the memory allocation?
![Page 12: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/12.jpg)
Memory Allocation for SLA• Two objectives:• 1) Allocate memory for SLA• 2) Share memory among services with SLA
guarantees– Must be fair; accept priority– Guarantee minimum performance
• Characteristics:• Uniform allocation per server (to avoid
imbalance)• Memory performance monitoring capability
which is SLA-aware
![Page 13: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/13.jpg)
Memory allocation for SLA
• Utilize stack algorithm [Mattson]– Measures contribution of memory
size to the hit-rate– Hit-rate is used as proxy of
performance• Server-level: Calculate alloc for
target-hit-rate– Attach SLA mapping
• Cluster-level: calculate avg size for target hit-rate
• How to allocate memory when constrained?
Size Hits Hit-ratio
1 6/9 66.7%
2 1/9 77.8%
3 0/9 77.8%
Server Size
1 22 2… …5 2
Avg: 2
SLA
#3
#2
#2
![Page 14: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/14.jpg)
SLA/Memory Sharing• Aggregate metric of performance
– sum of allocations which yield performance closest to SLA• Linear optimization problem to maximize aggregate
performance: • at each step, allocate memory s.t. to minimize aggregate
performance• subject to memory capacity constraint• guarantee min SLA for each app
Size Hit-ratio
SLA
1 66.7% #3
2 77.8% #2
3 77.8% #2
{app1, app2} => Target SLA {#2, #2}
dist_to_SLA_alloc = ∞ dist_to_SLA_alloc = ∞
dist_to_SLA_alloc = 1 dist_to_SLA_alloc = 1
dist_to_SLA_alloc = 0 dist_to_SLA_alloc = 0
![Page 15: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/15.jpg)
Request Distribution
Processing…
![Page 16: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/16.jpg)
Adjusted Request Distribution
Processing…
![Page 17: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/17.jpg)
Contents
• Introduction• Power-aware Resource Allocation– Basic– With Support for Multiple Applications– Adjusted Request Distribution
• Methodology– Simulator– Traces
• Experiments• Conclusion
![Page 18: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/18.jpg)
Methodology• Datacenter-cluster simulator:– 1 rack– trace-based functional simulator
• Simulate all standard and proposed middleware algorithms
• Traces:– Internet-search “snippet”
generator
![Page 19: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/19.jpg)
Contents
• Introduction• Power-aware Resource Allocation
– Basic– With Support for Multiple Applications– Adjusted Request Distribution
• Methodology– Simulator– Traces
• Experiments– Basic Algorithm– Shared Cluster
• Conclusion
![Page 20: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/20.jpg)
Experiments – Basic Algorithm• Evaluate various configuration objectives:
• Barely-alive: maximize memory allocation; Mixed: maximize energy savings
• Fix SLA, evaluate energy savings only. Also, evaluate residual memory.
• SLA #1, #2, #3: Response time degradation 1-2%, 2-3%, 3-4%
• Aggressiveness of consolidation: 50, 70, 85%
System Active Off Barely-alive
Baseline Y N NOn/Off Y Y N
BA Y N YMixed Y Y Y
![Page 21: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/21.jpg)
Results – basic algorithm
• Mixed system has highest energy savings; up to 42% (24% over On/Off)
• BA: up to 34% (20% over On/Off)
![Page 22: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/22.jpg)
Results – basic algorithm
• Mixed system is most stable• In barely-alive system savings depend on the SLA level;
can push the parameter for savings aggressiveness• On/off system savings are influenced by both
parameters. Degrade significantly at high SLA levels
![Page 23: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/23.jpg)
Results - Basic algorithm• BA: up to extra 7.5GB memory: allocate to
another application, transition to low-power etc
![Page 24: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/24.jpg)
Results – Cluster Sharing
![Page 25: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/25.jpg)
Results – Cluster sharing
![Page 26: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/26.jpg)
Contents
• Introduction• Power-aware Resource Allocation
– Basic– With Support for Multiple Applications– Adjusted Request Distribution
• Methodology– Simulator– Traces
• Experiments– Basic Algorithm– Shared Cluster
• Conclusion
![Page 27: Power-aware Resource Allocation for Cpu- and Memory Intense Internet Services Vlasia Anagnostopoulou (vlasia@cs.ucsb.edu), Susmit Biswas, Heba Saadeldeen,](https://reader035.fdocuments.us/reader035/viewer/2022062714/56649cff5503460f949d0d71/html5/thumbnails/27.jpg)
Conclusion• Combine power management and resource
allocation => power-aware resource allocation• SLA-driven, fine grained management of
datacenter clusters– Performance guarantees + energy savings
• Flexibility to different optimizations for datacenter scenarios
• Achieve deep energy savings or potential for more memory utility out of cluster
• Holistic design of middleware software