Cooperative and reactive scheduling in large‐scale virtualized platforms with DVMS. (25th June 2012)

• Record Type: Journal Article
• Authors: Quesnel, Flavien; Lèbre, Adrien; Südholt, Mario; Vaquero, Luis Miguel; Rodero‐Merino, Luis; Buyya, Rajkumar; Kolodziej, Joanna; Khan, Samee Ullah; Gelenbe, Erol; Talbi, El‐Ghazali
• Is Part Of: Concurrency and computation. Volume 25:Number 12(2013:Aug.)
• Page Start: 1643
• Page End: 1655
• Publication Date: 2012-06-25
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.2848
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main" id="cpe2848-abs-0001"> <title>SUMMARY</title> <p id="cpe2848-para-0001">One of the principal goals of cloud computing is the outsourcing of the hosting of data and applications, thus enabling a per‐usage model of computation. Data and applications may be packaged in virtual machines (VM), which are themselves hosted by nodes, that is, physical machines. Several frameworks have been designed to manage VMs on pools of physical machines; most of them, however, do not efficiently address a major objective of cloud providers: maximizing system utilization while ensuring the QoS. Several approaches promote virtualization capabilities to improve this trade‐off. However, the dynamic scheduling of a large number of VMs as part of a large distributed infrastructure is subject to important and hard scalability problems that become even worse when VM image transfers have to be managed. Consequently, most current frameworks schedule VMs statically using a centralized control strategy. In this article, we present <italic>distributed VM scheduler</italic>, a framework that enables VMs to be scheduled cooperatively and dynamically in large‐scale distributed systems. We describe, in particular, how several VM reconfigurations can be dynamically calculated in parallel and applied simultaneously. Reconfigurations are enabled by partitioning the system (i.e., nodes and VMs) on the fly. Partitions are created with a minimum of resources necessary to find a solution to the reconfiguration problem. Moreover, we propose an algorithm to handle deadlocks that may appear because of the partitioning policy. We have evaluated our prototype through simulations and compared our approach with a centralized one. The results show that our scheduler permits VMs to be reconfigured more efficiently: the time needed to manage thousands of VMs on hundreds of machines is typically reduced to a tenth or less. Copyright © 2012 John Wiley & Sons, Ltd.</p> </abstract>