Survey of large-scale graph processing models for high perfomance computing systems
( Pp. 6-17)

For read the full article, please, register or log in
In the paper a survey of perspective programming models for large-scale graph processing is presented. For analysis the following models have been selected: Parallel Boost Graph Library, Active Pebbles, Grappa, Parallex/HPX-5, and Charm++. Programming models as well as most important aspects of its implementation are presented in the analysis.
How to Cite:
Frolov A.S., Semenov A.S., Markov A.S., (2015), SURVEY OF LARGE-SCALE GRAPH PROCESSING MODELS FOR HIGH PERFOMANCE COMPUTING SYSTEMS. Computational Nanotechnology, 4 => 6-17.
Reference list:
Lumsdaine, Andrew, et al. quot;Challenges in parallel graph processing. quot; Parallel Processing Letters 17.01 (2007): 5-20.
Chakaravarthy, Venkatesan T., et al. quot;Scalable single source shortest path algorithms for massively parallel systems. quot; Parallel and Distributed Processing Symposium, 2014 IEEE 28th International. IEEE, 2014.
Pearce, Roger, Maya Gokhale, and Nancy M. Amato. quot;Faster parallel traversal of scale free graphs at extreme scale with vertex delegates. quot; Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE Press, 2014.
Gropp, William, et al. quot;A high-performance, portable implementation of the MPI message passing interface standard. quot; Parallel computing 22.6 (1996): 789-828.
Dagum, Leonardo, and Rameshm Enon. quot;OpenMP: an industry standard API for shared-memory programming. quot; Computational Science Engineering, IEEE 5.1 (1998): 46-55.
Douglas Gregor and Andrew Lumsdaine. The Parallel BGL: A Generic Library for Distributed Graph Computation. Workshop on Parallel Object-Oriented Scientific Computing. July, 2005
Douglas Gregor and Andrew Lumsdaine. Lifting Sequential Graph Algorithms for Distributed-Memory Parallel Computation. Object-Oriented Programming, Systems, Languages, and Applications. October, 2005
Jeremy G. Siek, Lie-Quan Lee, and Andrew Lumsdaine. quot;The boost graph library: user guide and reference manual quot; Addison-Wesley 2002.
Valiant, Leslie G. quot;A bridging model for parallel computation. quot; Communications of the ACM 33.8 (1990): 103-111.
Willcock, Jeremiah James, et al. quot;Active pebbles: parallel programming for data-driven applications. quot; Proceedings of the international conference on Supercomputing. ACM, 2011.
Willcock, Jeremiah James, et al. quot;AM : A generalized active message framework. quot; Proceedings of the 19th international conference on Parallel architectures and compilation techniques. ACM, 2010.
Firoz, Jesun Sahariar, et al. quot;Comparison Of Single Source Shortest Path Algorithms On Two Recent Asynchronous Many-task Runtime Systems. quot;
Laxmikant V. Kale and Sanjeev Krishnan. Charm : A portable concurrent object oriented system based on c . SIGPLAN Not., 28(10):91-108, October 1993.
Kal , Laxmikant V., et al. quot;Charm for productivity and performance: A submission to the 2011 HPC class II challenge. quot; (2011).
Kaiser, Hartmut, Maciej Brodowicz, and Thomas Sterling. quot;Parallex an advanced parallel execution model for scaling-impaired applications. quot; Parallel Processing Workshops, 2009. ICPPW 09. International Conference on. IEEE, 2009.
Anderson, Matthew, et al. quot;A dynamic execution model applied to distributed collision detection. quot; Supercomputing. Springer International Publishing, 2014.
Heller, T., H. Kaiser, and Klaus Iglberger. quot;Application of the ParalleX execution model to stencil-based problems. quot; Computer Science-Research and Development28.2-3 (2013): 253-261.
Dekker, L., W. Smit, and J. C. Zuidervaart. quot;Programming Models and Tools for Massively Parallel Computers. quot; Massively Parallel Processing Applications and Development: Proceedings of the 1994 EUROSIM Conference on Massively Parallel Processing Applications and Development, Delft, The Netherlands, 21-23 June 1994. Elsevier, 2013.
Kissel, Ezra, and Martin Swany. quot;Session layer burst switching for high performance data movement. quot; Proceedings of PFLDNet. 2010.
B. Holt, J. Nelson, B. Myers, P. Briggs, L. Ceze, S. Kahan, and M. Oskin. Flat combining synchronized global data structures. In International Conference on PGAS Programming Models (PGAS), Oct 2013.
Jacob Nelson, Brandon Myers, A. H. Hunter, Preston Briggs, Luis Ceze, Carl Ebeling, Dan Grossman, Simon Kahan, and Mark Oskin. 2011. Crunching large graphs with commodity processors. In Proceedings of the 3rd USENIX conference on Hot topic in parallelism (HotPar 11). USENIX Association, Berkeley, CA, USA, 10-10.
Sinha, Amitabh B., Laxmikant V. Kal , and Balkrishna Ramkumar. quot;A dynamic and adaptive quiescence detection algorithm. quot; University of Illinois at Urbana-Champaign, Urbana-Champaign (1993).
parallel graph processing, software model, computational models, supercomputers, ecaflips.

Related Articles

Issue №5869
Survey of large-scale graph processing models for high perfomance computing systems
parallel graph processing software model computational models supercomputers ecaflips
Show more
Issue №4871
graphs supercomputers parallel processing seminar
Show more
Issue №5869
A comparison of MPI and Charm++ parallel programming technologies on the minimum spanning tree problem
graphs supercomputers MPI Charm++ MST
Show more
Issue №9439
problem-oriented programming languages parallel graph processing software model supercomputer
Show more
Issue №3497
supercomputers computational nanotechnology parallel computing
Show more