A high-level framework for distributed processing of large-scale graphs
Distributed Computing and Networking: 12th International Conference, ICDCN …, 2011•Springer
Distributed processing of real-world graphs is challenging due to their size and the inherent
irregular structure of graph computations. We present hipg, a distributed framework that
facilitates high-level programming of parallel graph algorithms by expressing them as a
hierarchy of distributed computations executed independently and managed by the user.
hipg programs are in general short and elegant; they achieve good portability, memory
utilization and performance.
irregular structure of graph computations. We present hipg, a distributed framework that
facilitates high-level programming of parallel graph algorithms by expressing them as a
hierarchy of distributed computations executed independently and managed by the user.
hipg programs are in general short and elegant; they achieve good portability, memory
utilization and performance.
Abstract
Distributed processing of real-world graphs is challenging due to their size and the inherent irregular structure of graph computations. We present hipg, a distributed framework that facilitates high-level programming of parallel graph algorithms by expressing them as a hierarchy of distributed computations executed independently and managed by the user. hipg programs are in general short and elegant; they achieve good portability, memory utilization and performance.
Springer
Showing the best result for this search. See all results