arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.12817astro-ph.IM
收藏

一种基于GPU的贪婪谐波求和算法

A Novel Greedy Approach To Harmonic Summing Using GPUs

Karel Adamek, Jayanta Roy, Wesley Armour

摘要:

非相干谐波求和是一种用于提高傅立叶域搜索方法灵敏度的技术。一维谐波和在时域射电天文学中被用作傅立叶域周期性搜索的一部分,傅立叶域周期性搜索是一种用于检测孤立单脉冲的搜索类型。在众核架构(如GPU)上实现谐波和时面临的主要问题是谐波和算法的非常不利的存储器访问模式。随着谐波和的维数增加,存储器访问模式变得更糟。在这里,我们提出了一套算法,用于计算谐波和,适用于众核架构,如GPU。我们提出了这些不同的方法的敏感性,以及它们的性能的评估。这项工作是AstroAccelerate项目的一部分,AstroAccelerate是一个GPU加速软件包,用于处理时域射电天文数据。

英文摘要:

Incoherent harmonic summing is a technique which is used to improve the sensitivity of Fourier domain search methods. A one dimensional harmonic sum is used in time-domain radio astronomy as part of the Fourier domain periodicity search, a type of search used to detect isolated single pulsars. The main problem faced when implementing the harmonic sum on many-core architectures, like GPUs, is the very unfavourable memory access pattern of the harmonic sum algorithm. The memory access pattern gets worse as the dimensionality of the harmonic sum increases. Here we present a set of algorithms for calculating the harmonic sum that are 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分析而来,可能存在错误,请以论文正文为准。

↑