Multiple Fourier transform method on an SIMD computer
暂无分享,去创建一个
We implement a block tridiagonal Toeplitz linear system solver called MFT on an SIMD massively parallel computer, the MasPar MP-2. MP-2 is suitable to the linear solver which has rich data-parallelism. We examine five implementation methods to identify actual problems that hamper high-performance computing. We observe that good data allocation method is important to achieve maximum throughput.
[1] Chris R. Jesshope,et al. Parallel Computers 2: Architecture, Programming and Algorithms , 1981 .
[2] C. Loan. Computational Frameworks for the Fast Fourier Transform , 1992 .
[3] Billy L. Buzbee. A Fast Poisson Solver Amenable to Parallel Computation , 1973, IEEE Transactions on Computers.
[4] P. Swarztrauber. THE METHODS OF CYCLIC REDUCTION, FOURIER ANALYSIS AND THE FACR ALGORITHM FOR THE DISCRETE SOLUTION OF POISSON'S EQUATION ON A RECTANGLE* , 1977 .