Which Cloud Auto-Scaler Should I Use for my Application?: Benchmarking Auto-Scaling Algorithms

Poster Paper

Conference Paper (2016)
Author(s)

Ahmed Ali-Eldin (Umeå University)

A.S. Ilyushkin (TU Delft - Data-Intensive Systems)

B.I. Ghit (TU Delft - Data-Intensive Systems)

Nikolas Herbst (University of Würzburg)

Alessandro Papadopoulos (Lund University)

A. Iosup (TU Delft - Data-Intensive Systems)

Research Group
Data-Intensive Systems
Copyright
© 2016 Ahmed Ali-Eldin, A.S. Ilyushkin, B.I. Ghit, Nikolas Herbst, Alessandro Papadopoulos, A. Iosup
DOI related publication
https://doi.org/10.1145/2851553.2858677
More Info
expand_more
Publication Year
2016
Language
English
Copyright
© 2016 Ahmed Ali-Eldin, A.S. Ilyushkin, B.I. Ghit, Nikolas Herbst, Alessandro Papadopoulos, A. Iosup
Research Group
Data-Intensive Systems
Pages (from-to)
131-132
ISBN (electronic)
978-1-4503-4080-9
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Rapid elasticity is one of the essential characteristics of cloud computing identified by NIST. Elasticity allows resources to be provisioned and released to scale rapidly out ward and in ward according to demand. Tens -- if not hundreds -- of algorithms have been proposed in the literature to automatically achieve elastic provisioning. These algorithms are typically referred to as elasticity algorithms, dynamic provisioning techniques or autoscalers. While trying to solve the same problem, sometimes with differing assumption, many of these algorithms are either compared to static provisioning or to a predefined QoS target, e.g., predefined response time target, with very little -- or no -- comparison to previously published work. This reduces the ability of an application owner or a cloud operator to choose and deploy a suitable algorithm from the literature. Many of these algorithms have been tested with one single -- real or synthetic -- workload in a specific use-case. While all published algorithms are shown to work in the specific use-case they were designed for with the, typically short, workloads tested with, it is seldom the case that the real scenarios will be any thing close to the test cases for which the algorithms are shown to work. Bursts occur in workloads occasionally. Workload dynamics change over time and the load-mix of an application significantly affects how provisioning should be done.

Files

Autoscaling_icpe16.pdf
(pdf | 0.615 Mb)
License info not available