Efficient Multiple Multicast Algorithms in Wormhole - Routed Networks

웜홀 라우팅 망에서의 효율적인 다중 멀티캐스트 알고리즘

  • 김시관 (한국과학기술원 전산학과) ;
  • 조정완 (한국과학기술원 전산학과)
  • Published : 2000.04.15

Abstract

The most important metric in wormhole-routed networks is the start-up latency. In this paper, we present new multicast algorithms that reduce node contention so that multiple multicast messages can be implemented with reduced latency. By exploiting available channels evenly as much as possible, these new algorithms show better performance than the existing multicast algorithms for wormhole 2D systems when multiple multicasts are involved. All algorithms presented are proven to be deadlock-free. A simulation study has been conducted that compares the performance of these multicast algorithms under various situations in a 2D mesh. We show that the overall performance of ours are up to 20% better than the previous studies. We observe that reducing the number of the generated multidestination messages closely related to shorter message latency. These proposed algorithms can be easily extended to 3D mesh systems.

웜홀망의 성능에 영향을 미치는 가장 중요한 요소는 개시지연시간인데 이는 메시지가 생성되어 망에 투입되기까지의 시간으로 정의된다. 본 논문에서는 다중 멀티캐스트 메시지의 개시지연시간을 단축하기 위하여 노드간의 메시지 충돌을 최소화하는 효율적인 멀티캐스트 전송 알고리즘을 제안한다. 제안되는 3가지의 알고리즘은 사용 가능한 채널들을 되도록 균등하게 사용함으로써 기존 제안된 알고리즘보다 우수한 성능을 보인다. 제안된 알고리즘들이 교착상태가 없음을 증명하고 2차원 메쉬망에서의 여러 가지 조건하에서 제안된 알고리즘의 우수함을 시뮬레이션을 통하여 증명한다. 제안 알고리즘의 전반적인 성능은 기존 알고리즘보다 20% 정도 우수함을 알 수 있다. 제안된 2차원 메쉬 다중 멀티캐스트 알고리즘은 3차원 메쉬망으로 확장이 용이하다.

Keywords

References

  1. W. Athas and C.L. Seitz, 'Multicomputers: Message-Passing Concurrent Computers,' IEEE Computers, Vol. 21, No. 8, pp.9-24, Aug. 1988 https://doi.org/10.1109/2.73
  2. G. Byrd, N. Saraiya, and B. Delagi, 'Multicast Communication in Multiprocessor Systems,' Proceedings of the 1989 International Conference on Parallel Processing, pp. I-196-I-200, 1989
  3. C.M. Chiang and L.M. Ni, 'Multi-Address Encoding for Multicast,' Proc. Parallel Computer Routing and Comm. Workshop, pp. 146 160, May 1994.
  4. W. J. Dally and C. L. Seitz. 'Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,' IEEE Transactions on Computers, pages 547--553, May 1987 https://doi.org/10.1109/TC.1987.1676939
  5. J. Duato. 'A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks,' IEEETransactions on Parallel and Distributed Systems, 4(12):1320--1331, 1993 https://doi.org/10.1109/71.250114
  6. S. L. Johnsson and C.-T. Ho. 'Optimum Broadcasting and Personalized Communication in Hypercubes,' IEEE Transactions on Computers, pages 1249--1268, September 1989 https://doi.org/10.1109/12.29465
  7. Ram Kesavan and D. K. Panda. 'Multiple Multicast with Minimized Node Contention on Wormhole k-ary n-cube Networks,' IEEE Transactions on Parallel and Distributed Systems, In Press https://doi.org/10.1109/71.762817
  8. Ram Kesavan and D. K. Panda. 'Minimizing Node Contention in Multiple Multicast on Wormhole k-ary n-cube Networks,' Proceedings of the International Conference on Parallel Processing, Chicago, IL, Aug 1996 https://doi.org/10.1109/ICPP.1996.537160
  9. Y. Lan, A. Esfahanian, and L. Ni, 'Distributed Multi-Destination Routing in Hypercube Multiprocessors,' Proceedings of the Third Conference on Hypercube Computers and Concurrent Applications, pp. 631-639, Jan. 1988 https://doi.org/10.1145/62297.62384
  10. X. Lin, and L. Ni. 'Multicast Communication in Multicomputer Networks,' Technical Report, Michigan State University, Dept. of Computer Science, MSU-CPS-ACS-19, Dec. 1989
  11. X. Lin and L. M. Ni. 'Deadlock-free Multicast Wormhole Routing in Multicomputer Networks,'Proceedings of the International Symposium on Computer Architecture, pages 116--124, 1991 https://doi.org/10.1145/115952.115965
  12. P. K. McKinley and D. F. Robinson. 'Collective Communication in Wormhole-Routed Massively Parallel Computers,' IEEE Computer, pages 39-50, Dec 1995 https://doi.org/10.1109/2.476198
  13. P. K. McKinley, H. Xu, A.-H. Esfahanian, and L. M. Ni. 'Unicast-based Multicast Communication in Wormhole-routed Networks,' IEEE Transactions on Parallel and Distributed Systems, 5(12):1252 -1265, Dec 1994 https://doi.org/10.1109/71.334899
  14. Message Passing Interface Forum. MPI: A Message-Passing Interface Standard, Mar 1994
  15. L. Ni and P. K. McKinley. 'A Survey of Wormhole Routing Techniques in Direct Networks,' IEEE Computer, pages 62--76, Feb. 1993 https://doi.org/10.1109/2.191995
  16. D. K. Panda. 'Issues in Designing Efficient and Practical Algorithms for Collective Communication in Wormhole-Routed Systems,' 1995 Workshop on Challenges for Parallel Processing, pages 8--15, 1995.8
  17. D. K. Panda, S. Singal, and P. Prabhakaran. 'Multidestination Message Passing Mechanism Conforming to Base Wormhole Routing Scheme,' IEEE Transactions on Parallel and Distributed Systems, In Press https://doi.org/10.1007/3-540-58429-3_33