Simulation of large networks on smaller networks
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  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.
Unable to display preview. Download preview PDF.
- 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
- Fishburn, J.P., and R.A. Finkel, Quotient networks, IEEE Trans. Comput. C-31(1982)288–295.Google Scholar
- 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
- Parker, D.S., Notes on shuffle/exchange-type switching networks, IEEE Trans. Comput. C-29(1980)213–222.Google Scholar
- Stone, H.S., Parallel processing with the perfect shuffle, IEEE Trans. Comput. C-20(1971)153–161.Google Scholar
- van Leeuwen, J., Parallel computers and algorithms, Techn. Rep. RUU-CS-83-13, Dept of Computer Science, University of Utrecht, Utrecht, 1983.Google Scholar