Review: From wireless sensor networks towards cyber physical systems
Pervasive and Mobile Computing
Group-Based memory deduplication for virtualized clouds
Euro-Par'11 Proceedings of the 2011 international conference on Parallel Processing - Volume 2
Inter-rack live migration of multiple virtual machines
Proceedings of the 6th international workshop on Virtualization Technologies in Distributed Computing Date
Remedy: network-aware steady state VM management for data centers
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
TopCluster: A hybrid cluster model to support dynamic deployment in Grid
Journal of Computer and System Sciences
Network-aware virtual machine consolidation for large data centers
NDM '13 Proceedings of the Third International Workshop on Network-Aware Data Management
On minimizing the resource consumption of cloud applications using process migrations
Journal of Parallel and Distributed Computing
Distributed Online Algorithms for the Agent Migration Problem in WSNs
Mobile Networks and Applications
Dynamic thread mapping of shared memory applications by exploiting cache coherence protocols
Journal of Parallel and Distributed Computing
Group-based memory oversubscription for virtualized clouds
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Virtualization is being widely used in large-scale computing environments, such as clouds, data centers, and grids, to provide application portability and facilitate resource multiplexing while retaining application isolation. In many existing virtualized platforms, it has been found that the network bandwidth often becomes the bottleneck resource, causing both high network contention and reduced performance for communication and data-intensive applications. In this paper, we present a decentralized affinity-aware migration technique that incorporates heterogeneity and dynamism in network topology and job communication patterns to allocate virtual machines on the available physical resources. Our technique monitors network affinity between pairs of VMs and uses a distributed bartering algorithm, coupled with migration, to dynamically adjust VM placement such that communication overhead is minimized. Our experimental results running the Intel MPI benchmark and a scientific application on a 7-node Xen cluster show that we can get up to 42% improvement in the runtime of the application over a no-migration technique, while achieving up to 85% reduction in network communication cost. In addition, our technique is able to adjust to dynamic variations in communication patterns and provides both good performance and low network contention with minimal overhead.