scholarly journals An Improved Rasa for Load Balancing in Cloud Computing

Author(s):  
Oyekanmi Ezekiel Olufunminiyi ◽  
Oladoja Ilobekemen Perpetual ◽  
Omotehinwa Temidayo Oluwatosin

Cloud is specifically known to have difficulty in managing resource usage during task scheduling, this is an innate from distributed computing and virtualization. The common issue in cloud is load balancing management. This issue is more prominent in virtualization technology and it affects cloud providers in term of resource utilization and cost and to the users in term of Quality of Service (QoS). Efficient procedures are therefore necessary to achieve maximum resource utilization at a minimized cost. This study implemented a load balancing scheme called Improved Resource Aware Scheduling Algorithm (I-RASA) for resource provisioning to cloud users on a pay-as-you-go basis using CloudSim 3.0.3 package tool. I-RASA was compared with recent load balancing algorithms and the result shown in performance evaluation section of this paper is better than Max-min and RASA load balancing techniques. However, it sometimes outperforms or on equal balance with Improved Max-Min load balancing technique when using makespan, flow time, throughput, and resource utilization as the performance metrics.

2021 ◽  
Vol 11 (3) ◽  
pp. 34-48
Author(s):  
J. K. Jeevitha ◽  
Athisha G.

To scale back the energy consumption, this paper proposed three algorithms: The first one is identifying the load balancing factors and redistribute the load. The second one is finding out the most suitable server to assigning the task to the server, achieved by most efficient first fit algorithm (MEFFA), and the third algorithm is processing the task in the server in an efficient way by energy efficient virtual round robin (EEVRR) scheduling algorithm with FAT tree topology architecture. This EEVRR algorithm improves the quality of service via sending the task scheduling performance and cutting the delay in cloud data centers. It increases the energy efficiency by achieving the quality of service (QOS).


Symmetry ◽  
2020 ◽  
Vol 12 (10) ◽  
pp. 1638 ◽  
Author(s):  
Mohammed A. Alsaih ◽  
Rohaya Latip ◽  
Azizol Abdullah ◽  
Shamala K. Subramaniam ◽  
Kamal Ali Alezabi

A crucial performance concern in distributed decentralized environments, like clouds, is how to guarantee that jobs complete their execution within the estimated completion times using the available resources’ bandwidth fairly and efficiently while considering the resource performance variations. Formerly, several models including reservation, migration, and replication heuristics have been implemented to solve this concern under a variety of scheduling techniques; however, they have some undetermined obstacles. This paper proposes a dynamic job scheduling model (DTSCA) that uses job characteristics to map them to resources with minimum execution time taking into account utilizing the available resources bandwidth fairly to satisfy the cloud users quality of service (QoS) requirements and utilize the providers’ resources efficiently. The scheduling algorithm makes use of job characteristics (length, expected execution time, expected bandwidth) with regards to available symmetrical and non-symmetrical resources characteristics (CPU, memory, and available bandwidth). This scheduling strategy is based on generating an expectation value for each job that is proportional to how these job’s characteristics are related to all other jobs in total. That should make their virtual machine choice closer to their expectation, thus fairer. It also builds a feedback method which deals with reallocation of failed jobs that do not meet the mapping criteria.


Author(s):  
Minakshi Sharma ◽  
Rajneesh Kumar ◽  
Anurag Jain

Cloud load balancing is done to persist the services in the cloud environment along with quality of service (QoS) parameters. An efficient load balancing algorithm should be based on better optimization of these QoS parameters which results in efficient scheduling. Most of the load balancing algorithms which exist consider response time or resource utilization constraints but an efficient algorithm must consider both perspectives from the user side and cloud service provider side. This article presents a load balancing strategy that efficiently allocates tasks to virtualized resources to get maximum resource utilization in minimum response time. The proposed approach, join minimum loaded queue (JMLQ), is based on the existing join idle queue (JIQ) model that has been modified by replacing idle servers in the I-queues with servers having one task in execution list. The results of simulation in CloudSim verify that the proposed approach efficiently maximizes resource utilization by reducing the response time in comparison to its other variants.


2019 ◽  
Vol 16 (2) ◽  
pp. 764-767
Author(s):  
P. Chitra ◽  
Karthika D. Renuka ◽  
K. Senathipathi ◽  
S. Deepika ◽  
R. Geethamani

Cloud computing is the cutting edge technology in the information field to provide services to the users over the internet through web–based tools and applications. One of the major aspects of cloud computing is load balancing. Challenges like Quality of service (QoS) metrics and resource utilization can be improved by balancing the load in cloud environment. Specific scheduling criteria can be applied using load balancing for users prioritization. This paper surveys different load balancing algorithms. The approaches that are existing are discussed and analyzed to provide fair load balancing and also a comparative analysis was presented for the performance of the existing different load balancing schemes.


There are a huge number of nodes connected to web computing to offer various types of web services to provide cloud clients. Limited numbers of nodes connected to cloud computing have to execute more than a thousand or a million tasks at the same time. So it is not so simple to execute all tasks at the same particular time. Some nodes execute all tasks, so there is a need to balance all the tasks or loads at a time. Load balance minimizes the completion time and executes all the tasks in a particular way.There is no possibility to keep an equal number of servers in cloud computing to execute an equal number of tasks. Tasks that are to be performed in cloud computing would be more than the connected servers. Limited servers have to perform a great number of tasks.We propose a task scheduling algorithm where few nodes perform the jobs, where jobs are more than the nodes and balance all loads to the available nodes to make the best use of the quality of services with load balancing.


Author(s):  
Mousa Elrotub ◽  
Ahmed Bali ◽  
Abdelouahed Gherbi

The problem of balancing user requests in cloud computing is becoming more serious due to the variation of workloads. Load balancing and allocation processes still need more optimizing methodologies and models to improve performance and increase the quality of service. This article describes a solution to balance user workload efficiently by proposing a model that allows each virtual machine (VM) to maximize the serving number of requests based on its capacity. The model measures VMs' capacity as a percentage and maps groups of user requests to appropriate active virtual machines. Finding the expected patterns from a big data repository, such as log data, and using some machine learning techniques can make the prediction more efficiently. The work is implemented and evaluated using some performance metrics, and the results are compared with other research. The evaluation shows the efficiency of the proposed approach in distributing user workload and improving results.


2014 ◽  
Vol 577 ◽  
pp. 935-938
Author(s):  
Cheng Yu Cai ◽  
Yuan Sheng Lou

In order to make up for the shortage of Min-Min in load balancing, a new task scheduling algorithm T-Max-Int Under the grid computing has been proposed in this paper. In T-Max-Int, the Loss Degree of Max-Int has been brought into Min-Min. T was in the form of percentage, which represents the proportion of selected tasks that have loss degree in the total tasks. Then, experiments of T have been taken to make Makespan the minimum. Finally, T-Max-Int, Max-Min, Min-Min were compared, which proved that T-Max-Min is better than the other two algorithms in aspects of Makespan and load balancing.


2019 ◽  
Vol 8 (3) ◽  
pp. 1863-1870 ◽  

Resource allocation (RA) is a significant aspect of Cloud Computing. The Cloud resource manager is responsible to assign available resources to the tasks for execution in an effective way that improves system performance, reduce response time, lessen makespan and utilize resources efficiently. To fulfil these objectives, an effective Tasks Scheduling algorithm is required. The standard Max-Min and Min-Min Task Scheduling algorithms are not able to produce better makespan and effective resource utilization. In this paper, a Resource-Aware Min-Min (RAMM) Algorithm is proposed based on basic Min-Min algorithm. The proposed RAMM Algorithm selects shortest execution time task and assigns it to the resource which takes shortest completion time. If minimum completion time resource is busy, then the RAMM Algorithm selects next minimum completion time resource to reduce waiting time of the task and improve resource utilization. The experiment results show that the proposed RAMM Algorithm produces better makespan and load balance than Max-Min, Min-Min and improved Max-Min Algorithms.


2020 ◽  
Vol 9 (5) ◽  
pp. 2008-2011
Author(s):  
Adinda Riztia Putri ◽  
Rendy Munadi ◽  
Ridha Muldina Negara

The emergence of the container in various cloud platforms from Open Stack to Google Cloud Platform has marked the industry interest in opting for container as their cloud service solution. However, the cloud users should aware of performance overheads of different virtualization solutions in order to avoid quality of service degradation because different container platforms delivered different performances. This research evaluated how different container platforms (Docker, LXC, and LXD) impacted in running different TCP services and also measured system performance of each container compared to the native system without any container solution based on overall performance metrics. This research focuses on the three most used PaaS: FTP Server, Web Server, and Mail Server. Related to previous works, our evaluation results show that performance could vary between containers. In terms of system performance, LXD shows better performance while server performance result varies depending on what service is being evaluated.


2018 ◽  
Vol 7 (4.12) ◽  
pp. 63 ◽  
Author(s):  
Jyoti Parashar ◽  
Dr. Avinash Sharma

Cloud computing is a new technology used to manipulate, configure and can be used to access distributed computing applications in the network. It implements the load balancing approach which is used to distribute all of its workload to every node connected in the network. By using this technique resource utilization is done properly. It can also used to achieve user satisfaction and computing resources. If load balancing is used properly then it can efficiently and properly implement the fail-over, scalability, over- provisioning techniques. It can also minimize the resources used and avoid the bottleneck. In my research, review of different load balancing techniques, its usage, limitations, applications and various performance metrics are described..  


Sign in / Sign up

Export Citation Format

Share Document