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.
|Name||Lecture Notes in Computer Science|
|Conference||conference; 12th Conference on Distributed Computing and Networking (ICDCN'11)|
|Period||1/01/11 → …|
|Other||12th Conference on Distributed Computing and Networking (ICDCN'11)|