Availability modelling and assurance for a big data computing Online publication date: Tue, 09-Apr-2019
by Zuqiang Ke; Nohpill Park
International Journal of Big Data Intelligence (IJBDI), Vol. 6, No. 2, 2019
Abstract: This paper proposes a new analytical model to evaluate the availability of a big data computing, namely, map-reduce computing on a Hadoop platform. Map-reduce computing is represented by a queueing model in this work in order to trace flow of tasks (either map or reduce) of their arrivals and exits in the course of computation. The objective of the model is to evaluate the probability for a map-reduce computation to be available at an instance of time, referred to as availability. The set of variables taken into account in this model lists the number of map and reduce tasks, the number of servers (or referred to as nodes in this paper) engaged, along with a few constants such as task arrival/exit rates and node failure/repair rates. The proposed model provides a comprehensive yet fundamental basis to assure and ultimately optimise the design of map-reduce computing in terms of availability with reference to its performance in a simultaneous manner. Parametric simulations have been conducted and demonstrated the efficacy of the proposed model in assessing the availability and the cost.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Big Data Intelligence (IJBDI):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook