The KIPS Transactions:PartA (정보처리학회논문지A)

Korea Information Processing Society (한국정보처리학회)
권호 표지

An Efficient Dynamic Load balancing Strategy for Tree-structured Computations

트리구조의 계산을 위한 효율적인 동적 부하분산 전략

  • 황인재 (충북대학교 컴퓨터교육과) ;
  • 홍동권 (계명대학교 컴퓨터·전자공학부)
  • Published : 2001.12.01
Download PDF
⟨ Previous Next ⟩

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 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.

어떤 응용프로그램에서는 계산구조가 프로그램의 수행도중 동적으로 변한다. 이런 경우 정적으로 태스크를 분할하고 할당하는 것은 병렬컴퓨터에서 높은 성능을 얻는데 충분하지 못하다. 이 논문에서는 동적으로 변하는 트리구조를 가진 계산을 프로세서들에 효율적으로 분배하는 부하분산 알고리즘을 소개한다. 이 알고리즘의 메쉬구조상에서의 구현기법이 소개되고 복잡도가 분석된다. 실험을 통하여 이 알고리즘이 좋은 성능을 나타내는 것을 보인다.

Keywords

References

  1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Company, 1974
  2. I. Altas and J. Stephenson, 'A Two Dimensional Adaptive Mesh Generation Method,' Jorunal of Computational Physics, Vol.94, pp.201-224, 1991 https://doi.org/10.1016/0021-9991(91)90143-9
  3. D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation, Prentice-Hall, Englewood, New Jersey, 1989
  4. M.R. Garey and D.S. Johnson, 'Computer and Intractability,' W. H. Freeman and Company, San Francisco, CA, 1983
  5. R. Hanxleden and L.R. Scott, 'Load Balancing on Message Passing Architectures,' Journal of Parallel and Distributed Computing, Vol.13, pp.312-324, 1991 https://doi.org/10.1016/0743-7315(91)90078-N
  6. Y. Kopidakis, M. Lamari and V. Zissimopoulos, 'On the Assignment Problem : Two New Efficient Heuristic Algorithms,' Journal of Parallel and Distributed Computing, Vol.42, pp.21-29, 1997 https://doi.org/10.1006/jpdc.1997.1311
  7. C. Leangsuksun and J. Potter, 'Designs and Experiments on Heterogeneous Mapping Heuristics,' Proceedings of 1995 Workshop on Heterogeneous Processing, pp.17-22, 1994 https://doi.org/10.1109/HCW.1994.324967
  8. J.R. Pilkington and S.B. Baden, 'Dynamic Partitioning of Non-Uniform Structured Worloads with Spacefilling Curves,' IEEE Transactions on Parallel and Distributed Systems, Vol.7, No.3, 1996 https://doi.org/10.1109/71.491582
  9. C. Walshaw, M. Cross and M.G. Everett, 'Parallel Dynamic Graph Partitioning for Adaptive Unstructured Meshes,' Journal of Parallel and Distributed Computing, Vol.47, No.2, pp.102-108, 1997 https://doi.org/10.1006/jpdc.1997.1407