An optimal time bound for oblivious routing
- 63 Downloads
The problem of routing data packets in a constant-degree network is considered. A routing scheme is calledoblivious if the route taken by each packet is uniquely determined by its source and destination. The time required for the oblivious routing ofn packets onn processors is known to be Θ(√n). It is demonstrated that the presence of extra processors can expedite oblivious routing. More specifically, the time required for the oblivious routing ofn packets onp processors is Θ(n/√p + logn).
Key wordsNormal algorithm Oblivious Parallel computation Routing Shuffle-exchange
Unable to display preview. Download preview PDF.
- A. Borodin and J. E. Hopcroft, Routing, merging and sorting on parallel models of computation,Proc. 14th Ann. ACM Symp. on Theory of Computing, San Francisco, CA, May 1982.Google Scholar
- A. Gottlieb, R. Grishman, C. P. Kruskal, K. P. McAuliffe, L. Rudolph, and M. Snir, The NYU ultracomputer-designing an MIMD shared memory parallel computer,IEEE Trans. Comput., vol. 32, no. 2, Feb. 1983.Google Scholar
- T. Lang, Interconnections between processors and memory modules using the shuffle-exchange network,IEEE Trans. Comput., vol. 25, no. 5, May 1976.Google Scholar
- I. Parberry, A complexity theory of parallel computation, PH.D. Thesis, Department of Computer Science, University of Warwick, May 1984.Google Scholar
- I. Parberry,Parallel Complexity Theory, Research Notes in Theoretical Computer Science, Pitman, London, 1987.Google Scholar