Load balancing is a technique in which workload is distributed across multiple computers or other resources to get optimal resource utilization, minimum time delay, maximize throughput and avoid overload. Mainly in operation of parallel and distributed computing systems, load balancing problem arises. Load balancing scheme can be characterized as: static and dynamic load balancing. This paper r...

Distributed processing can be used for solving large computation intensive problems. A distributed system may include parallel supercomputers, networked workstations and PCs. This paper discusses load balancing of a parallel job in a distributed computation environment. The information necessary for load balancing is studied. The software tools that automatically collect the information and per...

In this paper, we present a game theoretic framework for obtaining a user-optimal load balancing scheme in heterogeneous distributed systems. We formulate the static load balancing problem in heterogeneous distributed systems as a noncooperative game among users. For the proposed noncooperative load balancing game, we present the structure of the Nash equilibrium. Based on this structure we der...

Different approaches for the parallel execution of the relational join operator were proposed in the literature. Implementations were developed in order to compare and evaluate these strategies in a parallel environment. However, there is no consensus concerning the behavior of these strategies, which may take into account load balancing issues, with respect to several real conditions where the...

We consider the on-line channel assignment problem in the case of cellular networks and we formalize this problem as an on-line load balancing problem of temporary tasks with restricted assignment. For the latter problem, we provide a general solution (denoted as the cluster algorithm) and we characterize its competitive ratio in terms of the combinatorial properties of the graph representing t...

Based on ServiceBSP model, a hierarchical resource load balancing algorithm with Multi-Agent is put forward in this paper which achieves the goal of dynamic load balancing and favorable Fault-tolerant. The algorithm calculates the load value according to the attributes of resource and scheduling tasks relies on the load value, while updating the load information dynamically depending on Multi-A...

We study the competitive ratio of certain online algorithms for a well-studied class of load balancing problems. These algorithms are obtained and analyzed according to a method by Crescenzi et al (2004). We show that an exact analysis of their competitive ratio on certain “uniform” instances would resolve a fundamental conjecture by Caccetta and Häggkvist (1978). The conjecture is that any dig...

We consider the problem of schedulingpermanent jobs on related machines in an on-line fashion. We design a new algorithm that achieves the competitive ratio of for the deterministic version, and for its randomized variant, improving the previous competitive ratios of 8 and ! " # . We also prove lower bounds of $ on the competitive ratio of deterministic algorithms and % on the competitive ratio...