Abstract
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.
Work partially funded by the Picasso research program between France and Spain, the COLOR VLGDB project at INRIA Sophia-Antipolis Méditerranée, the Ministry of Science and Innovation of Spain (grant numbers TIN2009-14560-C03-03 and JC2009-00305) and Generalitat de Catalunya (grant number GRC-1087).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ashcraft, C., Liu, J.W.H.: Using domain decomposition to find graph bisectors. BIT Numerical Mathematics 37(3), 506–534 (1997)
Battiti, R., Bertossi, A.A.: Greedy, prohibition, and reactive heuristics for graph partitioning. IEEE Trans. Comput. 48(4), 361–385 (1999)
Chakrabarti, D., Faloutsos, C.: Graph mining: Laws, generators, and algorithms. ACM Computing Surveys (CSUR) 38(1), 2 (2006)
Demetrescu, C., Goldberg, A.V., Johnson, D.S.: 9th dimacs challenge 9 benchmark platform, version 1.1(october 30, 2006), http://www.dis.uniroma1.it/~challenge9
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)
Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)
Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. The Bell system technical journal 49(1), 291–307 (1970)
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)
Özsu, M.T., Valduriez, P.: Principles of distributed database systems, 2nd edn. Prentice-Hall, Inc., Upper Saddle River (1999)
Sanchis, L.A.: Multiple-way network partitioning. IEEE Trans. Comput. 38(1), 62–81 (1989)
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Muntés-Mulero, V., Martínez-Bazán, N., Larriba-Pey, JL., Pacitti, E., Valduriez, P. (2010). Graph Partitioning Strategies for Efficient BFS in Shared-Nothing Parallel Systems. In: Shen, H.T., et al. Web-Age Information Management. WAIM 2010. Lecture Notes in Computer Science, vol 6185. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16720-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-16720-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16719-5
Online ISBN: 978-3-642-16720-1
eBook Packages: Computer ScienceComputer Science (R0)