Advertisement

Multidestination message passing mechanism conforming to base wormhole routing scheme

  • Dhabaleswar K. Panda
  • Sanjay Singal
  • Pradeep Prabhakaran
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 853)

Abstract

A new concept of multidestination wormhole mechanism is proposed which allows a message to be propagated along any valid path in a wormhole network conforming to the underlying base routing scheme (ecube, planar, turn, or fully adaptive). Two schemes are developed and evaluated to perform fast multicasting and broadcasting in 2D/3D meshes/tori using this new mechanism. Not only do these schemes demonstrate superiority over Umesh [10] and Hamiltonian Path [9] schemes, they indicate an interesting result that the cost of multicast can be reduced or kept near-constant as the degree of multicast increases. Variations of the proposed schemes to take advantage of routing-adaptivity are also presented. These results are the first ones in the wormhole-routing literature to propose multicasting schemes with such reduced overhead and provision for taking advantage of adaptivity. It lays a new foundation in building high-performance wormhole architecture for supporting fast collective communication operations.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Balakrishnan and D. K. Panda. Impact of Multiple Consumption Channels on Wormhole Routed k-ary n-cube Networks. In Proceedings of the International Parallel Processing Symposium, pages 163–167, April 1993.Google Scholar
  2. 2.
    M. Barnett, D. G. Payne, and R. Van de Geijn. Optimal Broadcasting in Mesh-Connected Architectures. Technical Report TR91-38, Dept. of Computer Science, University of Texas at Austin, Dec 1991.Google Scholar
  3. 3.
    S. H. Bokhari and H. Berryman. Complete Exchange on a Circuit-Switched Mesh. In Proceedings of the Scalable High Performance Computing Conference, pages 300–306, 1992.Google Scholar
  4. 4.
    R. V. Boppana, S. Chalasani, and C. S. Raghavendra. On Multicast Wormhole Routing in Multicomputer Networks, manuscript, Jan 1994.Google Scholar
  5. 5.
    A. A. Chien and J. H. Kim. Planar-Adaptive Routing: Low-Cost Adaptive Networks for Multiprocessors. In Proceedings of the International Symposium on Computer Architecture, pages 268–277, 1992.Google Scholar
  6. 6.
    W. J. Dally and C. L. Seitz. Deadlock-Free Message Routing in Multiprocessor Interconnection Networks. IEEE Trans. on Computers, pages 547–553, May 1987.Google Scholar
  7. 7.
    J. Duato. A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks. IEEE Trans. on Parallel and Distributed Systems, 4(12):1320–1331, 1993.Google Scholar
  8. 8.
    C. J. Glass and L. Ni. The Turn Model for Adaptive Routing. In Proceedings of the International Symposium on Computer Architecture, pages 278–287, 1992.Google Scholar
  9. 9.
    X. Lin, P. K. McKinley, and L. M. Ni. Performance Evaluation of Multicast Wormhole Routing in 2D-Mesh Multicomputers. In Proceedings of the International Conference on Parallel Processing, pages I:435–442, 1991.Google Scholar
  10. 10.
    P. K. McKinley, H. Xu, A.-H. Esfahanian, and L. M. Ni. Unicast-based Multicast Communication in Wormhole-routed Direct Networks. In Proceedings of the International Conference on Parallel Processing, pages 11:10–19, 1992.Google Scholar
  11. 11.
    Message Passing Interface Forum. MPI: A Message-Passing Interface Standard, Mar 1994.Google Scholar
  12. 12.
    L. Ni and P. K. McKinley. A Survey of Wormhole Routing Techniques in Direct Networks. IEEE Computer, pages 62–76, Feb. 1993.Google Scholar
  13. 13.
    D. K. Panda and P. Prabhakaran. Multicasting using Multidestination-Worms Conforming to Base Wormhole Routing Scheme. Technical Report OSU-CISRC-11/93-TR37, Dept. of CIS, The Ohio State University, 1993.Google Scholar
  14. 14.
    D. K. Panda, S. Singal, and P. Prabhakaran. Multidestination Message Passing Mechanism Conforming to Base Wormhole Routing Scheme. Technical Report OSU-CISRC-6/94-TR33, Dept. of CIS, The Ohio State University, 1994.Google Scholar
  15. 15.
    H.D. Schwetman. Using CSIM to Model Complex Systems. In Proceedings of the 1988 Winter Simulation Conference, pages 246–253, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Dhabaleswar K. Panda
    • 1
  • Sanjay Singal
    • 1
  • Pradeep Prabhakaran
    • 1
  1. 1.Dept. of Computer and Information ScienceThe Ohio State UniversityColumbus

Personalised recommendations