论文信息 - Tight bounds for oblivious routing in the hypercube

Tight bounds for oblivious routing in the hypercube

We prove that in anyN-node communication network with maximum degreed, any deterministic oblivious algorithm for routing an arbitrary permutation requires Ω(√N/d) parallel communication steps in the worst case. This is an improvement upon the Ω(√N/d3/2) bound obtained by Borodin and Hopcroft. For theN-node hypercube, in particular, we show a matching upper bound by exhibiting a deterministic oblivious algorithm that routes any permutation in Θ(√N/logN) steps. The best previously known upper bound was Θ(√N). Our algorithm may be practical for smallN (up to about 214 nodes).

Christos Kaklamanis | Danny Krizanc | Thanasis Tsantilas

[1] Leslie G. Valiant,et al. A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[2] Jacques Aubert,et al. Decomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens , 1982, Discret. Math..

[3] Allan Borodin,et al. Routing, Merging, and Sorting on Parallel Models of Computation , 1985, J. Comput. Syst. Sci..

[4] Leslie G. Valiant,et al. Universal schemes for parallel communication , 1981, STOC '81.

[5] Romas Aleliunas,et al. Randomized parallel communication (Preliminary Version) , 1982, PODC '82.

[6] Danny Krizanc. Oblivious Routing with Limited Buffer Capacity , 1991, J. Comput. Syst. Sci..

[7] Michael O. Rabin,et al. Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[8] Eli Upfal,et al. Efficient schemes for parallel communication , 1982, PODC '82.

[9] Frank Thomson Leighton,et al. Coding theory, hypercube embeddings, and fault tolerance , 1991, SPAA '91.

[10] Eli Upfal,et al. A time-randomness tradeoff for oblivious routing , 1988, STOC '88.

[11] Jeffrey D Ullma. Computational Aspects of VLSI , 1984 .