Clustered Queuing Model for Task Scheduling in Cloud Environment
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.
KeywordsCloud computing Load balancing Clustering Queuing discipline
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.
- 2.Sztrik, J.: Basic Queueing Theory. University of Debrecen (2012)Google Scholar
- 3.Buyya, R., Sukumar, K.: Platforms for Building and Deploying Applications for Cloud Computing, pp. 6–11. CSI Communication (2011)Google Scholar
- 4.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)Google Scholar
- 6.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)Google Scholar
- 16.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)Google Scholar
- 17.Slothouber, L.: A model of web server performance. In: Proceedings of the Fifth International World Wide Web Conference (1996)Google Scholar
- 18.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)Google Scholar
- 19.Borst, S., Boxma, O.J., Hegde, N.: Sojourn times in finite-capacity processor-sharing queues. Next Gener. Internet Netw IEEE 55–60 (2005)Google Scholar