The paper aims to address load imbalance caused by high in-degree distribution in graphs by applying the idea of rhizome to vertex-centric message-driven graph processing. Rhizome construction of the graph creates multiple named vertex address for any number of single large in-degree vertices. It then allows other vertices to point to any of the named addresses thus sharing the in-degree load. The rhizomes internally communicate and remain consistent to provide a unified and correct view of the vertex. Simulated experimental results show performance speed ups for BFS graph traversal on large chip sizes for the tested input graph datasets containing highly skewed in-degree distribution. The improvements come from sharing the in-degree compute workload among memory-processing elements and also lowering contention on the network-on-chip.

翻译：本文旨在通过将根茎概念应用于以顶点为中心的消息驱动图处理，解决由图中高入度分布引起的负载失衡问题。图的根茎结构为任意数量的单个大入度顶点创建多个命名顶点地址，从而允许其他顶点指向任意命名地址，实现入度负载的共享。根茎内部相互通信并保持一致性，以确保顶点视图统一且正确。模拟实验结果表明，对于包含高偏斜入度分布的测试输入图数据集，在大规模芯片上执行BFS图遍历时性能得到提升。该改进源于将入度计算负载分散到内存处理单元之间，同时降低片上网络的竞争。