Abstract
In a typical parallel or distributed computation model processors are connected by a spars interconnection network. To establish open-line communication between pairs of processors that wish to communicate interactively, a set of disjoint paths has to be constructed on the network. Since communication needs vary in time, paths have to be dynamically constructed and destroyed.
We study the complexity of constructing disjoint paths between given pairs of vertices on expander interconnection graphs. These graphs have been shown before to possess desirable properties for other communication tasks.
We present a sufficient condition for the existence ofK≦n Q edge-disjoint paths connecting any set ofK pairs of vertices on an expander graph, wheren is the number of vertices andϱ<1 is some constant. We then show that the computational problem of constructing these paths lies in the classes Deterministic-P and Random-P C.
Furthermore, we show that the set of paths can be constructed in probabilistic polylog time in the parallel-distributed model of computation, in which then participating processors reside in the nodes of the communication graph and all communication is done through edges of the graph. Thus, the disjoint paths are constructed in the very computation model that uses them.
Finally, we show how to apply variants of our parallel algorithms to find sets ofvertex-disjoint paths when certain conditions are satisfied.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ajtai M.,KomlŐs J. andSzemerédi E., AnO(n logn) Sorting Network,15th Symp. on Theory of Computing,1983, 1–9.
R.Aleliunas, Randomized Parallel Communication,1st Symp. on Principles of Distributed Computing,1982, 60–72.
N. Alon, Eigenvalues and Expanders,Combinatorica,6 (1986), 83–96.
P.Feldman, J.Friedman and N.Pippenger, Non-Blocking Networks,18th Symp. on Theory of Computing,1986, 247–254.
J.Friedman and N.Pippenger, Expanding Graphs Contain All Small Trees,Report RJ 5145 (53485),IBM Almaden Research, May1986.
M. R. Garey andD. S. Johnson,Computers and Intractability; a Guide to the Theory of NP-Completeness, W. H. Freeman and Co., San-Francisco,1979.
A. R.Karlin and E.Upfal, Parallel Hashing — an Efficient Implementation of Shared Memory,18th Symp. on Theory of Computing,1986, 160–168.
R. M. Karp, E. Upfal andA. Wigderson, Constructing Perfect Matching is in Random-N C,Combinatorica,6 (1986), 35–48.
E. L.Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, 1976.
A.Lubotzky, R.Phillips and P.Sarnak, Ramanugan Conjecture and Explicit Constructions of Expanders,18th Symp. on Theory of Computing,1986, 240–246.
K.Mulmuley, U. V.Vazirani and V. V.Vazirani, Matching is as Easy as Matrix Inversion,19th Symp. on Theory of Computing,1987, 345–354.
N.Pippenger, Parallel Communication with Bounded Buffers,25th Symp. on Foundations of Computer Science,1984, 127–136.
D.Peleg and U.Upfal, The Token Distribution Problem,26th Symp. on Foundations of Computer Science,1986, 418–427.
N.Robertson and P. D.Seymour, Graph Minors-XIII; Vertex-Disjoint Paths,Manuscript.1986.
E.Senata,Non-negative Matrices and Markov Chains, Springer-Verlag,1973.
E.Shamir and A.Schuster, Parallel Routing in Networks: Back to Circuit Switching?,Manuscript,1986.
L. Valiant, A Scheme for Fast Parallel Communication,SIAM J. on Computing,11 (1982), 350–361.
Author information
Authors and Affiliations
Additional information
Supported in part by a Weizmann fellowship and by contract ONR N00014-85-C-0731.