The Journal of Supercomputing

, Volume 3, Issue 3, pp 209–234

Hypercube computing: Connected components

  • Jinwoon Woo
  • Sartaj Sahni


Several approaches to finding the connected components of a graph on a hypercube multicomputer are proposed and analyzed. The results of experiments conducted on an NCUBE hypercube are also presented. The experimental results support the analysis.

Key words and phrases

Hypercube computing MIMD computer parallel programming connected components 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Carlson, D. 1987. Fast, near-optimal VLSI algorithm for the connected components problem. IEEE International Conf. on Computer Design: VLSI in Computers and Processors, pp. 12–15.Google Scholar
  2. Dekel, E., Nassimi, D., and Sahni, S. 1981. Parallel matrix and graph algorithm. SIAM J. on Computing, 11, 4 (Nov.), 657–675.Google Scholar
  3. Geist, G.A., and Heath, M.T. 1986. Matrix factorization on a hypercube multiprocessor. In Hypercube Multiprocessors 1986 (M.T. Heath, ed.), SIAM, pp. 161–180.Google Scholar
  4. Gopalakrishnan, P.S., Ramakrishnan, I.V., and Kanal, L.N. 1985. An efficient connected components algorithm on a mesh-connected computer. Proc. of the 1985 International Conf. on Parallel Processing, pp. 711–714.Google Scholar
  5. Gustafson, J. 1988. Reevaluating Amdahl's Law. CACM, 31, 5 (May), 532–533.Google Scholar
  6. Hirschberg, D.S., Chandra, A.K., and Sarwate, D.V. 1979. Computing connected components on parallel computers. Communications of the ACM, 22: 461–464.Google Scholar
  7. Horowitz, E., and Sahni, S. 1986. Fundamentals of data structures in Pascal, 2nd ed. Computer Science Press, Md.Google Scholar
  8. Huang, M. 1985. Solving some graph problems with optimal or near optimal speedup on mesh-of-trees network. In Proc., 26th IEEE Symposium on the Foundations of Computer Science, pp. 232–240.Google Scholar
  9. Jenq, J., and Sahni, S. 1987. All pairs shortest paths on a hypercube multiprocessor. In Proc. of the 1987 International Conf. on Parallel Processing, pp. 713–716.Google Scholar
  10. Kumar, V., Nageshwara, V., and Ramesh, K. 1988. Parallel depth first search on the ring architecture. In Proc. of the 1988 International Conf. on Parallel Processing, Penn State Univ. Press, pp. 128–132.Google Scholar
  11. Lai, T., and Sahni, S. 1984. Anomalies in parallel branch and bound algorithms. Communications of the ACM, 27: 594–602.Google Scholar
  12. Li, G., and Wah, B. 1986. Coping with anomalies in parallel branch-and-bound algorithms. IEEE Trans. on Computers, C-35, 6 (June), 568–572.Google Scholar
  13. Nassimi, D., and Sahni, S. 1980. Finding connected components and connected ones on a mesh-connected computer. SIAM J. on Computing, 9, 4 (Nov.), 744–757.Google Scholar
  14. Nassimi, D., and Sahni, S. 1981. Data broadcasting in SIMD computers. IEEE Trans. on Computers, C-30, 2 (Feb.), 101–107.Google Scholar
  15. Quinn, M., and Deo, N. 1986. An upper bound for the speedup of parallel branch-and-bound algorithms. BIT, 26, 1 (Mar.), 35–43.Google Scholar
  16. Ranka, S., Won, Y., and Sahni, S. 1988. Programming a hypercube multicomputer. IEEE Software, 5, 5 (Sept.) 69–77.Google Scholar
  17. Shiloach, Y., and Vishkin, U. 1982. An O(log n) parallel connectivity algorithm. J. of Algorithms, 3: 57–67.Google Scholar
  18. Won, Y., and Sahni, S. 1987. Maze routing on a hypercube multiprocessor computer. Proc. of the 1987 International Conf. on Parallel Processing, The Penn. State Univ. Press, pp. 630–637.Google Scholar

Copyright information

© Kluwer Academic Publishers 1989

Authors and Affiliations

  • Jinwoon Woo
    • 1
  • Sartaj Sahni
    • 1
  1. 1.Department of Computer ScienceUniversity of MinnesotaMinneapolisUSA

Personalised recommendations