An Efficient Dynamic Load balancing Strategy for Tree - structured Computations


The KIPS Transactions:PartA, Vol. 8, No. 4, pp. 455-460, Dec. 2001
10.3745/KIPSTA.2001.8.4.455,   PDF Download:

Abstract

For some applications, the computational structure changes dynamically during the program execution. When this happens, static partitioning and allocation of tasks are not enough to achieve high performance in parallel computers. In this paper, we propose a dynamic load balancing algorithm which efficiently distributes the computation with dynamically growing tree structure to processors. We present an implementation technique for the algorithm on mesh architectures, and analyze its complexity. We also demonstrate through experiments how our algorithm provides good quality solutions.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
I. J. Hwang and D. K. Hong, "An Efficient Dynamic Load balancing Strategy for Tree - structured Computations," The KIPS Transactions:PartA, vol. 8, no. 4, pp. 455-460, 2001. DOI: 10.3745/KIPSTA.2001.8.4.455.

[ACM Style]
In Jae Hwang and Dong Kweon Hong. 2001. An Efficient Dynamic Load balancing Strategy for Tree - structured Computations. The KIPS Transactions:PartA, 8, 4, (2001), 455-460. DOI: 10.3745/KIPSTA.2001.8.4.455.