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

PAGANI:一种并行自适应GPU算法

PAGANI: A Parallel Adaptive GPU Algorithm for Numerical

Ioannis Sakiotis, Kamesh Arumugam, Marc Paterno, Desh Ranjan, Balša Terzić, Mohammad Zubair

摘要:

针对大规模并行结构上的多维数值积分这一具有挑战性的问题,提出了一种新的自适应并行算法。自适应算法已经证明了最好的性能,但有效的众核利用率是难以实现的,因为自适应的工作负载可以在整个集成空间变化很大,是不可能预测的先验。现有的并行算法利用独立的处理器上的顺序计算,这导致由于需要数据重新分配和处理器同步的瓶颈。我们的算法采用了高吞吐量的方法,其中所有现有的子区域进行处理,并在并行细分。重复的子区域分类和过滤改进了蛮力方法,并允许算法有效地利用计算和存储器资源。CUDA实现显示了比最快的开源CPU方法高出几个数量级的加速,并扩展了困难被积体的可实现精度。我们的算法通常优于其他现有的确定性并行方法。

英文摘要:

We present a new adaptive parallel algorithm for the challenging problem of multi-dimensional numerical integration on massively parallel architectures. Adaptive algorithms have demonstrated the best performance, but efficient many-core utilization is difficult to achieve because the adaptive work-load can vary greatly across the integration space and is impossible to predict a priori. Existing parallel algorithms utilize sequential computations on independent processors, which results in bottlenecks due to the need for data redistribution and processor synchronization. Our algorithm employs a high-throughput approach in which all existing sub-regions are processed and sub-divided in parallel. Repeated sub-region classification and filtering improves upon a brute-force approach and allows the algorithm to make efficient use of computation and memory resources. A CUDA implementation shows orders of magnitude speedup over the fastest open-source CPU method and extends the achievable accuracy for difficult integrands. Our algorithm typically outperforms other existing deterministic parallel methods.

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

↑