This technical report discussed load balancing algorithms for AMR and the implementations of load balancers currently available in Uintah, the multi-physics framework, developed by the Center for Accidental Fires and Explosions (C-SAFE) to aid the simulation of fires and explosions. We designed several experiments to compare these load balancers by the execution time, the balance of work load d...

Network Load balancing is a technique of balancing at each node the number of packets received and the number of packets forward to the other node so that the chance of network congestion problem has been reduced and bandwidth is utilized. Although there are many techniques implemented for the balancing of nodes based on maintaining a routing table at each node and is updated as the packet get ...

We consider the problem of dynamic load balancing in arbitrary (connected) networks on n nodes. Our load generation model is such that during each round, n tasks are generated on arbitrary nodes, and then (possibly after some balancing) one task is deleted from every nonempty node. Notice that this model fully saturates the resources of the network in the sense that we generate just as many new...

|Global parallel scheduling is a new approach for runtime load balancing. In parallel scheduling , all processors are cooperated together to schedule work. Parallel scheduling accurately balances the load by using global load information. As an alternative strategy to the commonly used dynamic scheduling, it provides a high-quality, low-overhead load balancing. This paper presents a parallel sc...

Although intensive work has been done in the area of load balancing, the measure of success of load balancing is the net execution time achieved by applying the load balancing algorithms. This paper deals with the problem of load balancing conditions of parallel and distributed applications. Parallel and distributed computers have multiple-CPU architecture, and in parallel system they have shar...

Load balancing is a critical factor in achieving optimal performance in parallel applications where tasks are created in a dynamic fashion. In many computations , such as state space search problems, tasks have priorities, and solutions to the computation may be achieved more eeciently if these priorities are adhered to in the parallel execution of the tasks. For such tasks, a load balancing sc...

This paper deals with the problem of load balancing of parallel applications. Based on the study of recent work in the area, we propose a general taxonomy for describing and classifying the growing number of different load balancing techniques. This gives a thorough overview of different algorithms, helping designers to compare and choose the most suitable strategy for a given application. To i...

This work describes SAMBA, a framework for the development of parallel SPMD applications with load balancing. SAMBA contains the structure common to different SPMD applications and a library of loadbalancing algorithms. This structure allows the developer to concentrate on the specific problem at hand. The load-balancing library makes easier the identification of the most appropriate strategy f...

In a distributed network of computing hosts, the performance of the system can depend crucially on dividing up work effectively across the participating nodes. Dynamic load balancing have the potential of performing better than static strategies, they are inevitably more complex. The overheads involved are much more. But one can not negate their benefits. Load balancing is found to reduce signi...

In modern days parallel and distributed computing is one of the greatest platform for research and innovation in the field of computer science. Rapid growth of communication network and need to solve large scale problem, complexity and efficiency of the system as a whole is the key issue. Load balancing is one of the most important problem in attaining high performance in parallel and distribut...