How much can hardware help routing?

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 573-582

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

^a UNIVERSITY OF TORONTO   (Canada)

^b IBM RESEARCH   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; CRITICAL PATH ANALYSIS; DATA PROCESSING; RANDOM PROCESSES;

ADAPTIVE ROUTING; COMPLEX HARDWARE; HARDWARE PARAMETERS; OBLIVIOUS ROUTING; PERMUTATION ROUTING; SPEED UP; TIME BOUND; TIME STEP;

HARDWARE; COMPUTER HARDWARE;

PERMUTATION ROUTING PROBLEM;

EID: 0027150666     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167237     Document Type: Conference Paper

References (14)

1. B. Aiello, F.T. Leighton, B. Maggs, and M. Newman. Fast algorithms for bit-serial routing on a hypercube. In Proc. of the 2nd An-nual ACM Symposium on Parallel Algorithms and Architectures, pages 55-64, 1990.
2. M. Ajtai, J. Komlos, and E. Szemeredi. Sorting in clogn parallel steps. Combinatorica, 3(1):1- 19, 1983.
3. R. Aleliunas. Randomized parallel communica-Tion. In Proc. of the 1st Annual ACM-SIGOPS Symposium on Principles of Distributed Com-puting, pages 60-72, 1982.
4. A. Borodin and J. E. Hopcroft. Routing, merg-ing, and sorting on parallel models of compu-Tation. Journal of Computer and System Sci-ences, 30:130-145, 1985.
5. P. Green. The future of fiber-optic computer networks. IEEE Computer, 24:78-89, 1991.
6. C. Kaklamanis, D. Krizanc, and T. Tsantilas. Tight bounds for oblivious routing in the hy-percube. In Proc. of the 3rd Annual ACM Sym-posium on Parallel Algorithms and Architec-Tures,, pages 31-36, 1991.
7. F.T. Leighton. Tight bounds on the complex-ity of parallel sorting. IEEE Transactions on Computers, 0-34:344-354, 1985.
8. F.T. Leighton and B. Maggs. Expanders might be practical: Fast algorithms for rout-ing around faults in multibutterfiies. In Proc. of the 30th Annual Symposium on Foundations of Computer Science, pages 384-389, 1989.
9. D. Peleg and E. Upfal. The token distribu-Tion problem. SIAM Journal on Computing, 18:229-243, 1989.
10. R. Ramaswami. Multiwavelength lightwave networks for computer communications. IEEE Communications Magazine, 31(2):78-88, Feb-ruary, 1993.
11. E. Upfal. Efficient schemes for parallel com-munication. Journal of the ACM, 31:507-517, 1984.
12. E. Upfal. An O(log N) deterministic packet routing scheme. Journal of the ACM, pages 55-70, 1992.
13. L. G. Valiant and G. J. Brebner. Universal schemes for parallel communication. In Proc. of the 13th Annual ACM Symposium on The-ory of Computing, pages 263-277, Milwaukee, Wisconsin, May 1981.
14. A. C-C. Yao. Probabilistic computations: To-wards a unified measure of complexity. In Proc. of the 11th Annual Symposium on Foundations of Computer Science, pages 222-227, 1977.