Algorithmic-Parameter optimization of a parallelized split-step fourier transform using a modified BSP cost model

Authors:
Elankovan Sundararajan;Malin Premaratne;Shanika Karunasekera;Aaron Harwood
Affiliations:
Department of Computer Science and Software Engineering, The University of Melbourne, Carlton, Victoria, Australia;Advanced Computing and Simulation Laboratory, Department for Electrical and Computer System Engineering, Monash University, Clayton, Victoria, Australia;Department of Computer Science and Software Engineering, The University of Melbourne, Carlton, Victoria, Australia;Department of Computer Science and Software Engineering, The University of Melbourne, Carlton, Victoria, Australia
Venue:
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Year:
2004

Citing 8
Cited 0

Split-step methods for the solution of the nonlinear Schro¨dinger equation

SIAM Journal on Numerical Analysis
A bridging model for parallel computation

Communications of the ACM
Implementation of parallel FFT algorithms on distributed memory machines with a minimum overhead of communication

Parallel Computing
A fast Fourier transform compiler

Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Using MPI (2nd ed.): portable parallel programming with the message-passing interface

Using MPI (2nd ed.): portable parallel programming with the message-passing interface
The Scalability of FFT on Parallel Computers

IEEE Transactions on Parallel and Distributed Systems
Self-adapting software for numerical linear algebra and LAPACK for clusters

Parallel Computing - Special issue: Parallel and distributed scientific and engineering computing
Applications of Nonlinear Fiber Optics

Applications of Nonlinear Fiber Optics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Adaptive algorithms are increasingly acknowledged in leading parallel and distributed research. In the past, algorithms were manually tuned to be executed efficiently on a particular architecture. However, interest has shifted towards algorithms that can adapt themselves to the computational resources. A cost model representing the behavior of the system (i.e. system parameters) and the algorithm (i.e algorithm parameters) plays an important role in adaptive parallel algorithms. In this paper, we contribute a computational model based on Bulk Synchronous Parallel processing that predicts performance of a parallelized split-step Fourier transform. We extracted the system parameters of a cluster (upon which our algorithm was executed) and showed the use of an algorithmic parameter in the model that exhibits optimal behavior. Our model can thus be used for the purpose of self-adaption.