UNIVERSITY OF NIVERSITY OF M ASSACHUSETTS ASSACHUSETTS , A , A MHERST • MHERST • Department of Computer Science Department of Computer Science Black-box and Gray-box Strategies for Virtual Machine Migration Timothy Wood, Prashant Shenoy, Arun Venkataramani, and Mazin Yousif * University of Massachusetts Amherst * Intel, Portland
27
Embed
Black-box and Gray-box Strategies for Virtual Machine Migration
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
UUNIVERSITY OF NIVERSITY OF MMASSACHUSETTSASSACHUSETTS, A, AMHERST • MHERST • Department of Computer Science Department of Computer Science
Black-box and Gray-box Strategies for Virtual Machine Migration
Timothy Wood, Prashant Shenoy, Arun Venkataramani, and Mazin Yousif*
University of Massachusetts Amherst*Intel, Portland
Enterprise Data Centers
Data Centers are composed of:Large clusters of serversNetwork attached storage devices
Multiple applications per serverShared hosting environmentMulti-tier, may span multiple servers
Allocates resources to meet Service Level Agreements (SLAs)
Virtualization increasingly common
Benefits of Virtualization
Run multiple applications on one serverEach application runs in its own virtual machine
Virtual machine runs SpecJBB benchmarkMemory utilization increases over time
Black-box increases by 32MB if page-swapping observedGray-box maintains 32 MB free
Significantly reduces page-swapping
256
306
356
406
456
506
556
606
656
706
756
0 200 400 600 800 1000 1200 1400
Time (sec)
RA
M (
MB
)
Black-box
Gray-box
Gray-box can improve application
performance by proactively increasing allocation
Data Center Prototype16 server cluster runs realistic data center applications on 35 virtual machines6 servers (14 VMs) become simultaneously overloaded
4 CPU hotspots and 2 network hotspots
Sandpiper eliminates all hotspots in four minutes Uses 7 migrations and 2 swapsDespite migration overhead, VMs see fewer periods of overload
0
2
4
6
8
10
12
1 11 21 31 41 51
Time
# o
f H
ots
po
ts
Static
Sandpiper
0
20
40
60
80
100
120
140
160
180
Overloaded Sustained
Tim
e (i
nte
rval
s)
Static
Sandpiper
Related Work
Menasce and Bennani 2006Single server resource management
VIOLIN and VirtuosoUse virtualization for dynamic resource control in grid computing environments
ShirakoMigration used to meet resource policies determined by application owners
VMware Distributed Resource SchedulerAutomatically migrates VMs to ensure they receive their resource quota
Summary
Virtual Machine migration is a viable tool for dynamic data center provisioning
Sandpiper can rapidly detect and eliminate hotspots while treating each VM as a black-box
Gray-Box information can improve performance in some scenarios
Proactive memory allocations
Future workImproved black-box memory monitoringSupport for replicated services
Thank you
http://lass.cs.umass.edu
Stability During Overload
Predict future usage Will not migrate if destination could become overloaded
Each set of migrations must eliminate a hotspotAlgorithm only performs bounded number of migrations
0
0.05
0.1
0.15
0.2
0.25
0.3
0.35
0.4
0.45
0 50 100 150 200 250 300
Time (sec)
Uti
liza
tio
n
PM1
PM2
Measured Predicted
Sandpiper Overhead
CPU/mem same as monitoring tools (1%)Network bandwidth negligiblePlacement algorithm completes in less than 10 seconds for up to 750 VMs
Can distribute computation if necessary
Gray v. Black - Apache
Load spikes on 2 web servers cause CPU saturation
Black-box underestimates each VM’s requirement Does not know how much more to allocateRequires 3 sequential migrations to resolve hotspot
Gray-box correctly judges resource requirements by using application logs
Initiates 2 migrations in parallelEliminates hotspot 60% faster