Optimizing declarative parallel distributed graph processing by using constraint solvers

DOI10.1007/978-3-319-90686-7_11OpenAlexW2802813324MaRDI QIDQ1648883FDOQ1648883

Authors: Akimasa Morihata, Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Hideya Iwasaki 

Publication date: 9 July 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-90686-7_11

Recommendations

• A shape analysis for optimizing parallel graph programs
• Parallelizing sequential graph computations
• Parallel Processing and Applied Mathematics
• Experimental Analysis of Graph-based Answer Set Computation over Parallel and Distributed Architectures
• Parallel mapping of sparse computations

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cited In (3)

• Extended dependency graphs and efficient distributed fixed-point computation
• Fregel: a functional domain-specific language for vertex-centric large-scale graph processing
• A shape analysis for optimizing parallel graph programs

Uses Software

• GraphX
• PowerGraph
• Elixir

This page was built for publication: Optimizing declarative parallel distributed graph processing by using constraint solvers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648883)