Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 1996: Algorithms and Computation pp 295–304Cite as

Directed hamiltonian packing in d-dimensional meshes and its application

Extened abstract

  • Session 7b: Invited Presentation
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1178))

Abstract

A digraph G with minimum in-degree d and minimum out-degree d is said to have a directed hamiltonian packing if G has d link-disjoint directed hamiltonian cycles. We show that a d-dimensional N1 × ⋯ × N d mesh, when N i ≥ 2d is even, has a directed hamiltonian packing, where an edge (u, v) in G is regarded as two directed links (u, v) and 〈v,u〉. As its application, we design a time-efficient all-to-all broadcasting algorithm in 3-dimensional meshes under the wormhole routing model.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jujaj Bosak, Decompositions of graphs, Kluwer Academic Publishers, 1990.

    Google Scholar 

  2. Richard Stong, ”Hamilton decompositions of cartesian products of graphs”, Discrete Mathematics 90, pp.169–190, 1991.

    Google Scholar 

  3. Xiaola Lin and Lionel M. Ni ”Deadlock-free multicast wormhole routing in multi-computer networks”, Symposium on Computer Architecture, pp.116–125, 1991.

    Google Scholar 

  4. Sunggu Lee and Kang G. Shin, ”Interleaved all-to-all reliable broadcast on meshes and hypercubes”, IEEE Trans. Parallel and Dist. Comp., vol.5 no.5, pp.449–458, May 1994.

    Article  Google Scholar 

  5. Xiaola Lin, Philip K. McKinley and Lionel M. Ni ”Performance evaluation of multi-cast wormhole routing in 2D-mesh multicomputers”, Proc. International Conference on Parallel Processing, vol.1, pp.435–442, 1991.

    Google Scholar 

  6. Lionel M. Ni and Philip K. McKinley, ”A survey of wormhole routing technique in direct networks”, IEEE Computer, pp.62–76, Feb., 1993.

    Google Scholar 

  7. S. Felperin, P. Raghavan, and E. Upfal, ”A Theory of wormhole routing in parallel computers”, Proc. 33rd IEEE Foundations of Computer Science, pp.563–572, 1992.

    Google Scholar 

  8. S. T. Johnsson and C.-T. Ho, ”Optimum broadcasting and personalized communications in hypercubes”, IEEE Trans. on Computers, 38(9) pp.1249–1268, 1989.

    Article  Google Scholar 

  9. D. S. Scott, ”Efficient all-to-all communication patterns in hypercube and mesh topologies”, Proc. of 6th Distributed Memory Computing Conference, pp 398–403, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, KAIST, Korea

    Jae-Ha Lee, Chan-Su Shin & Kyung-Yong Chwa

Authors
  1. Jae-Ha Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chan-Su Shin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kyung-Yong Chwa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tetsuo Asano Yoshihide Igarashi Hiroshi Nagamochi Satoru Miyano Subhash Suri

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, JH., Shin, CS., Chwa, KY. (1996). Directed hamiltonian packing in d-dimensional meshes and its application. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds) Algorithms and Computation. ISAAC 1996. Lecture Notes in Computer Science, vol 1178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0009506

Download citation

  • DOI: https://doi.org/10.1007/BFb0009506

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62048-8

  • Online ISBN: 978-3-540-49633-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation