谐波和算法的GPU实现
A GPU implementation of the harmonic sum algorithm
摘要:
时域射电天文学利用谐波和算法作为傅立叶域周期性搜索的一部分,这种类型的搜索用于发现单个射电星。谐波和算法还用作傅里叶域加速搜索的一部分,该搜索旨在发现锁定在另一颗脉冲星或致密物体周围轨道上的脉冲星。然而,将谐波和移植到像GPU这样的众核架构并不是一项简单的任务。必须克服的主要问题是非常不利的存储器访问模式,随着谐波和的维数的增加而变得更糟。我们提出了一套算法,用于计算谐波和,更适合于众核架构,如GPU。我们提出了这些不同的方法的敏感性,以及它们的性能的评估。这项工作是AstroAccelerate项目的一部分,AstroAccelerate是一个GPU加速软件包,用于处理时域射电天文数据。
英文摘要:
Time-domain radio astronomy utilizes a harmonic sum algorithm as part of the Fourier domain periodicity search, this type of search is used to discover single pulsars. The harmonic sum algorithm is also used as part of the Fourier domain acceleration search which aims to discover pulsars that are locked in orbit around another pulsar or compact object. However porting the harmonic sum to many-core architectures like GPUs is not a straightforward task. The main problem that must be overcome is the very unfavourable memory access pattern, which gets worse as the dimensionality of the harmonic sum increases. We present a set of algorithms for calculating the harmonic sum that are more suited to many-core architectures such as GPUs. We present an evaluation of the sensitivity of these different approaches, and their performance. This work forms part of the AstroAccelerate project which is a GPU accelerated software package for processing time-domain radio astronomy data.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。