This paper presents an improved direct dimension exchange method (DDE) for synchronous load balancing for k-ary n-cube multicom-puters. The new method is based on the improved DEM for hypercube. The original DEM when extended to the k-ary n-cube requires many iterations in exchanging loads between neighboring nodes to converge to a balanced state. The original DDE does not requires iteratively ...

In this paper we will look into the problem of dynamic balancing of tasks in a het-erogenous parallel computing environment. The parallel programs are assumed to be executed in the Single Program Multiple Data (SPMD) style. The criteria for re-balancing the load are discussed; the eeect of data movement required in the load balancing is considered; and novel algorithms of dynamic load balancing...

Parallel graph reducers such as GUM use dynamic techniques to manage resources during execution. One important aspect of the dynamic behaviour is the distribution of work. The load balancing mechanism, which controls this aspect, should be flexible, to adjust the distribution of work to hardware characteristics as well as dynamic program characteristics, and scalable, to achieve high utilisatio...

We present a technique for adaptive load balancing for ray traced volume rendering on distributed memory machines using hierarchical representation of volume data. Our approach partitions the image onto processors while preserving scanline coherence. Volume data is assumed replicated on each processor since our focus in this paper is to characterize computation and communication requirements fo...

This paper proposed dynamic load balancing for Grid systems in order to quickly render information to consumer requests. The proposed algorithm is based on migration the requests from Registry to failover registry if there are overloaded at Registry or Registry is failed. The new point in this algorithm is that the tasks will be ordered in ready queue of Registry or failover registry depending ...

Increasingly large-scale clusters of SMPs continue to become majority platform in HPC field. Such a cluster environment, there may be load imbalances due to several reasons and mis-placement of data which bring performance bottlenecks. To overcome these problems, some dynamic load balancing mechanisms are needed. In this paper, we report our ongoing work on dynamic load balancing extention to O...

In this paper we contrast the performance of three different parallel dynamic load-balancing algorithms when used in conjunction with a particular parallel, adaptive, time-dependent, 3-d ow solver that has recently been developed at Leeds. An overview of this adaptive solver is given along with a description of a new dynamic load-balancing algorithm. The eeectiveness of this algorithm is then a...

Load balancing involves assigning to each processor work proportional to its performance, thereby minimizing the execution time of a program. Although static load balancing can solve many problems (e.g., those caused by processor heterogeneity and nonuniform loops) for most regular applications, the transient external load due to multiple users on a network of workstations necessitates a dynami...

In parallel computing, a problem is divided into a set of smaller tasks that are distributed across multiple processing elements. Balancing the load of the processing elements is key to achieving good performance and scalability. If the computational costs of the individual tasks vary over time in an unpredictable way, dynamic load balancing aims at migrating them between processing elements so...

Load balancing in distributed computer systems is the process of redistributing the work load among processors in the system to improve system performance. Most of previous research in using fuzzy logic for the purpose of load balancing has only concentrated in utilizing fuzzy logic concepts in describing processors load and tasks execution length. The responsibility of the fuzzy-based load bal...