arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1505.04086cs.DC
收藏

一种适用于多核和众核架构的快速可扩展图着色算法

A Fast and Scalable Graph Coloring Algorithm for Multi-core and Many-core Architectures

Georgios Rokos, Gerard Gorman, Paul H J Kelly

摘要:

非结构化数据上的非规则计算是并行程序设计中一类重要的问题。图着色通常是一个重要的预处理步骤,例如,作为一种执行安全并行执行的依赖性分析的方式。着色算法的总运行时间会增加应用程序的总体并行开销,而使用的颜色数量决定了公开的并行度。使用尽可能少的颜色的快速和可扩展的着色算法对于许多依赖于运行时依赖性分析的不规则应用程序的整体并行性能和可扩展性至关重要。Catalyurek等人提出了一种图着色算法,该算法依赖于颜色的推测性局部分配。在本文中,我们提出了一个改进的版本,运行更乐观的线程同步和减少冲突的数量相比,催化剂等。的算法。我们证明了新技术在多核和众核系统上的扩展性更好,并且在具有高度数顶点的图上的执行速度比其前身快1.5倍,同时将颜色数量保持在相同的接近最佳水平。

英文摘要:

Irregular computations on unstructured data are an important class of problems for parallel programming. Graph coloring is often an important preprocessing step, e.g. as a way to perform dependency analysis for safe parallel execution. The total run time of a coloring algorithm adds to the overall parallel overhead of the application whereas the number of colors used determines the amount of exposed parallelism. A fast and scalable coloring algorithm using as few colors as possible is vital for the overall parallel performance and scalability of many irregular applications that depend upon runtime dependency analysis. Catalyurek et al. have proposed a graph coloring algorithm which relies on speculative, local assignment of colors. In this paper we present an improved version which runs even more optimistically with less thread synchronization and reduced number of conflicts compared to Catalyurek et al.'s algorithm. We show that the new technique scales better on multi-core and many-core systems and performs up to 1.5x faster than its predecessor on graphs with high-degree vertices, while keeping the number of colors at the same near-optimal levels.

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

↑