Cited By
View all- Parhami BKwai D(2001)A Unified Formulation of Honeycomb and Diamond NetworksIEEE Transactions on Parallel and Distributed Systems10.1109/71.89994012:1(74-80)Online publication date: 1-Jan-2001
Whole array operations and array section operations are important features of many data-parallel languages. Efficient implementation of these operations on distributed-memory multicomputers is critical to the scalability and high-performance of data-...
Discrete Fourier transform (DFT) is used widely in almost all fields of science and engineering, and is generally calculated using the fast Fourier transform (FFT) algorithm. In this paper, we present a fast algorithm for efficiently computing a DFT of ...
IEEE Computer Society
United States