A High-Level Framework for Distributed Processing of Large-Scale Graphs

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.

• Type: Journal
• Year: 2011
• Where: ICDCN
• Authors: Elzbieta Krepska, Thilo Kielmann, Wan Fokkink, Henri E. Bal
• Keywords: Distributed And Parallel Computing, ICDCN 2011, Irregular Structure, Memory Utilization, Parallel Graph Algorithms