SearcharxivSearch

arXiv subjects

Christopher Harris

Publications and source records attributed to Christopher Harris.

9 recordsLinked to original sources

A signal dedispersion algorithm for imaging-based transient searches

Dedispersion is the computational process of correcting for the frequency-dependent time delay affecting a radio signal that propagates through the interstellar and intergalactic media. It is a crucial component of transient search pipelines that maximises the signal-to-noise ratio, especially when targeting highly dispersed signals: for instance, pulsar emissions making their way through a dense cloud of ionised gas, and fast radio bursts travelling cosmological distances. This paper introduces Streaming high Time-Resolution Imaging DEdispersion (STRIDE), a novel dedispersion algorithm to generate per-pixel dedispersed time series from high time and frequency resolution interferometric images. Unlike straightforward approaches to image dedispersion, STRIDE does not involve expensive manipulation of the input data layout, such as explicitly building dynamic spectra or shifting images. Furthermore, it is the first dedispersion algorithm to partition a dispersive sweep over the time dimension, in addition to frequency. As a consequence, images corresponding to the entire time span of the target dispersive delay are not required all at once. Instead, the algorithm works with an arbitrarily-sized subset of images at a time, adopting an incremental, streaming-based approach to dedispersion. In evaluating STRIDE on the presented test case, it is shown that the minimum memory requirement is reduced by 97.9%, going from 684.5 GB to 14.4 GB. As current and future generations of widefield interferometers increasingly turn to imaging techniques for detection and localisation of radio transients, STRIDE positions itself as a strong alternative to traditional dedispersion methodologies. It arguably is the only viable option for imaging-based searches with low-frequency instruments such as the Murchison Widefield Array (MWA) and low-frequency Square Kilometre Array (SKA-Low).

astro-ph.IM

Numerical and analytical modeling of heat equation in current-carrying conductors using the heat equation implemented using Finite-JAX

Current-carrying conductors inevitably experience resistive heating due to the material's finite electrical conductivity. The resulting temperature distribution within the wire has essential implications for structural integrity, efficiency, and long-term reliability of electronic and power systems. In this work, we model the steady-state heat distribution in a current-carrying wire using the classical heat conduction equation. In a two-dimensional formulation, heat transport is considered both along and across the conductor. The governing partial differential equation is discretized using finite-difference methods implemented in Finite-JAX, with appropriate initial and boundary conditions, including the Dirichlet condition relevant to practical scenarios. Time integration is performed using the Euler explicit scheme, and stability constraints are systematically examined. To assess the accuracy of the numerical approach, we compare the computed temperature fields with the exact analytical solution of the heat equation for canonical geometry. Results show that the numerical prediction converges toward the analytical solution, with error norms decreasing at the expected order of accuracy. This study demonstrates how the heat equation provides a rigorous mathematical foundation for modeling resistive heating in conductors. The errors between the numerical and analytical solutions are 1.981 K, 0.8975 K, and 0.7917 K, corresponding to the L-infinity, L1, and L2 norms. For tensor computations, TPUs deliver the highest performance, surpassing GPUs and CPUs.

math.NA

BLINK: an End-To-End GPU High Time Resolution Imaging Pipeline for Fast Radio Burst Searches with the Murchison Widefield Array

Petabytes of archival high time resolution observations have been captured with the Murchison Widefield Array. The search for Fast Radio Bursts within these using established software has been limited by its inability to scale on supercomputing infrastructure, necessary to meet the associated computational and memory requirements. Hence, past searches used a coarse integration time, in the scale of seconds, or analysed an insufficient number of hours of observations. This paper introduces BLINK, a novel radio interferometry imaging software for low-frequency FRB searches to be run on modern supercomputers. It is implemented as a suite of software libraries executing all computations on GPU, supporting both AMD and NVIDIA hardware vendors. These libraries are designed to interface with each other and to define the BLINK imaging pipeline as a single executable program. Expensive I/O operations between imaging stages are not necessary because the stages now share the same memory space and data representation. BLINK is the first imaging pipeline implementation able to fully run on GPUs as a single process, further supporting AMD hardware and enabling Australian researchers to take advantage of Pawsey's Setonix supercomputer. In the millisecond-scale time resolution imaging test case illustrated in this paper, representative of what is required for FRB searches, the BLINK imaging pipeline achieves a 3687x speedup compared to a traditional MWA imaging pipeline employing WSClean.

astro-ph.IM

Energy-based Accounting Model for Heterogeneous Supercomputers

In this paper we present a new accounting model for heterogeneous supercomputers. An increasing number of supercomputing centres adopt heterogeneous architectures consisting of CPUs and hardware accelerators for their systems. Accounting models using the core hour as unit of measure are redefined to provide an appropriate charging rate based on the computing performance of different processing elements, as well as their energy efficiency and purchase price. In this paper we provide an overview of existing models and define a new model that, while retaining the core hour as a fundamental concept, takes into account the interplay among resources such as CPUs and RAM, and that bases the GPU charging rate on energy consumption. We believe that this model, designed for Pawsey Supercomputing Research Centre's next supercomputer Setonix, has a lot of advantages compared to other models, introducing carbon footprint as a primary driver in determining the allocation of computational workflow on heterogeneous resources.

cs.DC

AdiosStMan: Parallelizing Casacore Table Data System Using Adaptive IO System

In this paper, we investigate the Casacore Table Data System (CTDS) used in the casacore and CASA libraries, and methods to parallelize it. CTDS provides a storage manager plugin mechanism for third-party devel- opers to design and implement their own CTDS storage managers. Hav- ing this in mind, we looked into various storage backend techniques that can possibly enable parallel I/O for CTDS by implementing new storage managers. After carrying on benchmarks showing the excellent parallel I/O throughput of the Adaptive IO System (ADIOS), we implemented an ADIOS based parallel CTDS storage manager. We then applied the CASA MSTransform frequency split task to verify the ADIOS Storage Manager. We also ran a series of performance tests to examine the I/O throughput in a massively parallel scenario.

cs.DC

Performance Analysis of GPU-Accelerated Filter-Based Source Finding for HI Spectral Line Image Data

Searching for sources of electromagnetic emission in spectral-line radio astronomy interferometric data is a computationally intensive process. Parallel programming techniques and High Performance Computing hardware may be used to improve the computational performance of a source finding program. However, it is desirable to further reduce the processing time of source finding in order to decrease the computational resources required for the task. GPU acceleration is a method that may achieve significant increases in performance for some source finding algorithms, particularly for filtering image data. This work considers the application of GPU acceleration to the task of source finding and the techniques used to achieve the best performance, such as memory management. We also examine the changes in performance, where the algorithms that were GPU accelerated achieved a speedup of around 3.2 times the 12 core per node CPU-only performance, while the program as a whole experienced a speedup of 2.0 times.

astro-ph.IM

A Framework for HI Spectral Source Finding Using Distributed-Memory Supercomputing

The latest generation of radio astronomy interferometers will conduct all sky surveys with data products consisting of petabytes of spectral line data. Traditional approaches to identifying and parameterising the astrophysical sources within this data will not scale to datasets of this magnitude, since the performance of workstations will not keep up with the real-time generation of data. For this reason, it is necessary to employ high performance computing systems consisting of a large number of processors connected by a high-bandwidth network. In order to make use of such supercomputers substantial modifications must be made to serial source finding code. To ease the transition, this work presents the Scalable Source Finder Framework, a framework providing storage access, networking communication and data composition functionality, which can support a wide range of source finding algorithms provided they can be applied to subsets of the entire image. Additionally, the Parallel Gaussian Source Finder was implemented using SSoFF, utilising Gaussian filters, thresholding, and local statistics. PGSF was able to search on a 256GB simulated dataset in under 24 minutes, significantly less than the 8 to 12 hour observation that would generate such a dataset.

astro-ph.IM

Scaling Radio Astronomy Signal Correlation on Heterogeneous Supercomputers Using Various Data Distribution Methodologies

Next generation radio telescopes will require orders of magnitude more computing power to provide a view of the universe with greater sensitivity. In the initial stages of the signal processing flow of a radio telescope, signal correlation is one of the largest challenges in terms of handling huge data throughput and intensive computations. We implemented a GPU cluster based software correlator with various data distribution models and give a systematic comparison based on testing results obtained using the Fornax supercomputer. By analyzing the scalability and throughput of each model, optimal approaches are identified across a wide range of problem sizes, covering the scale of next generation telescopes.

astro-ph.IM

Assessing The Accuracy Of Radio Astronomy Source Finding Algorithms

This work presents a method for determining the accuracy of a source finder algorithm for spectral line radio astronomy data and the Source Finder Accuracy Evaluator (SFAE), a program that implements this method. The accuracy of a source finder is defined in terms of its completeness, reliability, and accuracy of the parameterisation of the sources that were found. These values are calculated by executing the source finder on an image with a known source catalogue, then comparing the output of the source finder to the known catalogue. The intended uses of SFAE include determining the most accurate source finders for use in a survey, determining the types of radio sources a particular source finder is capable of accurately locating, and identifying optimum parameters and areas of improvement for these algorithms. This paper demonstrates a sample of accuracy information that can be obtained through this method, using a simulated ASKAP data cube and the Duchamp source finder.

astro-ph.IM