A Case For Grid Computing On Virtual Machines
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Live migration of virtual machines
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
pMapper: power and migration cost aware application placement in virtualized systems
Proceedings of the 9th ACM/IFIP/USENIX International Conference on Middleware
Memory buddies: exploiting page sharing for smart colocation in virtualized data centers
Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments
Entropy: a consolidation manager for clusters
Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments
The impact of management operations on the virtualized datacenter
Proceedings of the 37th annual international symposium on Computer architecture
The impact of virtualization on network performance of amazon EC2 data center
INFOCOM'10 Proceedings of the 29th conference on Information communications
Guaranteeing High Availability Goals for Virtual Machine Placement
ICDCS '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems
Bin repacking scheduling in virtualized datacenters
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
An energy aware framework for virtual machine placement in cloud federated data centres
Proceedings of the 3rd International Conference on Future Energy Systems: Where Energy, Computing and Communication Meet
Hint-Based Execution of Workloads in Clouds with Nefeli
IEEE Transactions on Parallel and Distributed Systems
BtrPlace: A Flexible Consolidation Manager for Highly Available Applications
IEEE Transactions on Dependable and Secure Computing
Hi-index | 0.00 |
In a virtualized datacenter, the Service Level Agreement for an application restricts the Virtual Machines (VMs) placement. An algorithm is in charge of maintaining a placement compatible with the stated constraints. Conventionally, when a placement algorithm computes a schedule of actions to re-arrange the VMs, the constraints ignore the intermediate states of the datacenter to only restrict the resulting placement. This situation may lead to temporary violations of the constraints. In this paper, we discuss the causes of these violations. We then advocate for continuous placement constraints to restrict also the actions schedule. We discuss why their development requires more attention and how the extensible placement algorithm BtrPlace can address this issue.