I/O Performance Bounds for On-Array Processing on Mesh and Torus Networks
The aggregate beam-bandwidth capacity of digital phased arrays is typically constrained by data offload bottlenecks, preventing effective utilization and processing of most of the signal information received by a large sensor. On-array processing is an alternative architecture which aims to mitigate these bottlenecks by distributing data and processing loads across computing resources embedded directly within the array grid. This paper reviews optimal data-movement patterns on rectangular mesh and torus networks, and provides corresponding theoretical I/O-limited performance bounds for on-array processing under several different parallelization schemes.
Authors
- Jonathan P. Doane (ORCID: https://orcid.org/0000-0001-6590-4244)
- Richard Scott Teal
Institutions
- MIT Lincoln Laboratory (US)
Publication Details
- Published
- 2024-10-15
- DOI
- https://doi.org/10.1109/array58370.2024.10880316
- Primary Topic
- Interconnection Networks and Systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00