• Publication
  • 1990
  • Issue No. 4 - October
  • Abstract - Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems
October 1990 (vol. 1 no. 4)
pp. 500-507

The transitive closure problem in O(1) time is solved by a new method that is far different from the conventional solution method. On processor arrays with reconfigurable bus systems, two O(1) time algorithms are proposed for computing the transitive closure of an undirected graph. One is designed on a three-dimensional n*n*n processor array with a reconfigurable bus system, and the other is designed on a two-dimensional n/sup 2/*n/sup 2/ processor array with a reconfigurable bus system, where n is the number ofvertices in the graph. Using the O(1) time transitive closure algorithms, many other graph problems are solved in O(1) time. These problems include recognizing bipartite graphs and finding connected components, articulation points, biconnected components, bridges, and minimum spanning trees in undirected graphs.

[1] A. Aggarwal, "optimal bounds for finding maximum on array of processors withkglobal buses,"IEEE Trans. Comput., vol. C-35, no. 1, pp. 62-64, Jan. 1986.
[2] M. Atallah and R. Kosaraju, "Graph problems on a mesh connected processor array,"J. Assoc. Comp. Mach., vol. 31, pp. 649-667, 1983.
[3] S. H. Bokhari, "Finding maximum on an array processor with a global buses,"IEEE Trans. Comput., vol. C-33. no. 2, pp. 133-139, Feb. 1984.
[4] D. M. Champion and J. Rothstein, "Immediate parallel solution of the longest common subsequence problem," inProc. 1987 Int. Conf. Parallel Processing, Aug. 1987, pp. 70-77.
[5] F. Y. Chin, J. Lam, and I-Ngo Chen, "Efficient parallel algorithms for some graph problems,"CACM, vol. 25, pp. 659-665, 1982.
[6] E. Dekel, D. Nassimi, and S. Sahni, "Parallel matrix and graph algorithms,"SIAM J. Comput., vol. 10, no. 4, pp. 657-675, Nov. 1981.
[7] K. A. Doshi and P. J. Varman, "Optimal graph algorithms on a fixed-size linear arrays,"IEEE Trans. Comput., vol. C-36, no. 4, 1987.
[8] S. E. Hambrusch, "VLSI algorithms for the connected component problem,"SIAM J. Comput., vol. 12, no. 3, pp. 354-365, May 1983.
[9] D. S. Hirschberg, "Parallel graph algorithms without memory conflicts," inProc. 20th Annu. Allerton Conf. Commun. Contr. Comput., 1982, pp. 257-263.
[10] D. S. Hirschberg, A. K. Chandra, and D. V. Sarwate, "Computing connected components on parallel computers,"Commun. Assoc. Comput. Mach., pp. 461-464, 1979.
[11] L. Kucera, "Parallel computation and conflicts in memory access,"Inform. Processing Lett., vol. 14, no. 2, pp. 93-96, Apr. 1982.
[12] H. Li and M. Maresca, "Polymorphic-torus architecture for computer vision,"IEEE Trans. Pattern Anal. Machine Intell., vol. 11, no. 3, pp. 233-243, Mar. 1989.
[13] H. Li and M. Maresca, "Polymorphic-torus network,"IEEE Trans. Comput., vol. 8, no. 9, pp. 1345-1351, Sept. 1989.
[14] M. Maresca and H. Li, "Connection autonomy in SIMD computers: A VLSI implementation,"J. Parallel Distrib. Computing, vol. 7, pp. 302-320, 1989.
[15] P. McKinley, "Multicast routing in spanning bus hypercubes," inProc. 1988 Int. Conf. Parallel Processing, vol. 2, Aug. 1988, pp. 204-211.
[16] J. R. Melby, "Recognition of straight lines by bus automata using parallel processing," Ph.D. dissertation, Ohio State Univ., 1980.
[17] R. Miller, V. K. Prasanna Kumar, D. Reisis, and Q. F. Stout, "Meshes with reconfigurable buses," inProc. 5th MIT Conf. Advanced Res. VLSI(Cambridge, MA), 1988, pp. 163-178.
[18] R. Miller, V. K. Prasanna Kumar, D. Reisis, and Q. F. Stout, "Data movement operations and applications on reconfigurable VLSI arrays, " inProc. Int. Conf. Parallel Processing, vol. 1, Aug. 1988, pp. 205-208.
[19] R. Miller, V. K. Prasanna Kumar, D. Reisis, and Q. F. Stout, "Image computations on reconfigurable VLSI arrays," inProc. IEEE Comput. Soc. Conf. Comput. Vision Pattern Recognition, 1988, pp. 925-930.
[20] R. Miller and Q. F. Stout, Efficient parallel convex hull algorithms,"IEEE Trans. Comput., vol. C-37, no. 12, pp. 1605-1618, Dec. 1988.
[21] J. M. Moshell and J. Rothstein, "Bus automata and immediate languages,"Inform. Contr., vol. 40, no. 1, pp. 88-121, 1979.
[22] G. Nash, D. Shu, and M. Eshaghian, "Finding connected components in a gated connected VLSI network,"J. VLSI Signal processing, to be published.
[23] V. K. Prasanna Kumar and C. S. Raghavendra, "Array processor with multiple broadcasting,"J. Parallel Distributed Comput., vol. 4, pp. 173-190, 1987.
[24] J. Rothstein, "On the-ultimate limitations of parallel processing," inProc. Int. Conf. Parallel Processing, 1976, pp. 206-212, Best Paper Award.
[25] J. Rothstein, "Toward pattern-recognizing visual prostheses," inProc. IFAC Symp. Contr. Aspects Prosthetics Orthotics, Columbus, 1982, pp. 87-89, published by Pergamon Press for the International Federation of Automatic Control.
[26] A. Agarwal, R.L. Sites, and M. Horowitz, "ATUM: A New Technique for Capturing Address Traces Using Microcode,"13th Int'l Symp. Computer Architecture, 1986, IEEE Computer Soc. Press, Los Alamitos, Calif., pp. 119-127.
[27] J. Rothstein and A. Davis, "Parallel recognition of parabolic and conic patterns by bus automata," inProc. Int. Conf. Parallel Processing, Aug. 1979, pp. 288-297.
[28] C. Savage and J. Ja'Ja', "Fast, efficient parallel algorithms for some graph problems,"SIAM J. Comput., vol. 10, no. 4, pp. 682-690, Nov. 1981.
[29] M. C. Sheng and H. Li, "Connected component labeling algorithm on polymorphic-torus architecture," inProc. Int. Comput. Symp., Taipei, Taiwan, Dec. 1988, pp. 440-443.
[30] Y. Shiloach and U. Vishkin, "AnO(logn) parallel connectivity algorithm,"J. Algorithms, vol. 3, no. 1, pp. 57-67, Mar. 1982.
[31] Q. F. Stout, "Mesh connected computers with broadcasting,"IEEE Trans. Comput., vol. C-32, no. 9, pp. 826-830, Sept. 1983.
[32] Q. F. Stout, "Tree-based graph algorithms for some parallel computers," inProc. Int. Conf. Parallel Processing, Aug. 1985, pp. 727-730.
[33] R. E. Tarjan and U. Vishkin, "An efficient parallel biconnectivity algorithm,"SIAM J. Comput., vol. 14, no. 4, pp. 862-874, Aug. 1985.
[34] Y. H. Tsin and Y. F. Chin, "Efficient parallel algorithms for a class of graph theoretic problems,"SIAM J. Comput., vol. 13, no. 3, pp. 580-599, May 1984.
[35] F. L. Van Scoy, "The parallel recognition class of graphs,"IEEE Trans. Comput., vol. C-29, no. 7, pp. 563-570, July 1980.
[36] B. F. Wang and G. H. Chen, "Two-dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model,"Inform. Processing Lett., vol. 36, pp. 31-36, 1990.
[37] B. F. Wang and G. H. Chen, "Constant time graph algorithms on processor arrays with reconfigurable bus systems," Tech. Rep., Dep. Comput. Sci. Inform. Eng., National Taiwan Univ., 1990.
[38] B. F. Wang and G. H. Chen, "Constant time algorithms for sorting and computing convex hulls," Tech. Rep., Dep. Comput. Sci. Inform. Eng., National Taiwan Univ., 1990.
[39] B. F. Wang, G. H. Chen, and F. C. Lin, "Constant time sorting on a processor array with a reconfigurable bus systems,"Info. Processing Letts., pp. 187-192, 1990.
[40] B. F. Wang, C. J. Lu, and G. H. Chen, "The algebraic path problem on processor arrays with reconfigurable bus systems," submitted for publication.
[41] C. C. Weems, S. P. Levitan, A. R. Hanson, E. M. Riseman, J. G. Nash, and D. B. Shu, "The image understanding architecture," COINS Tech. Rep. 87-76, Univ. Massachusetts, Amherst.
[42] D. Y. Yeh and D. T. Lee, "Graph algorithms on a tree-structured parallel computer,"BIT, vol. 24, pp. 333-340, 1984.

Index Terms:
Index Termstransitive closure; related graph problems; processor arrays; reconfigurable bus systems; transitive closure; undirected graph; graph problems; bipartite graphs; connected components; articulation points; biconnected components; bridges; minimum spanning trees; graph theory; parallel algorithms
Citation:
B.F. Wang, G.H. Chen, "Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 1, no. 4, pp. 500-507, Oct. 1990, doi:10.1109/71.80177
Usage of this product signifies your acceptance of the Terms of Use.