Abstract
We present efficient algorithms for solving several fundamental graph-theoretic problems on a Linear Array with a Reconfigurable Pipelined Bus System (LARPBS), one of the recently proposed models of computation based on optical buses. Our algorithms include finding connected components, minimum spanning forest, biconnected components, bridges and articulation points for an undirected graph. We compute the connected components and minimum spanning forest of a graph in O(log n) time using O(m+n) processors where m and n are the number of edges and vertices in the graph and m=O(n 2) for a dense graph. Both the processor and time complexities of these two algorithms match the complexities of algorithms on the Arbitrary and Priority CRCW PRAM models which are two of the strongest PRAM models. The algorithms for these two problems published by Li et al. [7] have been considered to be the most efficient on the LARPBS model till now. Their algorithm [7] for these two problems require O(log n) time and O(n 3/log n) processors. Hence, our algorithms have the same time complexity but require less processors. Our algorithms for computing biconnected components, bridges and articulation points of a graph run in O(log n) time on an LARPBS with O(n 2) processors. No previous algorithm was known for these latter problems on the LARPBS.
Similar content being viewed by others
References
B. Awerbuch and Y. Shiloach. New connectivity and MSF algorithms for shuffle-exchange network and PRAM. IEEE Trans. Computers, C-36(10):1258–1263, 1987.
R. Cole. Parallel merge sort. SIAM J. Computing, 17:770–785, 1988.
D. Chiarulli, R. Melhem, and S. Levitan. Using coincident optical pulses for parallel memory addressing. IEEE Trans. Computer, 20(12):48–58, 1987.
A. Datta, S. Soundaralakshmi, and R. Owens. Fast sorting algorithms on a linear array with a reconfigurable pipelined bus system. IEEE Trans. Parallel and Distributed Systems, 13(3):212–222, 2002.
J. JáJá. Introduction to Parallel Algorithms. Addison Wesley, Cambridge, MA, 1992.
S. Levitan, D. Chiarulli, and R. Melhem. Coincident pulse techniques for multiprocessor interconnection structures. Applied Optics, 29:2024–2039, 1990.
K. Li, Y. Pan, and M. Hamdi. Solving graph theory problems using reconfigurable pipelined optical buses. Parallel Computing, 26:723–735, 2000.
K. Li, Y. Pan, and S. Q. Zheng. Fast and processor ef.cient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system. IEEE Trans. Parallel and Distributed Systems, 9(8):705–720, 1998.
K. Li, Y. Pan, and S. Q. Zheng. Effcient deterministic and probabilistic simulations of PRAMs on linear arrays with reconfigurable pipelined bus systems. Journal of Supercomputing, 15:163–181, 2000.
R. Miller, V. K. Prasanna Kumar, D. Reisis, and Q. F. S tout. Parallel computations on reconfigurable meshes. IEEE Trans. Computers, 42:678–692, 1993.
Y. Pan and K. Li. Linear array with a reconfigurable pipelined bus system-concepts and applications. Information Sciences, 106:237–258, 1998.
S. Sahni. Models and algorithms for optical and optoelectronic parallel computers. International Journal of Foundations of Computer Science, 12(3):249–264, 2001.
Y. Shiloach and U. Vishkin. An O(log n) parallel connectivity algorithm. J. Algorithms, 3:57–67, 1982.
R. E. Tarjan and U. Vishkin. An efficient parallel biconnectivity algorithm. SIAM J. Computing, 144:862–874, 1985.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Datta, A. Efficient Graph-Theoretic Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System. The Journal of Supercomputing 23, 193–211 (2002). https://doi.org/10.1023/A:1016552512787
Issue Date:
DOI: https://doi.org/10.1023/A:1016552512787