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.
The work of this author was supported by the Foundation for Computer Science (SION) of the Netherlands Organization for the Advancement of Pure Research (ZWO).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
7. References
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.
Fishburn, J.P., and R.A. Finkel, Quotient networks, IEEE Trans. Comput. C-31(1982)288–295.
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.
Parker, D.S., Notes on shuffle/exchange-type switching networks, IEEE Trans. Comput. C-29(1980)213–222.
Stone, H.S., Parallel processing with the perfect shuffle, IEEE Trans. Comput. C-20(1971)153–161.
van Leeuwen, J., Parallel computers and algorithms, Techn. Rep. RUU-CS-83-13, Dept of Computer Science, University of Utrecht, Utrecht, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bodlaender, H.L., van Leeuwen, J. (1984). Simulation of large networks on smaller networks. In: Mehlhorn, K. (eds) STACS 85. STACS 1985. Lecture Notes in Computer Science, vol 182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023994
Download citation
DOI: https://doi.org/10.1007/BFb0023994
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13912-6
Online ISBN: 978-3-540-39136-4
eBook Packages: Springer Book Archive