A multilevel load balancing algorithm in a distributed system (abstract only)

1991 ◽  
Author(s):  
Jiang B. Liu
Keyword(s):  
Load Balancing ◽  
Distributed System ◽  
Load Balancing Algorithm

scholarly journals Node Availability for Distributed Systems considering processor and RAM utilization for Load Balancing

2010 ◽  
Vol 5 (3) ◽  
pp. 336
Author(s):  
Antonio Menendez Leonel de Cervantes ◽  
Hector Benitez Perez
Keyword(s):  
Distributed Systems ◽  
Load Balancing ◽  
Distributed System ◽  
Dynamic Scheduling ◽  
Decision Criterion ◽  
Dynamic Load Balancing ◽  
Other Information ◽  
Node Availability ◽  
Load Balancing Algorithm

<p>Node-Availability is a new metric that based on processor utilization, free RAM and number of processes queued at a node, compares different workload levels of the nodes participating in a distributed system. Dynamic scheduling and Load-Balancing in distributed systems can be achieved through the Node-Availability metric as decision criterion, even without previously knowing the execution time of the processes, nor other information about them such as process communication requirements.<br /> This paper also presents a case study which shows that the metric is feasible to implement in conjunction with a dynamic Load-Balancing algorithm, obtaining an acceptable performance.</p>

Load balancing algorithm based on aspect oriented approach for a multi agent distributed system

2016 ◽  
Vol 9 ◽  
pp. 145-161
Author(s):  
Mohamed Youssfi ◽  
Omar Bouattane ◽  
Abdelaziz Daaif ◽  
Mohammed Ouadi Bensalah
Keyword(s):  
Load Balancing ◽  
Distributed System ◽  
Multi Agent ◽  
Load Balancing Algorithm ◽  
Oriented Approach

An Efficient Intra-Server and Inter-Server Load Balancing Algorithm for Internet Distributed Systems

2017 ◽  
Vol 4 (1) ◽  
pp. 1-18 ◽  
Author(s):  
Sanjaya Kumar Panda ◽  
Swati Mishra ◽  
Satyabrata Das
Keyword(s):  
Load Balancing ◽  
Distributed System ◽  
Load Factor ◽  
Optimal Assignment ◽  
Client Server ◽  
Three Phase ◽  
Np Hard Problem ◽  
Load Balancing Algorithm ◽  
Random Nature ◽  
Excessive Number

The growing popularity of Internet Distributed System has drawn enormous attention in business and research communities for handling large number of client requests. These requests are managed by a set of servers. However, the requests may not be equally distributed due to their random nature of arrivals. The optimal assignment of the requests to the servers is a well-known NP-hard problem. Therefore, many algorithms have been proposed to address this problem. However, these algorithms suffer from an excessive number of comparisons. In this paper, a Swapping-based Intra- and inter-Server (SIS) load balancing with padding algorithm is proposed for its solution. The algorithm undergoes a three-phase process to balance the loads among the servers. The proposed algorithm is compared with a client-server load balancing algorithm and the performance is measured in terms of the number of load comparisons and load factor. The simulation outcomes show the efficacy of the proposed algorithm.

scholarly journals MINIMIZATION OF LOAD BASED RESOURCES IN CLOUD COMPUTING SYSTEMS

2015 ◽  
pp. 72-75
Author(s):  
ZULFIKHAR AHMAD ◽  
ASHIS KU. MISHRA ◽  
BIKASH CHANDRA ROUT
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Distributed System ◽  
Work Load ◽  
Memory Capacity ◽  
Performance Parameters ◽  
Computing Systems ◽  
Divisible Load ◽  
Network Load ◽  
Load Balancing Algorithm

“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.

scholarly journals Effective Load Balance Scheduling Schemes for Heterogeneous Distributed System

2017 ◽  
Vol 7 (5) ◽  
pp. 2757 ◽  
Author(s):  
Zeba Khan ◽  
Mahfooz Alam ◽  
Raza Abbas Haidri
Keyword(s):  
Distributed Systems ◽  
Load Balancing ◽  
Distributed System ◽  
Load Balance ◽  
Scheduling Algorithm ◽  
Optimization Techniques ◽  
Load Imbalance ◽  
Test Conditions ◽  
Load Balancing Algorithm ◽  
Crossed Cube

Importance of distributed systems for distributing the workload on the processors is globally accepted. It is an agreed fact that divides and conquers is the effective strategy for load balancing problems. In today’s time, load balancing is the major issue for scheduling algorithm such as in Parallel and Distributed Systems including Grid and Cloud Computing and many more. Load Balancing is the phenomena of spreading or distributing the workload among the processors so that all processors keep busy for all the time, in order to prevent ideal time of processors. In this work, presents a load balancing algorithm for heterogeneous distributed system (HeDS) with aim of minimizing the load imbalance factor (LIF). The proposed algorithm is using optimization techniques such as Max-Max and Min-Max strategy and applied on Folded Crossed Cube (FCC) network. Makespan, speedup and average resource utilization are also evaluated for performance matrices. The experimental results of the proposed algorithms have showed better in comparison to with previous work under various test conditions.

Sign in / Sign up

Export Citation Format

Share Document