scholarly journals MINIMIZATION OF LOAD BASED RESOURCES IN CLOUD COMPUTING SYSTEMS

Author(s):  
ZULFIKHAR AHMAD ◽  
ASHIS KU. MISHRA ◽  
BIKASH CHANDRA ROUT

“Cloud computing” is a term, which involves virtualization, distributed computing, networking, software and Web services. Our Objective is to develop an effective load balancing algorithm using Divisible Load Scheduling Theorem to maximize or minimize different performance parameters (throughput, latency for example) for the clouds of different sizes. Central to these issues lays the establishment of an efficient load balancing algorithm. The load can be CPU load, memory capacity, delay or network load. Load balancing is the process of distributing the load among various nodes of a distributed system to improve both resource utilization and job response time while also avoiding a situation where some of the nodes are heavily loaded while other nodes are idle or doing very little work. Load balancing ensures that all processor in the system or every node in the network does approximately the equal amount of work at any instant of time.

2016 ◽  
Vol 15 (4) ◽  
pp. 6681-6685
Author(s):  
Parveen Kaur ◽  
Monika Sachdeva

Now a days every organization is migrating towards  cloud computing as cloud computing is considered being more flexible and scalable as compared to other technologies. The technology simply means to provide the computing resources and services through a network. This paper discusses the existing approaches for scheduling algorithms that can maintain the load balancing and provides better improved strategies through efficient job scheduling and modified resource allocation techniques. The load can be CPU load, memory capacity, delay or network load. Load balancing is the process of distributing the load among various nodes of a distributed system to improve both resource utilization and job response time while also avoiding a situation where some of the nodes are heavily loaded while other nodes are idle or doing very little work. Load balancing ensures that all the processor in the system or every node in the network does approximately the equal amount of work at any instant of time. 


Cloud computing is a new sort of computing over internet. It has many advantages along with several issues. These issues are related to load management, security of data in cloud. In this paper, the most important concern is to prevent bottleneck in cloud computing. The load can be (CPU load, memory capacity, delay or network-load). Load balancing is the process of distributing the load among various servers so that none of the servers is underloaded. Load-balancing also prevents the situation where some servers are heavily loaded while others are idle. This process of Load balancing ensures that load is distributed equally among the servers. In this paper, some algorithms of load balancing is discussed along with its benefits and drawbacks and also tested these algorithms on some performance parameters.


The cloud/utility computing model requires a dynamic task assignment to cloud sites with the goal that the performance and demand handling is done as effectively as would be prudent. Efficient load balancing and proper allocation of resources are vital systems to improve the execution of different services and make legitimate usage of existing assets in the cloud computing atmosphere. Consequently, the cloud-based infrastructure has numerous kinds of load concerns such as CPU load, server load, memory drain, network load, etc. Thus, an appropriate load balancing system helps in realizing failures, reducing backlog problems, adaptability, proper resource distribution, expanding dependability and client fulfillment and so forth in distributed environment. This thesis reviewed various popular load balancing algorithms. Modified round robin algorithms are popularly employed by various giant companies for scheduling issues and load balancing. An enhanced weighted round robin algorithm is discussed in this paper concentrating on efficient load balancing and effective task scheduling and resource management.


Author(s):  
Eirini Zoumi ◽  
Emmanouil Skondras ◽  
David Veliu ◽  
Angelos Michalas ◽  
Dimitrios D. Vergados

2021 ◽  
Vol 2070 (1) ◽  
pp. 012129
Author(s):  
M. Shabina Ghafir ◽  
Afshar Alam ◽  
Farheen Siddiqui ◽  
Sameena Naaz

Abstract This paper focuses on the VM allocation policies for load balancing in cloud computing environment. Intermittent nature of balancing the load scheme into the cloud computing becomes a challenging job and it also affects the load balancing of the cloud. The suggested proposed model generates and step-up the VM allocation policies but also transforms the generated cloud workload. Furthermore, to improve the workload distribution of workload and stability of the overall cloud computing environment the load balancing algorithm is most important for load balancing. The work of load balancing is equally effective in the cloud computing environment and it is most essential one for load balancing algorithms to take care of all issues at the time of the work load. The researchers studied different algorithms to solve the problems of load balancing that generate problems during the distribution of workloads. The analysis VM allocation policies are tested on CloudSim environment and the results, and discussion is about to which one VM allocation policy is superior.


Electronics ◽  
2020 ◽  
Vol 9 (4) ◽  
pp. 686
Author(s):  
JongBeom Lim ◽  
DaeWon Lee

As current data centers and servers are growing in size by orders of magnitude when needed, load balancing is a great concern in scalable computing systems, including mobile edge cloud computing environments. In mobile edge cloud computing systems, a mobile user can offload its tasks to nearby edge servers to support real-time applications. However, when users are located in a hot spot, several edge servers can be overloaded due to suddenly offloaded tasks from mobile users. In this paper, we present a load balancing algorithm for mobile devices in edge cloud computing environments. The proposed load balancing technique features an efficient complexity by a graph coloring-based implementation based on a genetic algorithm. The aim of the proposed load balancing algorithm is to distribute offloaded tasks to nearby edge servers in an efficient way. Performance results show that the proposed load balancing algorithm outperforms previous techniques and increases the average CPU usage of virtual machines, which indicates a high utilization of edge servers.


Author(s):  
Chanintorn Jittawiriyanukoon

<p>The distribution of scheduler from user inquiries in the clouds is complex. In keeping up with the cloud computing environment and the inquirers, the clouds meet with some problematic load balancing complications as an improving load balancing tool induces the rigorous efficiency of the cloud based website’s user access. Overloaded or underloaded conditions originate processing catastrophe regarding the prolonged execution time, bandwidth hog, malfunction, and etc. Besides, to manipulate Erlang concurrent tasks is another skyward situation. Hence, the load balancing is obliged to exhaust all mentioned conditions. The proposed load balancing algorithm for Erlang concurrent tasks (those are and could also be autonomous and unstable.) on VMware workstations is introduced.  There are several load patterns within the clouds corresponding to CPU’s load (utilization), memory load (queue size), link capacity load (bandwidth), and so on. The proposed load balancing is to spot underloaded and overloaded conditions then stabilizes the weight amidst computing nodes. There are countless load balancing approaches in the cloud environment to examine performance parameters. A short outline of corresponding performance metrics in the review and their findings are presented. To investigate the fit efficiency of the proposed algorithm, the simulation is applied then results based on the proposed method are compared to the existing ones. The outcomes settle the weight balancing, outperform others when executing Erlang traffic, and are catered in the context.</p>


Sign in / Sign up

Export Citation Format

Share Document