D. H. Bailey. FFT's in External or Hierarchical Memory. Journal of Supercomputing, 4(1):23-- 35, March 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
DSZOOM - Low Latency Software-Based Shared Memory - Radovic, Hagersten (2001) (Correct)
....applications (that do not require any modifications) from the original Stanford University distribution, which were originally developed for hardware multiprocessors. The applications are: Barnes Hut (hierarchical N body method) FFT (complex 1 D version of the radix # # six step FFT algorithm [Bai90] LU (blocked LU decomposition, see [WSH94] for more details) CLU (blocked LU decomposition with contiguous allocation of data, more optimized version of LU) Radix (integer radix sort kernel) Radiosity (iterative hierarchical diffuse radiosity method [HSA91] Raytrace (rendering of a ....
D. H. Bailey. FFT's in External or Hierarchical Memory. Journal of Supercomputing, 4(1):23-- 35, March 1990.
Methodological Considerations and Characterization.. - Woo, Ohara, Torrie, .. (1995) (42 citations) (Correct)
....(Note to reviewers: In the absence of the SPLASH 2 report, we provide short application descriptions here. If accepted, the final version will contain a reference to the SPLASH 2 report instead. FFT: The FFT kernel is a complex 1 D version of the radix Six step FFT algorithm described in [Bai90], which is optimized to minimize interprocessor communication. The data set for the FFT consists of the n complex data points to be transformed, and another n complex data points referred to as the roots of unity. Both sets of data are organized as x matrices, and the matrices are partitioned so ....
David H. Bailey. FFT's in External or Hierarchical Memory. Journal of Supercomputing, 4(1):23-35, March 1990.
The SPLASH-2 Programs: Characterization and.. - Woo, Ohara, Torrie, .. (1995) (343 citations) (Correct)
....has two major differences: i) it operates on sparse matrices, which have a larger communication to computation ratio for comparable problem sizes, and (ii) it is not globally synchronized between steps. FFT: The FFT kernel is a complex 1 D version of the radix sixstep FFT algorithm described in [Bai90], which is optimized to minimize interprocessor communication. The data set consists of the complex data points to be transformed, and another complex data points referred to as the roots of unity. Both sets of data are organized as matrices partitioned so that every processor is assigned a ....
David H. Bailey. FFT's in External or Hierarchical Memory. Journal of Supercomputing, 4(1):23-35, March 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC