Scheduling highly available applications on cloud environments

Frîncu, ME ORCID: https://orcid.org/0000-0003-1034-8409, 2014. Scheduling highly available applications on cloud environments. Future Generation Computer Systems, 32, pp. 138-153. ISSN 0167-739X

Preview

Text 1393265_Frincu.pdf - Post-print Download (638kB) | Preview

Abstract

Cloud computing is becoming a popular solution for storing data and executing applications due to its on-demand pay-per-use policy that allows access to virtually unlimited resources. In this frame applications such as those oriented towards Web 2.0 begin to be migrated on cloud systems. Web 2.0 applications are usually composed of several components that run indefinitely and need to be available to end users throughout their execution life cycle. Their availability strongly depends on the number of resource failures and on the variation in user hit rate. These problems are usually solved through scaling. A scaled application can span its components on several nodes. Hence if one or more nodes fail it could become unavailable. Therefore we require a method of ensuring the application’s functionality despite the number of node failures. In this paper we propose to build highly available applications, i.e., systems with low downtimes, by taking advantage of the component based architecture and of the application scaling property. We present a solution to finding the optimal number of component types needed on nodes so that every type is present on every allocated node. Furthermore nodes cannot exceed a maximum threshold and the total running cost of the applications needs to be minimized. A sub-optimal solution is also given. Both solutions rely on genetic algorithms to achieve their goals. The efficiency of the sub-optimal algorithm is studied with respect to its success rate, i.e., probability of the schedule to provide highly available applications in case all but one node fail. Tests performed on the sub-optimal algorithm in terms of node load, closeness to the optimal solution and success rate prove the algorithm’s efficiency.

Item Type:	Journal article
Publication Title:	Future Generation Computer Systems
Creators:	Frîncu, M.E.
Publisher:	Elsevier BV
Date:	March 2014
Volume:	32
ISSN:	0167-739X
Identifiers:	Number Type 10.1016/j.future.2012.05.017 DOI S0167739X12001136 Publisher Item Identifier 1393265 Other
Divisions:	Schools > School of Science and Technology
Record created by:	Jill Tomkinson
Date Added:	09 Dec 2020 11:14
Last Modified:	31 May 2021 15:10
URI:	https://irep.ntu.ac.uk/id/eprint/41819

Actions (login required)

Edit View

Statistics

Views

Downloads