## A Practical Approach to Dynamic Load Balancing (1995)

Citations: | 69 - 7 self |

### BibTeX

@MISC{Watts95apractical,

author = {Jerrell Watts},

title = {A Practical Approach to Dynamic Load Balancing},

year = {1995}

}

### Years of Citing Articles

### OpenURL

### Abstract

algorithm for load balancing. The following sections elaborate on each step in the above algorithm, presenting various design decisions that one encounters. 2.1 Load Evaluation The efficacy of any load balancing scheme is directly dependent on the quality of load evaluation. Good load measurement is necessary both to determine that a load imbalance exists and to calculate how much work should be transferred to alleviate that imbalance. One can determine the load associated with a given task analytically, empirically or by a combination of those two methods. 6 CHAPTER 2. METHODOLOGY 2.1.1 Analytic Load Evaluation The load for a task is estimated based on knowledge of the time complexity of the algorithm(s) that task is executing along with the data structures on which it is operating. For example, if one knew that a task involved merge sorting a list of 64 elements, one might estimate the load to be 384, since merge sort is an O(N log 2 N) sorting algorithm, and since 64 log 2 (64) ...

### Citations

2343 | Communication complexity
- Papadimitriou, Sipser
- 1984
(Show Context)
Citation Context ...NP-complete, since it is simply the subset sum problem. Fortunately, approximation algorithms exist which allow the subset sum problem to be solved to a specified non-zero accuracy in polynomial time =-=[12]-=-. Before considering such an algorithm, it is important to note that other concerns may constrain task transfer options. In particular, one would like to avoid costly trans10 diffuse(...) ffi := ff \D... |

624 |
MPI: The Complete Reference
- Snir, Otto, et al.
- 1996
(Show Context)
Citation Context ...e exception of experiments in [22], is the amount of work transfer these algorithms require to achieve load balance. The algorithms in Section 4.3 were implemented using the Message Passing Interface =-=[16]-=- and were run on up to 256 processors of a Cray T3D. The HB algorithm was mapped to the three-dimensional torus architecture of the T3D by partitioning the network along the largest dimension at each ... |

603 | Introduction to Numerical Analysis - Stoer, Bulirsch - 1980 |

337 |
Dynamic load balancing for distributed memory multiprocessors
- Cybenko
- 1989
(Show Context)
Citation Context ...past ten years, researchers have proposed a This research is sponsored by the Advanced Research Projects Agency under contract number DABT63-95C -0116. number of strategies for dynamic load balancing =-=[2, 3, 4, 5, 6, 7, 9, 10, 11, 17, 19, 20, 22, 23, 24]-=-. The goal of this work was to build upon the best of these methods and to develop new algorithms to remedy shortcomings in previous efforts. The techniques are designed to be scalable, portable and e... |

277 | A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience
- Barnard, Simon
- 1994
(Show Context)
Citation Context ...ion methods operate by partitioning the problem domain to achieve load balance and to reduce communication costs. Most presentations of these techniques appear in the context of static load balancing =-=[1, 23]-=-, although formulations appropriate for dynamic domain repartitioning do exist [19, 20]. While many methods exist for repartitioning a computation, including various geometrically based techniques, th... |

245 | Analysis of Numerical Methods - Isaacson, Keller - 1966 |

157 | Performance of dynamic load balancing algorithms for unstructured mesh calculations,” Concurrency: Practice and Experience
- Williams
- 1991
(Show Context)
Citation Context ...ion methods operate by partitioning the problem domain to achieve load balance and to reduce communication costs. Most presentations of these techniques appear in the context of static load balancing =-=[1, 23]-=-, although formulations appropriate for dynamic domain repartitioning do exist [19, 20]. While many methods exist for repartitioning a computation, including various geometrically based techniques, th... |

153 |
Strategies for Dynamic Load Balancing on Highly Parallel Computers
- Willebeek-LeMair, Reeves
- 1993
(Show Context)
Citation Context ...past ten years, researchers have proposed a This research is sponsored by the Advanced Research Projects Agency under contract number DABT63-95C -0116. number of strategies for dynamic load balancing =-=[2, 3, 4, 5, 6, 7, 9, 10, 11, 17, 19, 20, 22, 23, 24]-=-. The goal of this work was to build upon the best of these methods and to develop new algorithms to remedy shortcomings in previous efforts. The techniques are designed to be scalable, portable and e... |

127 |
The gradient model load balancing method
- Lin, Keller
(Show Context)
Citation Context ...past ten years, researchers have proposed a This research is sponsored by the Advanced Research Projects Agency under contract number DABT63-95C -0116. number of strategies for dynamic load balancing =-=[2, 3, 4, 5, 6, 7, 9, 10, 11, 17, 19, 20, 22, 23, 24]-=-. The goal of this work was to build upon the best of these methods and to develop new algorithms to remedy shortcomings in previous efforts. The techniques are designed to be scalable, portable and e... |

62 | Dynamic load balancing for PDE solvers an adaptive unstructured meshes
- Walshaw, Berzins
- 1992
(Show Context)
Citation Context |

49 |
A multi-level diffusion method for dynamic load balancing
- Horton
- 1993
(Show Context)
Citation Context |

43 | Runtime and language support for compiling adaptive irregular programs on distributedmemory machines - Hwang, Moon, et al. - 1995 |

40 |
An improved spectral bisection algorithm and its application to dynamic load balancing
- Driessche, Roose
- 1995
(Show Context)
Citation Context |

28 |
A partially asynchronous and iterative algorithm for distributed load balancing
- Song
- 1994
(Show Context)
Citation Context |

21 |
Load balancing in parallel computers
- Xu, Lau
- 1997
(Show Context)
Citation Context |

19 | Gregory: A survey of numerical mathematics - Young, T - 1973 |

18 | The Concurrent Graph: Basic Technology for Irregular Problems
- Taylor, el, et al.
- 1996
(Show Context)
Citation Context ...alculatingsffiL is the first-order accurate implicit technique described in [5]. This method produces a local error of O(ffit 2 ), where ffit is the timestep size. The second-order accurate method in =-=[18]-=- produces a local error of O(ffit 3 ). Thus, if we take a timestep with both methods, the difference between the values produced by each gives us an estimate of the error for that ffit. Taking the max... |

17 |
Dynamic load balancing for parallelized particle simulations on MIMD computers
- Kohring
- 1995
(Show Context)
Citation Context |

11 |
Parallel Load-Balancing: An Extension to the Gradient Model
- Muniz, Zaluska
- 1995
(Show Context)
Citation Context |

11 | A load balancing technique for multiphase computations
- Watts, Rieffel, et al.
- 1997
(Show Context)
Citation Context ...the overall efficiency was low. Only by jointly balancing the phases comprising a computation can one hope to achieve good overall load balance; viewing load as a vector is one way to accomplish this =-=[21]-=-. 2) Extend load balancing to the heterogeneous case. For the case of computers with heterogeneous processing capacity, the relative capabilities of the computers must be taken into account in work mo... |

11 | A Message-Driven Programming System for Fine-Grain Multicomputers - Maskit, Taylor - 1994 |

10 |
Dynamic load balancing using task-transfer probabilities
- Evans, Butt
- 1993
(Show Context)
Citation Context |

8 |
Dynamic Load Balancing for a 2D Concurrent Plasma PIC Code
- Ferraro, Liewer, et al.
- 1993
(Show Context)
Citation Context |

8 | Concurrent Simulation of Plasma Reactors
- Rieffel, Taylor, et al.
- 1997
(Show Context)
Citation Context ...n, the order of the computation is drastically reduced. Hawk is a three-dimensional concurrent DSMC application which has been used to model neutral flow in plasma reactors used in VLSI manufacturing =-=[14, 18]-=-. The DSMC algorithm that executes at each partition of the problem is given in Figure 6. Each task in the concurrent graph represents a partition of physical space and executes this algorithm. The st... |

6 |
A Parabolic Load Balancing Algorithm
- Heirich, Taylor
- 1995
(Show Context)
Citation Context |

5 | Concurrent Simulations of Plasma Reactors for VLSI Manufacturing - Rieffel - 1995 |

2 |
de Snepscheut. "A Distributed Implementation of a Task Pool
- Hofstee, Lukkien, et al.
- 1992
(Show Context)
Citation Context ...se was completely neglected by their inherently scalar approach. The authors suggested no remedy for the situation, however. Other task-based approaches to load balancing include a scalable task pool =-=[6]-=-, a heuristic for Phase 2 Comp 1 Imbalanced Balanced Phase 1 Computer 1 Computer 2 Phase 2 Comp 1 Phase 1 Comp 2 Comp 2 Figure 12: The above bars represent a one-dimensional space in which phase one d... |

2 | Parallel DSMC strategies for 3D computations
- Ivanov, Markelov, et al.
- 1997
(Show Context)
Citation Context ...any of the load balancing techniques described in this paper have also been incorporated into another DSMC code, developed by researchers at the Russian Institute of Theoretical and Applied Mechanics =-=[8]-=-. In this case, however, the work transfer vectors were not satisfied by transferring entire partitions fromone computer to another, but rather by exchanging small groups of cells along the partition ... |

2 |
Three-Dimensional Plasma Paricle-in-Cell Calculations of Ion Thruster Backflow Contamination." Submitted to the
- Roy, Hastings, et al.
- 1996
(Show Context)
Citation Context ...ing Laboratory, in collaboration with the Space Power and Propulsion Laboratory of the MIT Department of Aeronautics and Astronautics, developed a 3-D concurrent simulation capability called PlumePIC =-=[15]-=-. The PIC algorithm for a partition of the problem is presented in Figure 8. The state associated with a task is comprised of a portion of the grid and the particles contained within the corresponding... |

1 | Numerical Simulation of Ion Thruster Plume Backflow for Spacecraft Contamination Assessment - Roy - 1995 |