TACHYON:极值图的高效共享内存并行计算
TACHYON: Efficient Shared Memory Parallel Computation of Extremum Graphs
AI总结:
针对现有极值图计算方法仅适用于低维标量场的问题,提出GPU-CPU混合的共享内存并行算法,实现任意维度标量场极值图的高效计算,开源库TACHYON性能优异且扩展性良好。
摘要:
极值图是标量场Morse分解的一种简洁表示,它已日益成为一种实用的数据结构,支持二维/三维标量场的拓扑特征导向可视化,还能实现高维标量场的降维与探索性分析。目前使用极值图的方法,要么采用简单的串行算法计算Morse分解,要么通过计算更精细的Morse-Smale复形来得到极值图,这两种方法通常都仅适用于二维和三维标量场。我们提出了一种GPU-CPU混合并行算法,可计算任意维度标量场的极值图。该共享内存算法同时利用细粒度并行性与任务并行性来提升效率。实现该算法的开源软件库TACHYON表现出优异的性能与良好的可扩展性。
英文摘要:
The extremum graph is a succinct representation of the Morse decomposition of a scalar field. It has increasingly become a useful data structure that supports topological feature directed visualization of 2D / 3D scalar fields, and enables dimensionality reduction together with exploratory analysis of high dimensional scalar fields. Current methods that employ the extremum graph compute it either using a simple sequential algorithm for computing the Morse decomposition or by computing the more detailed Morse-Smale complex. Both approaches are typically limited to two and three dimensional scalar fields. We describe a GPU-CPU hybrid parallel algorithm for computing the extremum graph of scalar fields in all dimensions. The proposed shared memory algorithm utilizes both fine grained parallelism and task parallelism to achieve efficiency. An open source software library, TACHYON, that implements the algorithm exhibits superior performance and good scaling behavior.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。