Skip to main content
SpringerLink
Log in

Greedy permutation routing on Cayley graphs

  • Posters
  • Conference paper
  • First Online:
Parallel Processing: CONPAR 92—VAPP V (VAPP 1992, CONPAR 1992)

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

Abstract

Greedy permutation routing on three proposed multicomputer architectures is evaluated, using a previously designed discrete-event simulator [3]. The following architectures are examined

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. S. B. Akers, D. Hard, and B. Krishnamunhy, “The Star Graph, an attractive alternative to the n-cube”, 1987 International Conference on Parallel Processing, pp. 393–400.

    Google Scholar 

  2. L. N. Bhuyan and D. P. Agrawal, “Generalized Hypercube and Hyperbus Structures for a Computer Network”, IEEE Transactions on Computers. C-33 (4), April 1984, pp. 323–334.

    Google Scholar 

  3. M. D. Grammatikakis and J. S. Jwo, “A Discrete Event Simulator of Communication Algorithms in Interconnec-tion Networks”, 1992 Symposium on Theoretical Aspects of Computer Science, Paris, France, pp. 609–610.

    Google Scholar 

Download references

Author information

Author notes

  1. Miltos D. Grammatikakis

    Present address: Institute for Computer Science, 71110, Heraklion, Greece

Authors and Affiliations

  1. Ecole Nonnale Superieure de Lyon, LIP, 69364, Lyon, France

    Miltos D. Grammatikakis

  2. Dept. of Information Science, Providence University, Lyon 69364, 43309, France Shalu, Taiwan R.O.C.

    Jung-Sing Jwo

Authors
  1. Miltos D. Grammatikakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jung-Sing Jwo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Luc Bougé Michel Cosnard Yves Robert Denis Trystram

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grammatikakis, M.D., Jwo, JS. (1992). Greedy permutation routing on Cayley graphs. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_515

Download citation

  • DOI: https://doi.org/10.1007/3-540-55895-0_515

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47306-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation