Fast Approximate Distance Queries in Unweighted Graphs Using Bounded Asynchrony

  • Adam Fidel
  • Francisco Coral Sabido
  • Colton Riedel
  • Nancy M. Amato
  • Lawrence Rauchwerger
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10136)

Abstract

We introduce a new parallel algorithm for approximate breadth-first ordering of an unweighted graph by using bounded asynchrony to parametrically control both the performance and error of the algorithm. This work is based on the \(k\)-level asynchronous (KLA) paradigm that trades expensive global synchronizations in the level-synchronous model for local synchronizations in the asynchronous model, which may result in redundant work. Instead of correcting errors introduced by asynchrony and redoing work as in KLA, in this work we control the amount of work that is redone and thus the amount of error allowed, leading to higher performance at the expense of a loss of precision. Results of an implementation of this algorithm are presented on up to 32,768 cores, showing 2.27x improvement over the exact KLA algorithm and 3.8x improvement over the level-synchronous version with minimal error on several graph inputs.

Keywords

Parallel graph algorithms Breadth-first search Distance query Approximate algorithms Asynchronous Distributed memory 

References

  1. 1.
    The graph 500 list (2011). http://www.graph500.org
  2. 2.
    Stanford large network dataset collection (2013). http://snap.stanford.edu/data/index.html
  3. 3.
    Avery, C.: Giraph: large-scale graph processing infrastructure on hadoop. In: Hadoop Summit (2011)Google Scholar
  4. 4.
    Baswana, S., Kavitha, T.: Faster algorithms for all-pairs approximate shortest paths in undirected graphs. SIAM J. Comput. 39(7), 2865–2896 (2010)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Baswana, S., Sen, S.: Approximate distance oracles for unweighted graphs in expected O(n2) time. ACM Trans. Algorithms 2(4), 557–577 (2006)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Beamer, S., Asanović, K., Patterson, D.: Direction-optimizing breadth-first search. In: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, SC 2012, pp. 12:1–12:10. IEEE Computer Society Press, Los Alamitos (2012)Google Scholar
  7. 7.
    Becchetti, L., Boldi, P., Castillo, C., Gionis, A.: Efficient algorithms for large-scale local triangle counting. ACM Trans. Knowl. Discov. Data 4(3), 13:1–13:28 (2010)CrossRefGoogle Scholar
  8. 8.
    Buluç, A., Beamer, S., Madduri, K., Asanović, K., Patterson, D.: Distributed-memory breadth-first search on massive graphs. In: Bader, D. (ed.) Parallel Graph Algorithms. CRC Press (2015)Google Scholar
  9. 9.
    Buluç, A., Madduri, K.: Parallel breadth-first search on distributed memory systems. In: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2011, pp. 65:1–65:12. ACM, New York (2011)Google Scholar
  10. 10.
    Buss, A.A., Harshvardhan, Papadopoulos, I., Pearce, O., Smith, T.G., Tanase, G., Thomas, N., Xu, X., Bianco, M., Amato, N.M., Rauchwerger, L.: STAPL: standard template adaptive parallel library. In: Proceedings of SYSTOR 2010: The 3rd Annual Haifa Experimental Systems Conference, Haifa, Israel, 24–26 May 2010, pp. 1–10. ACM, New York (2010)Google Scholar
  11. 11.
    Ceccarello, M., Pietracaprina, A., Pucci, G., Upfal, E.: Space and time efficient parallel graph decomposition, clustering, and diameter approximation. In: Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, pp. 182–191. ACM, New York (2015)Google Scholar
  12. 12.
    Gregor, D., Lumsdaine, A.: The parallel BGL: a generic library for distributed graph computations. In: Parallel Object-Oriented Scientific Computing (POOSC), July 2005Google Scholar
  13. 13.
    Gubichev, A., Bedathur, S., Seufert, S., Weikum, G.: Fast and accurate estimation of shortest paths in large graphs. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management, CIKM 2010, pp. 499–508. ACM, New York (2010)Google Scholar
  14. 14.
    Harshvardhan, Fidel, A., Amato, N.M., Rauchwerger, L.: The STAPL parallel graph library. In: Kasahara, H., Kimura, K. (eds.) LCPC 2012. LNCS, vol. 7760, pp. 46–60. Springer, Berlin Heidelberg (2012)CrossRefGoogle Scholar
  15. 15.
    Harshvardhan, Fidel, A., Amato, N.M., Rauchwerger, L.: KLA: a new algorithmic paradigm for parallel graph computations. In: Proceedings of the International Conference on Parallel Architecture and Compilation Techniques (PACT), PACT 2014, pp. 27–38. ACM, New York (2014). Conference Best Paper AwardGoogle Scholar
  16. 16.
    Harshvardhan, Fidel, A., Amato, N.M., Rauchwerger, L.: An algorithmic approach to communication reduction in parallel graph algorithms. In: Proceedings of the International Conference Parallel Architecture and Compilation Techniques (PACT), PACT 2015, pp. 201–212. IEEE, San Francisco (2015). Finalist for Conference Best Paper AwardGoogle Scholar
  17. 17.
    Hong, S., Chafi, H., Sedlar, E., Olukotun, K.: Green-Marl: a DSL for easy and efficient graph analysis. In: Proceedings of the Seventeenth International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2012, pp. 349–362. ACM, New York (2012)Google Scholar
  18. 18.
    Klein, P.N., Subramanian, S.: A randomized parallel algorithm for single-source shortest paths. J. Algorithms 25(2), 205–220 (1997)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Low, Y., Bickson, D., Gonzalez, J., Guestrin, C., Kyrola, A., Hellerstein, J.M.: Distributed graphlab: a framework for machine learning and data mining in the cloud. Proc. VLDB Endow. 5(8), 716–727 (2012)CrossRefGoogle Scholar
  20. 20.
    Malewicz, G., Austern, M.H., Bik, A.J., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 International Conference on Management of Data, SIGMOD 2010, pp. 135–146. ACM, New York (2010)Google Scholar
  21. 21.
    Méndez-Lojo, M., Nguyen, D., Prountzos, D., Sui, X., Hassaan, M.A., Kulkarni, M., Burtscher, M., Pingali, K.: Structure-driven optimizations for amorphous data-parallel programs. In: Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2010, pp. 3–14. ACM, New York (2010)Google Scholar
  22. 22.
    Nanongkai, D.: Distributed approximation algorithms for weighted shortest paths. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, STOC 2014, pp. 565–573. ACM, New York (2014)Google Scholar
  23. 23.
    Nelson, J., Holt, B., Myers, B., Briggs, P., Kahan, S., Ceze, L., Oskin, M.: Grappa: a latency-tolerant runtime for large-scale irregular application. In: WRSC 2014, April 2014Google Scholar
  24. 24.
    Nguyen, D., Lenharth, A., Pingali, K.: A lightweight infrastructure for graph analytics. In: Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, SOSP 2013, pp. 456–471. ACM, New York (2013)Google Scholar
  25. 25.
    Palmer, C.R., Gibbons, P.B., Faloutsos, C.: ANF: afast and scalable tool for data mining in massive graphs. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2002, pp. 81–90. ACM, New York (2002)Google Scholar
  26. 26.
    Pearce, R.A., Gokhale, M., Amato, N.M.: Multithreaded asynchronous graph traversal for in-memory and semi-external memory. In: Conference on High Performance Computing Networking, Storage and Analysis, SC 2010, New Orleans, LA, USA, 13–19 November 2010, pp. 1–11 (2010)Google Scholar
  27. 27.
    Qi, Z., Xiao, Y., Shao, B., Wang, H.: Toward a distance oracle for billion-node graphs. Proc. VLDB Endow. 7(1), 61–72 (2013)CrossRefGoogle Scholar
  28. 28.
    Qiao, M., Cheng, H., Chang, L., Yu, J.X.: Approximate shortest distance computing: a query-dependent local landmark scheme. IEEE Trans. Knowl. Data Eng. 26(1), 55–68 (2014)CrossRefGoogle Scholar
  29. 29.
    Shang, Z., Yu, J.X.: Auto-approximation of graph computing. Proc. VLDB Endow. 7(14), 1833–1844 (2014)CrossRefGoogle Scholar
  30. 30.
    Sommer, C.: Shortest-path queries in static networks. ACM Comput. Surv. 46(4), 45:1–45:31 (2014)CrossRefMATHGoogle Scholar
  31. 31.
    Tanase, G., Buss, A.A., Fidel, A., Harshvardhan, Papadopoulos, I., Pearce, O., Smith, T.G., Thomas, N., Xu, X., Mourad, N., Vu, J., Bianco, M., Amato, N.M., Rauchwerger, L.: The STAPL parallel container framework. In: Proceedings of the 16th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP 2011, San Antonio, TX, USA, 12–16 February 2011, pp. 235–246 (2011)Google Scholar
  32. 32.
    Thorup, M., Zwick, U.: Approximate distance oracles. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, STOC 2001, pp. 183–192. ACM, New York (2001)Google Scholar
  33. 33.
    Ullman, J., Yannakakis, M.: High-probability parallel transitive closure algorithms. In: Proceedings of the Second Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1990, pp. 200–209. ACM, New York (1990)Google Scholar
  34. 34.
    Valiant, L.: Bridging model for parallel computation. Comm. ACM 33(8), 103–111 (1990)CrossRefGoogle Scholar
  35. 35.
    Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. In: Nature, pp. 440–442 (1998)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Adam Fidel
    • 1
  • Francisco Coral Sabido
    • 1
  • Colton Riedel
    • 1
  • Nancy M. Amato
    • 1
  • Lawrence Rauchwerger
    • 1
  1. 1.Parasol Lab, Department of Computer Science and EngineeringTexas A&M UniversityCollege StationUSA

Personalised recommendations