Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/41933
Title: | Real-time, fast radio transient searches with GPU de-dispersion |
Authors: | Magro, Alessio Karastergiou, A. Salvini, S. Mort, B. Dulwich, F. Zarb Adami, Kristian |
Keywords: | Real-time data processing Astrophysics -- Congresses Transients (Dynamics) -- Congresses Time-domain analysis -- Congresses |
Issue Date: | 2011 |
Publisher: | Oxford University Press |
Citation: | Magro, A., Karastergiou, A., Salvini, S., Mort, B., Dulwich, F., & Zarb Adami, K. (2011). Real-time, fast radio transient searches with GPU de-dispersion. Monthly Notices of the Royal Astronomical Society, 417(4), 2642-2650. |
Abstract: | The identification, and subsequent discovery, of fast radio transients through blind-search surveys requires a large amount of processing power, in worst cases scaling as O(N3 ). For this reason, survey data are generally processed offline, us- ing high-performance computing architectures or hardware-based designs. In recent years, graphics processing units have been extensively used for numerical analysis and scientific simulations, especially after the introduction of new high-level application programming interfaces. Here we show how GPUs can be used for fast transient dis- covery in real-time. We present a solution to the problem of de-dispersion, providing performance comparisons with a typical computing machine and traditional pulsar processing software. We describe the architecture of a real-time, GPU-based transient search machine. In terms of performance, our GPU solution provides a speed-up factor of between 50 and 200, depending on the parameters of the search. |
URI: | https://www.um.edu.mt/library/oar//handle/123456789/41933 |
Appears in Collections: | Scholarly Works - FacSciPhy |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Real_time_fast_radio_transient_searches_with_GPU_de_dispersion.pdf | 1.05 MB | Adobe PDF | View/Open |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.