## Iterative Dynamic Load Balancing in Multicomputers (1994)

Venue: | Journal of Operational Research Society |

Citations: | 21 - 3 self |

### BibTeX

@ARTICLE{Xu94iterativedynamic,

author = {Cheng-zhong Xu and Francis C.M. Lau},

title = {Iterative Dynamic Load Balancing in Multicomputers},

journal = {Journal of Operational Research Society},

year = {1994},

volume = {45},

pages = {786--796}

}

### Years of Citing Articles

### OpenURL

### Abstract

Dynamic load balancing in multicomputers can improve the utilization of processors and the efficiency of parallel computations through migrating workload across processors at runtime. We present a survey and critique of dynamic load balancing strategies that are iterative: workload migration is carried out through transferring processes across nearest neighbor processors. Iterative strategies have become prominent in recent years because of the increasing popularity of point-to-point interconnection networks for multicomputers. Key words: dynamic load balancing, multicomputers, optimization, queueing theory, scheduling. INTRODUCTION Multicomputers are highly concurrent systems that are composed of many autonomous processors connected by a communication network 1;2 . To improve the utilization of the processors, parallel computations in multicomputers require that processes be distributed to processors in such a way that the computational load is evenly spread among the processors...

### Citations

3953 | Optimization by Simulated Annealing - Kirkpatrick, Jr, et al. - 1983 |

395 | Adaptive Load Sharing in Homogeneous Distributed Systems - Eager, Lazowska, et al. - 1986 |

351 | Load balancing for distributed memory multiprocessors - Cybenko - 1989 |

271 | A taxonomy of scheduling in general-purpose distributed computing systems - Casavant, Kuhl - 1988 |

264 | Universal schemes for parallel communication - Valiant, Brebner - 1981 |

165 | Generalized Hypercube and Hyperbus Structures for a Computer Network - Bhuyan, Agrawal - 1984 |

162 | Performance of Dynamic Load-Balancing Algorithms for T;nstmctured Mesh Calculations,” Concwren - Williams - 1991 |

158 |
Multicomputers: message-passing concurrent computers
- Athas, Seitz
- 1988
(Show Context)
Citation Context ...of direct neighbors of processor i. Then the change of workload in processor i from time t to t + 1 is modeled as w t+1 i = w t i + X j2A(i) ff ij (w t j \Gamma w t i ) + j t+1 i \Gamma ` t+1 i 1sisn =-=(1)-=- where 0 ! ff ij ! 1 is called the diffusion parameter of i and j, which determines the amount of workload to be exchanged between the two processors; j t+1 i and ` t+1 i denote the amounts of workloa... |

134 | The gradient model load balancing method - Lin, Keller - 1987 |

128 | Load sharing in distributed systems - Wang, Morris - 1985 |

109 | Ginneken, The Annealing Algorithm - Otten, van - 1989 |

104 | Probabilistic algorithms - Rabin - 1976 |

64 | and bound methods, a survey - Lawler, Wood, et al. - 1966 |

61 | Gendreau: “A distributed drafting Algorithm for load balancing - Ni, Xu, et al. - 1985 |

42 | Analysis of the generalized dimension exchange method for dynamic load balancing - Xu, Lau - 1992 |

42 | Load balancing in large networks: A comparative study - Lüling, Monien, et al. - 1991 |

42 | The Chare Kernel parallel programming language and system - Kale - 1990 |

39 | Heuristic technique for processor and link assignment in multicomputers - Bollinger, Midkiff - 1991 |

35 |
Optimal load balancing and scheduling in a distributed computer system
- Ross, Yao
- 1991
(Show Context)
Citation Context ...kload of the processor. Then, after a sweep of the dimension exchange procedure, the workload distribution changes to that in Figure 2(b). For an arbitrary (3) (3) (2) (1) (1) (1) (2) (1) (2) (1) (1) =-=(4)-=- (2) (1) (1) 17 4 0 12 (3) (3) 26 (4) 9 13 6 (3) (3) 15 (4) 0 8 14 (3) (3) 20 (4) 14 22 4 11 16 11 5 15 12 11 9 14 11 11 9 13 12 12 12 (a) (b) Figure 2: Workload distribution before and after a sweep ... |

35 | Load Balancing for Distributed Branch and Bound Algorithms - Lüling, Monien - 1992 |

34 | Programming a Hypercube Multicomputer - Ranka, Won, et al. - 1988 |

34 | Analysis of a graph coloring based distributed load balancing algorithm - Hosseini, Litow, et al. - 1990 |

29 | Solving problems on concurrent processors, Volumn 1 - Fox, Johnson, et al. - 1998 |

27 | Load balancing, selection and sorting on the hypercube - Plaxton - 1989 |

22 | An Adaptive Bidding Algorithm for Processes, Clusters and Distributed Groups - Stankovic, Sidhu - 1984 |

19 | A dynamic scheduling strategy for the chare-kernel system - Shu, Kale - 1989 |

15 | Allocating Data to Multicomputer Nodes by Physical Optimization Algorithms for Loosely Synchronous Computations. Concurrency: Practice and Experience - Mansour, Fox - 1992 |

14 | A Communicating Finite Automata Approach to Modeling Distributed Computation and its Application to Distributed Decision-Making - Casavant, Kuhl - 1990 |

12 | A very high speed architecture for simulated annealing - Abramson - 1992 |

11 | Load balancing on generalized hypercube and mesh multiprocessors with - Qian, Yang - 1991 |

11 | A General Purpose Distributed Implementation of Simulated Annealing - Diekmann, Lüling, et al. - 1992 |

10 | On the eigenvalues of a graph, Selected Topics in Graph Theory - Schwenk, Wilson - 1978 |

9 |
Past Present, Parallel: A Survey of Available Parallel Computing Systems
- Trew, Wilson
- 1991
(Show Context)
Citation Context ...nside a processor represents the workload of the processor. Then, after a sweep of the dimension exchange procedure, the workload distribution changes to that in Figure 2(b). For an arbitrary (3) (3) =-=(2)-=- (1) (1) (1) (2) (1) (2) (1) (1) (4) (2) (1) (1) 17 4 0 12 (3) (3) 26 (4) 9 13 6 (3) (3) 15 (4) 0 8 14 (3) (3) 20 (4) 14 22 4 11 16 11 5 15 12 11 9 14 11 11 9 13 12 12 12 (a) (b) Figure 2: Workload di... |

9 | Queueing network models for load balancing in distributed systems - Silva, Gerla - 1991 |

7 | Load Balancing, Load Sharing and Performance in Distributed Systems - Krueger, Livny - 1987 |

7 | Load balancing on the hypercube and related networks - J'aJ'a, Ryu - 1990 |

6 | From local to global: an analysis of nearest neighbor balancing on hypercube - Hong, Tan, et al. - 1988 |

6 | Local vs. global strategies for dynamic load balancing - Willebeek-LeMair, Reeves - 1990 |

6 | Dynamic cyclic load balancing on hypercubes - Hong, Tan, et al. - 1989 |

6 | The Implementation of a Dynamic Load Balancer - Fox, Kolawa, et al. - 1987 |

5 | Hypercube systems and key applications - Shih, Fier - 1989 |

5 | A process migration harness for dynamic load balancing - Baker, Milncr - 1991 |

4 | The generalized dimension exchange method on some specific structures - Xu, Lau - 1992 |

3 | The MOOS II Operating System and Dynamic Load Balancing - Koller - 1989 |

3 | Load Balancing and Hypercubes: A Preliminary Look," Hypercube Multiprocessors - Williams - 1987 |

2 |
The process allocation problem: a survey of the application of graph-- theoretic and integer programming approaches
- Sofianopoulou
- 1992
(Show Context)
Citation Context ...number inside a processor represents the workload of the processor. Then, after a sweep of the dimension exchange procedure, the workload distribution changes to that in Figure 2(b). For an arbitrary =-=(3)-=- (3) (2) (1) (1) (1) (2) (1) (2) (1) (1) (4) (2) (1) (1) 17 4 0 12 (3) (3) 26 (4) 9 13 6 (3) (3) 15 (4) 0 8 14 (3) (3) 20 (4) 14 22 4 11 16 11 5 15 12 11 9 14 11 11 9 13 12 12 12 (a) (b) Figure 2: Wor... |

2 | Distributed dynamic load balancing - Willebeek-LeMair, Reeves - 1989 |

2 | Physical optimization and load balancing algorithms - Fox, Furmanski, et al. - 1989 |

1 | Multicomputer load balancing for concurrent Lisp execution - Chowkwanyun, Hwang - 1989 |

1 | Experiments in dynamic load balancing of parallel logic programs - Su, Biswas, et al. - 1989 |