CS Events

Abstract:

Graph edge partition models have become an appealing alternative to graph vertex partition models for parallel computing, largely due to their flexibility in balancing workloads and their efficiency in reducing communication cost. We propose a graph edge partition model with high partition quality while maintaining low partition overhead. Our edge partition model places an emphasis on data; computation is modeled as interaction between data. We demonstrate the benefits of the graph edge partition model for GPU computing on an important class of applications processing sparse matrices and graphs. Our model can balance work, and also data, which enhances locality over space and time respectively.