FFTs in external or hierarchical memory
The Journal of Supercomputing
Computational frameworks for the fast Fourier transform
Computational frameworks for the fast Fourier transform
Parallel computing in economics, finance and decision-making
Parallel Computing - Special issue on parallel computing in economics, finance and decision-making
Performance Evaluation of a Multithreaded Fast Fourier Transform Algorithm for Derivative Pricing
The Journal of Supercomputing
A software architecture framework for on-line option pricing
The Journal of Supercomputing
Option pricing using Particle Swarm Optimization
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
Pricing algorithms for financial derivatives
Algorithms and theory of computation handbook
Grid resources valuation with fuzzy real option
International Journal of High Performance Computing and Networking
QoS support for end users of I/O-intensive applications using shared storage systems
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
Exploring financial applications on many-core-on-a-chip architecture: a first experiment
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
A software architecture framework for on-line option pricing
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
A grid resources valuation model using fuzzy real option
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
The Journal of Supercomputing
Hi-index | 0.00 |
Fast Fourier Transform (FFT) has been used in many scientific and engineering applications. In the current study, we have applied the FFT for a novel application in finance. We have improved a recently proposed mathematical model of Fourier transform technique for pricing financial derivatives to help design and develop an effective parallel algorithm using a swapping technique that exploits data locality. We have implemented our algorithm on 20 node SunFire 6800 high performance computing system and compared the new algorithm with the traditional Cooley-Tukey algorithm We have presented the computed option values for various strike prices with a proper selection of strike-price spacing to ensure fine-grid integration for FFT computation as well as to maximize the number of strikes lying in the desired region of the asset price.