Simulation of large networks on smaller networks

Extended abstract
  • H. L. Bodlaender
  • J. van Leeuwen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 182)

Abstract

Parallel algorithms are normally designed for execution on networks of N processors, with N depending on the size of the problem to be solved. In practice there will be a varying problem size but a fixed network size. In [2] the notion of network emulation was proposed, to obtain a structure preserving simulation of large networks on smaller networks. We present a detailed analysis of the possible emulations for some important classes of networks.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. [1]
    Bodlaender, H.L. and J. van Leeuwen, Simulation of large networks on smaller networks, Techn. Rep. RUU-CS-84-4, Dept of Computer Science, University of Utrecht, Utrecht, 1984.Google Scholar
  2. [2]
    Fishburn, J.P., and R.A. Finkel, Quotient networks, IEEE Trans. Comput. C-31(1982)288–295.Google Scholar
  3. [3]
    Garey, M.R., and D.S. Johnson, Computers and intractibility: a guide to the theory of NP-completeness, W.H. Freeman, San Francisco, Calif., 1979.Google Scholar
  4. [4]
    Parker, D.S., Notes on shuffle/exchange-type switching networks, IEEE Trans. Comput. C-29(1980)213–222.Google Scholar
  5. [5]
    Stone, H.S., Parallel processing with the perfect shuffle, IEEE Trans. Comput. C-20(1971)153–161.Google Scholar
  6. [6]
    van Leeuwen, J., Parallel computers and algorithms, Techn. Rep. RUU-CS-83-13, Dept of Computer Science, University of Utrecht, Utrecht, 1983.Google Scholar

Copyright information

© Springer-Verlag 1985

Authors and Affiliations

  • H. L. Bodlaender
    • 1
  • J. van Leeuwen
    • 1
  1. 1.Department of Computer ScienceUniversity of UtrechtUtrechtthe Netherlands

Personalised recommendations