arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2212.08200cs.DCcs.DS
收藏

并行图分析的基本原理

Essentials of Parallel Graph Analytics

Muhammad Osama, Serban D. Porumbescu, John D. Owens

摘要:

我们确定的图形数据结构,边界,运营商,迭代循环结构和收敛条件的基本组成部分的图形分析系统的基础上的原生图的方法。使用这些基本组件,我们提出了一个抽象,捕捉所有重要的编程模型图分析,如批量同步,异步,共享内存,消息传递,推与拉遍历。最后,我们展示了我们的抽象与优雅的现代C++单源最短路径及其所需的组件实现的力量。

英文摘要:

We identify the graph data structure, frontiers, operators, an iterative loop structure, and convergence conditions as essential components of graph analytics systems based on the native-graph approach. Using these essential components, we propose an abstraction that captures all the significant programming models within graph analytics, such as bulk-synchronous, asynchronous, shared-memory, message-passing, and push vs. pull traversals. Finally, we demonstrate the power of our abstraction with an elegant modern C++ implementation of single-source shortest path and its required components.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑