Work-preserving emulations of fixed-connection networks

Journal of the ACM

Volumn 44, Issue 1, 1997, Pages 104-147

  Koch, Richard R ^a   Leighton, F T ^b   Maggs, Bruce M ^c   Rao, Satish B ^d   Rosenberg, Arnold L ^e   Schwabe, Eric J ^f  

^a LUCENT TECHNOLOGIES   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

^d NEC LABORATORIES AMERICA   (United States)

^e UNIVERSITY OF MASSACHUSETTS   (United States)

^f NORTHWESTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; ELECTRIC NETWORK TOPOLOGY; PARALLEL PROCESSING SYSTEMS; SYSTEMS ANALYSIS;

FIXED CONNECTION NETWORKS; LOWER BOUNDS; WORK PRESERVING EMULATIONS;

COMPUTER NETWORKS;

EID: 0030651822     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/256292.256299     Document Type: Article

References (30)

1. ATALLAH, M. J. 1988. On multidimensional arrays of processors. IEEE Trans. Comput. 37, 10 (Oct.), 1306-1309.
2. BENEŠ, V. E. 1965. Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, Orlando, Fla.
3. BHATT, S. N., CHUNG, F. R. K., HONG, J.-W., LEIGHTON, F. T., AND ROSENBERG, A. L. 1996. Optimal simulations by butterfly-like networks. J. ACM 43, 2 (Mar.), 293-330.
4. BHATT, S. N., CHUNG, F. R. K., LEIGHTON, F. T., AND ROSENBERG, A. L. 1986. Optimal simulations of tree machines. In Proceedings of the 27th Annual Symposium on Foundations of Computer Science (Oct.). IEEE, New York.
5. BHATT, S. N., AND IPSEN, I. 1988. Embedding trees in the hypercube. Tech. Rep. RR-443. Yale Univ. New Haven, Conn.
6. COLE, R. J., MAGGS, B. M., AND SITARAMAN, R. K. 1996. On the benefit of supporting virtual channels in wormhole routers. In Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures (Padua, Italy, June 24-26). ACM, New York, pp. 131-141.
7. FELLOWS, M. R. 1985. Encoding graphs in graphs. Ph.D. dissertation, Department of Computer Science. Univ. California, San Diego, San Diego, Calif.
8. FISHBURN, J. P., AND FINKEL, R. A. 1982. Quotient networks. IEEE Trans. Comput. C-31, 4 (Apr.). 288-295.
9. GREENBERG, D. S., HEATH, L. S., AND ROSENBERG, A. L. 1990. Optimal embeddings of butterfly-like graphs in the hypercube. Math. Syst. Theory 23, 61-77.
10. HOEY, D., AND LEISERSON, C. E. 1980. A layout for the shuffle-exchange network. In Proceedings of the 1980 International Conference on Parallel Processing (Aug.). IEEE, New York, pp. 329-336.
11. KLEITMAN, D. J., LEIGHTON, F. T., LEPLEY, M., AND MILLER, G. L. 1981. New layouts for the shuffle-exchange graph. In Proceedings of the 13th Annual ACM Symposium on Theory of Computing (Milwaukee, Wise., May 11-13). ACM, New York, pp. 278-292.
12. KRUSKAL, C. P., RUDOLPH, L., AND SNIR, M. 1988. A complexity theory of efficient parallel algorithms. In Proceedings of the 15th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 317. Springer-Verlag, New York, pp. 333-346.
13. LEIGHTON, F. T., LEPLEY, M., AND MILLER, G. L. 1984. Layouts for the shuffle-exchange graph based on the complex plane diagram. SIAM J. Algebraic Disc. Meth. 5, 2 (June), 202-215.
14. LEIGHTON, F. T., MAGGS, B. M., RANADE, A. G., AND RAO, S. B. 1994. Randomized routing and sorting on fixed-connection networks. J. Algorithms 17, 1 (July). 157-205.
15. LEIGHTON, F. T., AND MILLER, G. L. 1981. Optimal layouts for small shuffle-exchange graphs. In VLSI 81-Very Large Scale Integration, J. Gray, ed. Academic Press, New York, NY.
16. LEIGHTON, T., MAGGS, B., AND RAO, S. 1988. Universal packet routing algorithms. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science (Oct.). IEEE, New York, pp. 256-271.
17. MEYER AUF DER HEIDE, F. 1983. Efficiency of universal parallel computers. Acta Inf. 19, 269-296.
18. MEYER AUF DER HEIDE, F. 1986. Efficient simulations among several models of parallel computers. SIAM J. Comput. 15, 1 (Feb.), 106-119.
19. MEYER AUF DER HEIDE, F., AND WANKA, R. 1989. Time-optimal simulations of networks by universal parallel computers. In Proceedings of the 6th Symposium on Theoretical Aspects of Computer Science. pp. 120-131.
20. LEWIS II, P. M., STEARNS, R. E., AND HARTMANIS, J. 1965. Memory bounds for recognition of context-free and context-sensitive languages. In Proceedings of the IEEE Symposium on Circuit Theory and Logical Design. IEEE, New York, pp. 191-202.
21. PAPADIMITRIOU, C. H., AND YANNAKAKIS, M. 1988. Towards an architecture-independent analysis of parallel algorithms. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (Chicago, Ill., May 2-4). ACM, New York, pp. 510-513.
22. PATERSON, M. S., Ruzzo, W. L., AND SNYDER, L. 1981. Bound on minimax edge length for complete binary trees. In Proceedings of the 13th Annual ACM Symposium on Theory of Computing (Milwaukee, Wise., May 11-13). ACM, New York, pp. 293-299.
23. PIPPENGER, N. 1982. Telephone switching networks. In Proceedings of Symposia in Applied Mathematics, vol. 26. American Mathematical Society, Providence, R.I., pp. 101-133.
24. PIPPENGER, N. 1984. Parallel communication with limited buffers. In Proceedings of the 25th Annual Symposium on Foundations of Computer Science (Oct.). IEEE, New York, pp. 127-136.
25. RAGHUNATHAN, A., AND SARAN, H. 1988. Is the shuffle-exchange better than the butterfly? Unpublished manuscript.
26. REIF, J. H., AND VALIANT, L. G. 1987. A logarithmic time sort for linear size networks. J. ACM 34, 1 (Jan.). 60-76.
27. SEKANINA, M. 1960. On an ordering of the set of vertices of a connected graph. Publications of the Faculty of Science, University of Brno 412, 137-142.
28. 3/2 N) area. IEEE Trans. Comput. C-30, 12 (Dec.). 977-982.
29. WAKSMAN, A. 1968. A permutation network. J. ACM 15, 1 (Jan.). 159-163.
30. WISE, D. S. 1981. Compact layouts of Banyan/FFT networks. In CMU Conference on VLSI Systems and Computations, H. T. Kung, B. Sproull, and G. Steele, eds. Computer Science Press, Rockville, Md., pp. 186-195.