Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
A novel application development environment for large-scale scientific computations
Proceedings of the 14th international conference on Supercomputing
| Hi-index | 0.00 |
We examine approaches to computing the Fast Fourier Transform (FFT) when the data size exceeds the size of main memory. Analytical and experimental evidence shows that relying on native virtual memory with demand paging can yield extremely poor performance. We then present approaches based on minimizing I/O costs with the Parallel Disk Model (PDM). Each of these approaches explicitly plans and performs disk accesses so as to minimize their number.