Graph Partitioning Strategies for Efficient BFS in Shared-Nothing Parallel Systems

  • Victor Muntés-Mulero
  • Norbert Martínez-Bazán
  • Josep-Lluís Larriba-Pey
  • Esther Pacitti
  • Patrick Valduriez
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6185)


Traversing massive graphs as efficiently as possible is essential for many applications. Many common operations on graphs, such as calculating the distance between two nodes, are based on the Breadth First Search traversal. However, because of the exhaustive exploration of all the nodes and edges of the graph, this operation might be very time consuming. A possible solution is distributing the graph among the nodes of a shared-nothing parallel system. Nevertheless, this operation may generate a large amount of inter-node communication. In this paper, we propose two graph partitioning techniques and improve previous distributed versions of BFS in order to reduce this communication.


Distributed Graphs Graph Partitioning Distributed BFS Graph Databases 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ashcraft, C., Liu, J.W.H.: Using domain decomposition to find graph bisectors. BIT Numerical Mathematics 37(3), 506–534 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Battiti, R., Bertossi, A.A.: Greedy, prohibition, and reactive heuristics for graph partitioning. IEEE Trans. Comput. 48(4), 361–385 (1999)CrossRefGoogle Scholar
  3. 3.
    Chakrabarti, D., Faloutsos, C.: Graph mining: Laws, generators, and algorithms. ACM Computing Surveys (CSUR) 38(1), 2 (2006)CrossRefGoogle Scholar
  4. 4.
    Demetrescu, C., Goldberg, A.V., Johnson, D.S.: 9th dimacs challenge 9 benchmark platform, version 1.1(october 30, 2006),
  5. 5.
    Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: DAC 1982: Proceedings of the 19th Design Automation Conference, pp. 175–181. IEEE Press, Piscataway (1982)Google Scholar
  6. 6.
    Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)zbMATHGoogle Scholar
  7. 7.
    Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. The Bell system technical journal 49(1), 291–307 (1970)CrossRefzbMATHGoogle Scholar
  8. 8.
    Martínez-Bazan, N., Muntés-Mulero, V., Gómez-Villamor, S., Nin, J., Sánchez-Martínez, M.-A., Larriba-Pey, J.-L.: Dex: high-performance exploration on large graphs for information retrieval. In: CIKM 2007: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management, pp. 573–582. ACM, New York (2007)CrossRefGoogle Scholar
  9. 9.
    Özsu, M.T., Valduriez, P.: Principles of distributed database systems, 2nd edn. Prentice-Hall, Inc., Upper Saddle River (1999)Google Scholar
  10. 10.
    Sanchis, L.A.: Multiple-way network partitioning. IEEE Trans. Comput. 38(1), 62–81 (1989)CrossRefzbMATHGoogle Scholar
  11. 11.
    Trissl, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In: SIGMOD 2007: Proceedings of the 2007 ACM SIGMOD international conference on Management of data, pp. 845–856. ACM, New York (2007)CrossRefGoogle Scholar
  12. 12.
    van Helden, J., Naim, A., Mancuso, R., Eldridge, M., Wernisch, L., Gilbert, D., Wodak, S.: Representing and analysing molecular and cellular function using the computer. Biological Chemistry 381(i9–10), 921–935 (2000)Google Scholar
  13. 13.
    Yoo, A., Chow, E., Henderson, K., McLendon, W., Hendrickson, B., Catalyurek, U.: A scalable distributed parallel breadth-first search algorithm on bluegene/l. In: SC 2005: Proceedings of the, ACM/IEEE conference on Supercomputing, p. 25. IEEE Computer Society, Washington (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Victor Muntés-Mulero
    • 1
  • Norbert Martínez-Bazán
    • 1
  • Josep-Lluís Larriba-Pey
    • 1
  • Esther Pacitti
    • 2
  • Patrick Valduriez
    • 2
  1. 1.DAMA-UPC, Departament d’Arquitectura de ComputadorsUniversitat Politécnica de CatalunyaBarcelona
  2. 2.INRIA and LIRMMMontpellierFrance

Personalised recommendations