Skip to main content
SpringerLink
Log in

A discrete event simulator of communication algorithms in interconnection networks

  • Conference paper
  • First Online:
STACS 92 (STACS 1992)

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

Included in the following conference series:

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. F. T. Leighton, “Average Case of Greedy routing Algorithms”, 1990, preprint.

    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. S. B. Akers, D. Harel, and B. Krishnamurthy, “The Star Graph, an attractive alternative to the n-cube”, 1987 International Conference on Parallel Processing, pp. 393–400.

    Google Scholar 

  4. Duncan H. Lawrie, “Access and Alignment of Data in an Array Processor”, IEEE Transactions on Computers, C-24 (12), December 1975, pp. 1145–1155.

    Google Scholar 

  5. M-D. P. Leland, “On the Power of the Augmented Data Manipulator Network”, 1985 International Conference on Parallel Processing, pp. 74–78.

    Google Scholar 

  6. Ted Szymanski, “On the permutation capability of a circuit-switched hypercube”, 1989 International Conference on Parallel Processing, Volume I, pp. 103–110.

    Google Scholar 

  7. M. T. Raghunath, A. Ranade, “A Simulation-Based comparison of Interconnection Networks”, Annual IEEE Conference on Parallel and Distributed Processing, 1990, pp. 98–103.

    Google Scholar 

  8. F. Wieland, D. Jefferson, “Case Studies in Serial and Parallel Simulation”, 1989 International Conference on Parallel Processing, Vol. III, pp. 255–258.

    Google Scholar 

  9. J. Lenfant, “Permutations of Data: A Benes Network Control Algorithm for frequently used permutations”, IEEE Transactions on Computers, Vol. C-27 (7), July 1978, pp. 637–647.

    Google Scholar 

  10. D. Steinberg, “Notes Invariant Properties of the Shuffle/Exchange and a Simplified Cost-Effective Version of the Omega Network, IEEE Transactions on Computers, C-32 (5), March 1983, pp. 444–450.

    Google Scholar 

  11. A. Waksman. “A Permutation Network”, Journal of the ACM, 15 (1), January 1968, pp. 159–163.

    Google Scholar 

  12. L. G. Valiant, “A Bridging Model for Parallel Computation”, Communication of the ACM, August 1990, pp. 103–11.

    Google Scholar 

  13. J. Jwo, S. Lakshmivarahan, S. K. Dhall, “A New Class of Interconnection Networks Based on The Alternating Group”, Networks 1991 (submitted).

    Google Scholar 

  14. L. Kleinrock, Communication Networks, MC Graw Hill 1964.

    Google Scholar 

  15. M. Grammatikakis, J. Jwo, “A Simulation-Based Analysis of Communication in Multicomputers”, International Parallel Processing Symposium 1992 (submitted).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de l' Informatique du Parallelisme, Ecole Normale Superieure de Lyon, 69364, Lyon, France

    Miltos D. Grammatikakis

  2. Department of Information Science, Providence University, 43309, Shalu, Taiwan ROC

    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

Alain Finkel Matthias Jantzen

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). A discrete event simulator of communication algorithms in interconnection networks. In: Finkel, A., Jantzen, M. (eds) STACS 92. STACS 1992. Lecture Notes in Computer Science, vol 577. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55210-3_219

Download citation

  • DOI: https://doi.org/10.1007/3-540-55210-3_219

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55210-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation