English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/173820
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


An efficient cloud scheduler design supporting preemptible instances

AuthorsLópez García, Álvaro ; Fernández-del-Castillo, Enol ; Campos, Isabel
KeywordsCloud computing
Preemptible instances
Spot instances
Resource allocation
Issue Date2019
CitationFuture Generation Computer Systems 95: 68-78 (2019)
AbstractMaximizing resource utilization by performing an efficient resource provisioning is a key factor for any cloud provider: commercial actors can maximize their revenues, whereas scientific and non-commercial providers can maximize their infrastructure utilization. Traditionally, batch systems have allowed data centers to fill their resources as much as possible by using backfilling and similar techniques. However, in an IaaS cloud, where virtual machines are supposed to live indefinitely, or at least as long as the user is able to pay for them, these policies are not easily implementable. In this work we present a new scheduling algorithm for IaaS providers that is able to support preemptible instances, that can be stopped by higher priority requests without introducing large modifications in the current cloud schedulers. This scheduler enables the implementation of new cloud usage and payment models that allow more efficient usage of the resources and potential new revenue sources for commercial providers. We also study the correctness and the performance overhead of the proposed scheduler against existing solutions.
Publisher version (URL)https://doi.org/10.1016/j.future.2018.12.057
Appears in Collections:(IFCA) Artículos
Files in This Item:
File Description SizeFormat 
efficinstan-post.pdf193,96 kBAdobe PDFThumbnail
Show full item record
Review this work

Related articles:

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.