Abstract
With the advent of big data and Internet of Things (IoT), optimal task scheduling problem for heterogeneous multi-core virtual machines (VMs) in cloud environment has garnered greater attention from researchers around the globe. The queuing model used for optimal task scheduling is to be tuned according to the interactions of the task with the cloud resources and the availability of cloud processing entities. The queue disciplines such as First-In First-Out, Last-In First-Out, Selection In Random Order, Priority Queuing, Shortest Job First, Shortest Remaining Processing Time are all well-known queuing disciplines applied to handle this problem. We propose a novel queue discipline which is based on k-means clustering called clustered queue discipline (CQD) to tackle the above-mentioned problem. Results show that CQD performs better than FIFO and priority queue models under high demand for resource. The study shows that: in all cases, approximations to the CQD policies perform better than other disciplines; randomized policies perform fairly close to the proposed one and, the performance gain of the proposed policy over the other simulated policies, increase as the mean task resource requirement increases and as the number of VMs in the system increases. It is also observed that the time complexity of clustering and scheduling policies is not optimal and hence needs to be improved.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Boxma, O.J.: M/G/∞ tandem queues. Stoch. Process. Appl. 18, 153–164 (1984)
Sztrik, J.: Basic Queueing Theory. University of Debrecen (2012)
Buyya, R., Sukumar, K.: Platforms for Building and Deploying Applications for Cloud Computing, pp. 6–11. CSI Communication (2011)
Xiong, K., Perros, H.: Service performance and analysis in cloud computing. In: Proceedings of the 2009 Congress on Services—I, Los Alamitos, CA, USA, pp. 693–700 (2009)
Ma, B.N.W.: Mark. J.W.: Approximation of the mean queue length of an M/G/c queueing system. Oper. Res. 43, 158–165 (1998)
Miyazawa, M.: Approximation of the queue-length distribution of an M/GI/s queue by the basic equations. J. Appl. Probab. 23, pp. 443–458 (1986)
Yao, D.D.: Refining the diffusion approximation for the M/G/m queue. Oper. Res. 33, 1266–1277 (1985)
Tijms, H.C., Hoorn, M.H.V., Federgru, A.: Approximations for the steady-state probabilities in the M = G=c queue. Adv. Appl. Probab. 13, 186–206 (1981)
Kimura, T.: Diffusion approximation for an M = G=m queue. Oper. Res. 31, 304–321 (1983)
Vilaplana, Jordi, Solsona, Francesc, Teixidó, Ivan, Mateo, Jordi, Abella, Francesc, Rius, Josep: A queuing theory model for cloud computing. J Supercomput. 69(1), 492–507 (2014)
Boxma, O.J., Cohen, J.W., Huffel, N.: Approximations of the Mean waiting time in an M = G=s queueing system. Oper. Res. 27, 1115–1127 (1979)
Kleinrock, L.: Queueing Systems: Theory, vol. 1. Wiley-Interscience, New York (1975)
Adan, I.J.B.F., Boxma, O.J., Resing, J.A.C.: Queueing models with multiple waiting lines. Queueing Syst Theory Appl 37(1), 65–98 (2011)
Wolff, R.W.: Poisson arrivals see time averages. Oper. Res. 30, 223–231 (1982)
Cohen, J.W.: The multiple phase service network with generalized processor sharing. Acta Informatica 12, 245–284 (1979)
Khazaei, H., Misic, J., Misic, V.: Performance analysis of cloud computing centers using M/G/m/m + r. Queuing Systems. IEEE Trans. Parallel Distrib. Syst. 23(5) (2012)
Slothouber, L.: A model of web server performance. In: Proceedings of the Fifth International World Wide Web Conference (1996)
Yang, B., Tan, F., Dai, Y., Guo, S.: Performance evaluation of cloud service considering fault recovery. In: Proceedings of the First International Conference on Cloud, Computing (CloudCom’09), pp. 571–576 (2009)
Borst, S., Boxma, O.J., Hegde, N.: Sojourn times in finite-capacity processor-sharing queues. Next Gener. Internet Netw IEEE 55–60 (2005)
Acknowledgements
We acknowledge Visvesvaraya PhD scheme for Electronics and IT, DeitY, Ministry of Communications and IT, Government of India’s fellowship grant through Anna University, Chennai for their support throughout the working of this paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
S., S., V., R.U. (2018). Clustered Queuing Model for Task Scheduling in Cloud Environment. In: Rajsingh, E., Veerasamy, J., Alavi, A., Peter, J. (eds) Advances in Big Data and Cloud Computing. Advances in Intelligent Systems and Computing, vol 645. Springer, Singapore. https://doi.org/10.1007/978-981-10-7200-0_12
Download citation
DOI: https://doi.org/10.1007/978-981-10-7200-0_12
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-7199-7
Online ISBN: 978-981-10-7200-0
eBook Packages: EngineeringEngineering (R0)