共享内存图中强连通分支的维护
Maintenance of Strongly Connected Component in Shared-memory Graph
摘要：
在本文中，我们提出了一个在线的全动态算法，以维护强连通组件的有向图在共享存储器结构。边和顶点通过固定数量的线程同时添加或删除。据我们所知，这是第一个提出使用线性并发有向图的工作，并且使用有序和无序的基于列表的集合来构建。我们提供了一个经验比较顺序和粗粒度。结果表明，根据不同的工作负载分布和应用程序，我们的算法的吞吐量增加了3到6倍。我们相信在线图有巨大的应用。最后，我们展示了如何将该算法扩展到在线图中的社区发现。
英文摘要：
In this paper, we present an on-line fully dynamic algorithm for maintaining strongly connected component of a directed graph in a shared memory architecture. The edges and vertices are added or deleted concurrently by fixed number of threads. To the best of our knowledge, this is the first work to propose using linearizable concurrent directed graph and is build using both ordered and unordered list-based set. We provide an empirical comparison against sequential and coarse-grained. The results show our algorithm's throughput is increased between 3 to 6x depending on different workload distributions and applications. We believe that there are huge applications in the on-line graph. Finally, we show how the algorithm can be extended to community detection in on-line graph.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
