The cost of complex communication on simple networks

Journal of Parallel and Distributed Computing

Volumn 35, Issue 2, 1996, Pages 133-141

  Greenberg, David S ^a   Park, James K ^b   Schwabe, Eric J ^c  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b Bremer Associates Inc   (United States)

^c Northwestern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030585589     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0076     Document Type: Article

References (17)

1. 1. Bajwa, R. S., and Seidel, S. R. Communication algorithms for tori and grids. CS-TR 89-04, Michigan Technical University, Houghton, MI 49931-1295, 1989.
2. 2. Bhatt, S. N., and Leighton, F. T. A framework for solving VLSI graph layout problems. J. Comput. System Sci. 28, 2 (1984), 300-343.
3. 3. Burkhardt, H. I. Internet usergroup comp.parallel. Chairman, President and Chief Executive Officer's description of KSR architecture, Feb. 1992.
4. 4. Edelman, A., Heller, S., and Johnsson, S. L. Index transformation algorithms in a linear algebra framework. IEEE Trans. Parallel Distrib. Systems 5, 12 (Dec. 1994), 1302-1309.
5. 5. Greenberg, D. S. Efficient wiring of reconfigurable parallel processors. Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures. 1993, 318-324.
6. 6. Hong, J.-W., Melhorn, K., and Rosenberg, A. L. Cost trade-offs in graph embeddings, with applications. J. Assoc. Comput. Mach. 30, 4 (Oct. 1983), 709-728.
7. 7. Intel Supercomputer Systems Division, iPSC/2 and iPSC/860 System Administrators Guide. 15201 N. W. Greenbrier Parkway, Beaverton, OR, 1991.
8. 8. Intel Supercomputer Systems Division, Paragon XP/S Product Overview, 15201 N. W. Greenbrier Parkway, Beaverton, OR, 1991.
9. 9. Koch, R., Leighton, T., Maggs, B., Rao, S., and Rosenberg, A. Work-preserving emulations of fixed-connection networks. Proceedings of the 21st Annual ACM Symposium on Theory of Computing. 1989, pages 227-240.
10. 10. Leighton, F. T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo, CA, 1992.
11. 11. Nassimi, D., and Sahni, S. Optimal BPC permutations on a cube connected SIMD computer. IEEE Trans. Comput. C 41, 4 (Apr. 1982), 338-341.
12. 12. Ni, L. M., and McKinley, P. K. A survey of wormhole routing techniques in direct networks. IEEE Comput. (Feb. 1993), 62-76.
13. 13. Sibeyn, J. Algorithms for routing on meshes. Ph.D. thesis, Univeriteit Utrecht, 1992.
14. 14. Thinking Machines Corp. CM2 Technical Summary. 245 First Street, Cambridge, MA 02142.
15. 15. Thinking Machines Corp. CMS Technical Summary. 245 First Street, Cambridge, MA 02142.
16. 16. Schwabe, E. J. On the computational equivalence of hypercube-derived networks. Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures. 1990, pp. 388-397.
17. 17. Zemoudeh, K., and Sengupta, A. Routing frequently used bijections on hypercube. Proceedings of the 5th Distributed Memory Computing Conference. 1990, pp. 824-832.