Name
Title | ||
|---|---|---|
A Methodology for Generating Efficient Disk-Based Algorithms from Tensor Product Formulas |
Abstract | ||
|---|---|---|
In this paper, we address the issue of automatic generation of disk-based algorithms from tensor product formulas. Disk-based algorithms are required in scientific applications which work with large data sets that do not fit entirely into main memory. Tensor products have been used for designing and implementing block recursive algorithms on shared-memory, vector and distributed-memory multiprocessors. We extend this theory to generate disk-based code from tensor product formulas. The methodology is based on generating algebraically equivalent tensor product formulas which have better disk performance. We demonstrate this methodology by generating disk-based code for the fast Fourier transform. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1007/3-540-57659-2_21 | LCPC |
Keywords | Field | DocType |
tensor product formulas,stride permutation,fast fourier transform.,tensor product,disk-based algorithm,generating efficient disk-based algorithms,distributed memory,shared memory,fast fourier transform,recursive algorithm | Tensor product,Data set,Computer science,Algorithm,Theoretical computer science,Fast Fourier transform,Recursion | Conference |
ISBN | Citations | PageRank |
3-540-57659-2 | 3 | 0.60 |
References | Authors | |
18 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. D. Kaushik | 1 | 291 | 25.26 |
| Chua-huang Huang | 2 | 281 | 35.34 |
| R. W. Johnson | 3 | 23 | 3.26 |
| P. Sadayappan | 4 | 4821 | 344.32 |