A Threshold-based Tournament Resource Allocation in Cloud Computing Environment

Main Article Content

I. P. Oladoja
O. S. Adewale
S. A. Oluwadare
E. O. Oyekanmi

Abstract

Cloud computing environments provide an apparition of infinite computing resources to cloud users so that they can increase or decrease resource consumption rate according to their demands. In the Cloud, computing resources need to be allocated and scheduled in a way that providers can achieve high resource utilization and users can meet their applications’ performance requirements with minimum expenditure. Due to these different intentions, there is the need to develop a scheduling algorithm to outperform appropriate allocation of tasks on resources. The paper focuses on the resource optimization using a threshold-based tournament selection probability for virtual machines used in the execution of tasks. The proposed approach was designed to create metatask and the proposed algorithm used was Median-Based improved Max-Min algorithm. The experimental results showed that the algorithm had better performance in terms of makespan, utilization of resources and throughput. The load balance of tasks was also fairly distributed on the two datacenters.

Keywords:
Cloud computing, genetic algorithm, resource allocation, threshold-based tournament.

Article Details

How to Cite
Oladoja, I. P., Adewale, O. S., Oluwadare, S. A., & Oyekanmi, E. O. (2021). A Threshold-based Tournament Resource Allocation in Cloud Computing Environment. Asian Journal of Research in Computer Science, 7(1), 1-13. https://doi.org/10.9734/ajrcos/2021/v7i130169
Section
Original Research Article

References

Atrey A, Jain N, Iyengar N, Ch. SN. A Study on Green Cloud Computing, IJGDC. 2013;93-102.

Shubhangi, Mehrotra. Resource allocation and scheduling in the cloud. International Journal of Emerging Trends & Technology in Computer Science (IJETTCS). 2012;1(1). Available: www.ijettcs.org

Himani, Harmanbir SS. Comparative analysis of scheduling algorithms of cloudsim in cloud computing. International Journal of Computer Applications. 2014;97(16):0975-8887.

Chawda P, Chakraborty PS. An improved min-min task scheduling algorithm for load balancing cloud computing. International Journal on Recent and Innovation Trends in Computing and Communication. 2016;4:60-64.

Saraswathi AT, Kalaashri YRA, Padmavathi S. Dynamic Resource Allocation Scheme in Cloud Computing, Elsevier Procedia Computer Science. 2015;47:30–36.

Hamed Piroozfard, Kuan Yew Wong, Adnan Hassan. A hybrid genetic algorithm with a knowledge-based operator for solving the job shop scheduling problems. Journal of Optimization; 2016.

Priya, Babub NK. Moving average fuzzy resource scheduling for virtualized cloud data services. Journal of Computer Standards and Interfaces. 2018;50:251-257.

Bo Wang et al. Improving task scheduling with parallelism awareness in heterogeneous computational environments. Future Generation Computer System. 2019;94:419-429.

Krishnaveni H, Sinthu Janita Prakash V. Execution time based sufferage algorithm for static task scheduling in cloud. Advances in Big Data and Cloud Computing, Advances in Intelligent Systems and Computing. 2019;750. Available:https://doi.org/10.1007/978-981-13-1882-5_5.

Rodrigo N. Calheiros, Rajiv Ranjan, Anton Beloglazov, C´esar AF. De Rose, Rajkumar Buyya. CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms. Published online 24 August 2010 in Wiley Online Library (wileyonlinelibrary.com); 2010. DOI: 10.1002/spe.995.

Maheswaran M, Ali sh, Jay siegel H, Hensgen D, Freund RF. Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. Journal of Parallel and Distributed Computing. 1999;59:107-131.

Neha Gupa, Parminder Singh. Load Balancing Using Genetic Algorithm in Mobile Cloud Computing. International Journal of Innovations in Engineering and Technology (IJIET). 2014;4(1). ISSN: 2319-1058.

Daniel W. Dyer. Tournament Selection: Selection Strategies & Elitism; 2010. Copyright Accessed on 18-10-2018.Url: Available:https://watchmaker.Uncommons.Org/manual/ch03s04.Html.

Paulo Gaspar. Why is the mutation rate in genetic algorithms very small. Vishwakarma Institute; 2018. Available:https://www.Researchgate.Net/post/why_is_the_mutation_rate_in_genetic_algorithms_very_small.