Abstract
The paper introduces techniques for solving various large-scale graph problems on hybrid architectures. The proposed approach is illustrated on the computation of minimum spanning tree and shortest paths. We provide a precise mathematical description accompanied by the information structure of required algorithms. Efficient parallel implementations of several graph algorithms are proposed based on this analysis. Hybrid computations allow using all the available resources on both multi-core CPUs and GPUs. Our implementation uses out-of-core memory algorithms to handle graphs that don’t fit in the main memory. Experimental results confirm high performance and scalability of the proposed solutions. Moreover, the proposed approach can be applied to other graph processing problems, which have recently rapidly increased in demand.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Voevodin, V., Shumaty, S., Sobolev, S.: Usage practices of “Lomonosov” supercomputer. Open Syst. (2012). (in Russian), http://www.osp.ru/os/2012/07/13017641/
Borůvka, O.: On a certain minimal problem. Práce Moravské Přírodovědecké Společnosti III(3), 37–58 (1926)
Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7(1), 48–50 (1956)
Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. (1957). http://doi.org/10.1002/j.1538-7305.1957.tb01515.x
Badera, D.A., Cong, G.: Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. J. Parallel Distrib. Comput. 66, 1366–1378 (2006)
Harish, P., Vineet, V., Narayanan, P.J.: Large graph algorithms for massively multithreaded architectures. Technical Report IIIT/TR/2009/74 (2009)
Vineet, V., Harish, P., Suryakanth, P., Narayanan, P.J.: Fast Minimum Spanning Tree for Large Graphs on the GPU. HPG (High Performance Graphics) (2009). Report No: IIIT/TR/2009/197
Anderson, R.J., Wall, H.: Wait-free parallel algorithms for the union-find problem (1991). http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.56.8354&rep=rep1&type=pdf
Voevodin, V.V.: Parallel Computing, 608 p. BHV, St. Petersburg (2002). (in Russian)
Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: a recursive model for graph mining (2006). http://www.cs.cmu.edu/~christos/PUBLICATIONS/siam04.pdf
Bader, D.A., Madduri, K.: Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors. In: Bader, D.A., Parashar, M., Sridhar, V., Prasanna, V.K. (eds.) HiPC 2005. LNCS, vol. 3769, pp. 465–476. Springer, Heidelberg (2005). doi:10.1007/11602569_48
Bellman, R.: On a routing problem. Q. Appl. Math. 16, 87–90 (1958)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959). http://doi.org/10.1007/BF01386390
Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM (1962). http://doi.org/10.1145/367766.368168
Nepomniaschaya, A.S., Dvoskina, M.A.: A simple implementation of Dijkstra’s shortest path algorithm on associative parallel processors. Fundam. Inf. 43(1–4), 227–243 (2000)
Hector, O., Torres, Y., Llanos, D.R.: A new GPU-based approach to the shortest path problem (2013). http://www.infor.uva.es/~hector/papers/hpcs_2013.pdf
Katz, G.J., Kider, J.T.: All-pairs shortest-paths for large graphs on the GPU (2008). http://repository.upenn.edu/cgi/viewcontent.cgi?article=1213&context=hms&sei-redir=1&referer=https%3A%2F%2Fscholar.google.ru%2Fscholar%3Fq%3Dcuda%2Bshortest%2Bpaths%2Bfloyd%26btnG%3D%26hl%3Dru%26as_sdt%3D0%252C5#search=%22cuda%20shortest%20paths%20floyd%22
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Afanasyev, I., Daryin, A., Dongarra, J., Nikitenko, D., Teplov, A., Voevodin, V. (2016). Techniques for Solving Large-Scale Graph Problems on Heterogeneous Platforms. In: Voevodin, V., Sobolev, S. (eds) Supercomputing. RuSCDays 2016. Communications in Computer and Information Science, vol 687. Springer, Cham. https://doi.org/10.1007/978-3-319-55669-7_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-55669-7_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-55668-0
Online ISBN: 978-3-319-55669-7
eBook Packages: Computer ScienceComputer Science (R0)