Solving cheap graph problems on Meshes

  • Jop F. Sibeyn
  • Michael Kaufmann
Contributed Papers Distributed Computation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 969)


Efficient mesh algorithms exist for ‘expensive’ graph problems like transitive closure and computing all shortest paths, taking O(n) time on an n×n mesh for a graph with n vertices. This is work-optimal. On the other hand, there are so far no efficient algorithms for ‘cheap’ graph problems like finding the connected components, constructing a minimum spanning tree, or finding a path between a pair of vertices. These problems are cheap in the sense that sequentially they can be solved in time (almost) linear in n and m, where m is the number of edges.

In this paper we show that the mentioned cheap problems can be solved on an √N×√N mesh in O((n·m/N)1/2+ log n· (√N+m/N)) time. We derive a lower bound of Ω((n·m/N)1/2+√N+m/N). Hence, the algorithms have optimal time order for most n,m and N. The algorithms are work-optimal to within a factor log n for N≤m/n.


Span Tree Minimum Span Tree List Ranking Sparse Graph Graph Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Atallah, M.J., S.E. Hambrusch, ‘Solving Tree Problems on a Mesh-Connected Processor Array,’ Information and Control, 69, pp. 168–187, 1986.CrossRefGoogle Scholar
  2. 2.
    Atallah M.J., S.R. Kosaraju, ‘Graph Problems on a Mesh-Connected Processor Array,’ Journal of the ACM, 31(3), pp. 649–667, 1984.Google Scholar
  3. 3.
    Chin, F.Y., J. Lam, I. Chen, ‘Efficient Parallel Algorithms for some Graph Problems,’ Communications of the ACM, 25(9), pp. 659–665, 1982.Google Scholar
  4. 4.
    Gibbons, A.M., Y. N. Srikant, ‘A Class of Problems Efficiently Solvable on Mesh-Connected Computers Including Dynamic Expression Evaluation,’ International Processing Letters, 32, pp. 305–311, 1989.Google Scholar
  5. 5.
    Greiner, J., ‘A Comparison of Parallel Algorithms for Connected Components,’ Proc 6th Symp. on Par. Algs and Architectures, pp. 16–25, ACM, 1994.Google Scholar
  6. 6.
    Hambrusch, S.E., ‘VLSI Algorithms for the Connected Components Problem,’ SIAM Journal on Computing, 12, pp. 354–365, 1983.Google Scholar
  7. 7.
    Han, Y., R.A. Wagner, ‘An Efficient and Fast Parallel-Connected Component Algorithm,’ Journal of the ACM, Vol. 37, No. 3, pp. 626–642, 1990.Google Scholar
  8. 8.
    Hirschberg, D.S., A.K. Chandra, D.V. Sarwate, ‘Computing Connected Components on Parallel Computers,’ Communications of the ACM, 22(8), pp. 461–464, 1979.Google Scholar
  9. 9.
    JáJá, J., An Introduction to Parallel Algorithms, Addison-Wesley, 1992.Google Scholar
  10. 10.
    Kaufmann, M., J.F. Sibeyn, T, Suel, ‘Derandomizing Algorithms for Routing and Sorting on Meshes,’ Proc. Symp. on Discrete Algorithms, pp. 669–679, ACM-SIAM, 1994.Google Scholar
  11. 11.
    Kunde, M., ‘Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound,’ Proc. European Symp. on Algorithms, LNCS 726, pp. 272–283, Springer-Verlag, 1993.Google Scholar
  12. 12.
    Nassimi, D., S. Sahni, ‘Finding Connected Components and Connected Ones On a Mesh-Connected Parallel Computer,’ SIAM Journal of Computing, Vol. 9, No. 4, 1980.Google Scholar
  13. 13.
    Ryu, K.W., J. JáJá, ‘Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube,’ IEEE Trans. Par. and Dist. Systems, pp. 83–90, 1990.Google Scholar
  14. 14.
    Sibeyn, J.F., ‘Independent Sets and List Ranking on Meshes,’ Proc. Computing Science in the Netherlands, pp. 271–280, SION, Amsterdam, 1994.Google Scholar
  15. 15.
    Sibeyn, J.F., ‘Desnakification of Mesh Sorting Algorithms,’ Proc. 2nd European Symp. on Algorithms, LNCS 855, pp. 377–390, Springer-Verlag, 1994.Google Scholar
  16. 16.
    Sibeyn, J.F., M. Kaufmann, ‘Solving Cheap Graph Problems on Meshes,’ Technical Report WSI-95-9, Wilhelm-Schickard-Institut für Informatik, Tübingen, 1995.Google Scholar
  17. 17.
    Sibeyn, J.F., M. Kaufmann, ‘Deterministic 1-k Routing on Meshes,’ Proc. 11th Symp. on Theoretical Aspects of Computer Science, LNCS 775, pp. 237–248, Springer, 1994.Google Scholar
  18. 18.
    Shiloach, Y., U. Vishkin, ‘An O(log n) Parallel Connectivity Algorithm,’ Journal of Algorithms, 3(1), pp. 57–67, 1982.CrossRefGoogle Scholar
  19. 19.
    Tarjan, R.E., U. Vishkin, ‘Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time,’ SIAM Journal of Computing, 13, pp. 862–874, 1985.MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Jop F. Sibeyn
    • 1
  • Michael Kaufmann
    • 2
  1. 1.Max-Planck-Institut für Informatik, Im StadtwaldSaarbrückenGermany
  2. 2.Fakultät InformatikUniversität TübingenTübingenGermany

Personalised recommendations