Applicability of MMRR load balancing algorithm in cloud computing

Abiodun, Moses Kazeem and Awotunde, Joseph B. and Ogundokun, Roseline Oluwaseun and Misra, Sanjay and Adeniyi, A. E. Applicability of MMRR load balancing algorithm in cloud computing. International Journal of Computer Mathematics: Computer Systems Theory, 1 (6). pp. 7-20.

Text Applicability of MMRR load balancing algorithm in cloud computing.pdf Download (2MB)

Abstract

Cloud computing is now a modern model for managing, configuring, and accessing distributed computing systems around the network on a full scale. One of cloud computing's fundamental problems is the balancing of loads, which is essential for evenly distributing the workload across all nodes. Over the years, scholars have proposed various approaches in order to resolve this problem. Nevertheless, optimizations of task execution time, completion time, response time, and virtual machine resources (VMs) are still posing tremendous challenges. This study proposes a new load balancing algorithm, which combines maximum minimum and round robin algorithm (MMRR), so that tasks with long execution time can be allocated using maximum minimum and tasks with lowest execution task will be assigned using round robin. Cloud analyst tool was used to introduce the new load balancing techniques and a comparative analysis with existing algorithm was conducted to optimize cloud services to clients. The study findings indicate that Maximum Minimum Round Robin (MMRR) has brought significant changes to cloud services. The data center’s loading time is good from both Throttled and MMRR, but Round Robin was worst. MMRR performed better from the algorithms tested based on the whole response time and cost-effectiveness (89%). The study suggested that MMRR be implemented for enhancing user satisfaction in the cloud service.

Actions (login required)

View Item