How much can hardware help routing?

Journal of the ACM

Volumn 44, Issue 5, 1997, Pages 726-741

  Borodin, Allan ^a   Raghavan, Prabhakar ^b   Schieber, Baruch ^c   Upfal, Eli ^b,d  

^a UNIVERSITY OF TORONTO   (Canada)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

^d WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; COMPUTER NETWORKS; DATA COMMUNICATION SYSTEMS;

MULTI PORT; PACKET ROUTING; PERMUTATION ROUTING; SINGLE PORT;

COMPUTER HARDWARE;

EID: 0031222396     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/265910.265922     Document Type: Article

References (17)

1. AIELLO, B., LEIGHTON, F. T., MAGGS, B., AND NEWMAN, M. 1991. Fast algorithms for bit-serial routing on a hypercube. Math. Syst. Theory 29, 253-271.
2. AJTAI, M., KOMLÓS, J., AND SZEMERÉDI, E. 1983. Sorting in c log n parallel steps. Combinatorica 3, 1, 1-19.
3. ALELIUNAS, R. 1982. Randomized parallel communication. In Proceedings of the 1st Annual ACM-SIGOPS Symposium on Principles of Distributed Computing (Ottawa, Ont., Canada, Aug. 18-20). ACM, New York, pp. 60-72.
4. BORODIN, A., AND HOPCROFT, J. E. 1985. Routing, merging, and sorting on parallel models of computation. J. Comput. Syst. Sci. 30, 130-145.
5. BORODIN, A., RAGHAVAN, P., SCHIEBER, B., AND UPFAL, E. 1993. How much can hardware help routing? In Proceedings of the 25th Annual Symposium on Theory of Computing (San Diego, Calif., May 16-18). ACM, New York, pp. 573-582.
6. FELPERIN, S., RAGHAVAN, P., AND UPFAL, E. 1996. A theory of wormhole routing in parallel computers. IEEE Trans. Comput. 45, 704-713.
7. GREEN, P. 1991. The future of fiber-optic computer networks. IEEE Comput. 24, 78-89.
8. HOEFFDING, W. 1958. On the distribution of the number of successes in independent trials. Ann. Math. Stat. 27, 713-721.
9. KAKLAMANIS, C., KRIZANC, D., AND TSANTILAS, T. 1991. Tight bounds for oblivious routing in the hypercube. Math. Syst. Theory 24, 223-232.
10. LEIGHTON, F. T. 1985. Tight bounds on the complexity of parallel sorting. IEEE Trans. Comput. C-34, 344-354.
11. LEIGHTON, F. T., AND MAGGS, B. 1989. Expanders might be practical: Fast algorithms for routing around faults in multibutterflies. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science. IEEE, New York, pp. 384-389.
12. PELEG, D., AND UPFAL, E. 1989. The token distribution problem. SIAM J. Comput. 18, 229-243.
13. RAMASWAMI, R. 1993. Multiwavelength lightwave networks for computer communications. IEEE Commun. Mag. 32, 2 (Feb.), 78-88.
14. UPFAL, E. 1984. Efficient schemes for parallel communication. J. ACM 31, 3 (July), 507-517.
15. UPFAL, E. 1992. An O(log N) deterministic packet routing scheme. J. ACM, 39, 1 (Mar.), 55-70.
16. VALIANT, L. G., AND BREBNER, G. J. 1981. Universal schemes for parallel communication. In Proceedings of the 13th Annual ACM Symposium on Theory of Computing, Milwaukee, Wis., May 11-13). ACM, New York, pp. 263-277.
17. YAO, A. C-C. 1977. Probabilistic computations: Towards a unified measure of complexity. In Proceedings of the 17th Annual Symposium on Foundations of Computer Science. IEEE, New York, pp. 222-227.