Abstract
An abstract machine based approach to distributing the Fast Fourier Transform (FFT) on a queue of N=2L complex values across a network of N/2 virtual machines is presented. The strategy involves three stages, in general, (a) constructing the FFT virtual machine (FFT_VM) as a set of communicating virtual machine compute nodes, (b) instantiation of the FFT_VM on a physical “grid” of networked computers, and (c) execution of the FFT data queue. The fundamental computational unit of the FFT_VM is a virtual machine called FFT_VM_Butterfly which reflects a specialised computation and communication unit referred to as the Butterfly algorithm, a core component of the FFT algorithms typified as Cooley-Tukey. This approach affords opportunity to prove the correctness of the software design in various contexts of application based only on rigorous logical analysis and also demonstrates flexibility and adaptability to metacomputing design and construction and use of dynamic execution environments such as computational grids.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abrial, J.-R. The B-Book: Assigning Programs to Meanings. Cambridge University Press (1996).
Ai, Xiaolan and Sawamiphakdi, Krich. “Solving Elastic Contact Between Rough Surfaces as an Unconstrained Energy Minimization by Using CGM and FFT Techniques”, J. Tribology 121, 639–647, ASME, 1999.
Blostein, Dorothea and Schurr, Andy. “Computing with Graphs and Graph Transformations”, Softw. Pract. Exper. 29(3), 197–217, 1999.
Buyya, Rajkumar. High Performance Cluster Computing, Vol. 1 and Vol. 2., Prentice-Hall, New Jersey, 1999. This two volume set provides an extensive review of existing and proposed HPC architectures and approaches to software development as well as an exhaustive set of references.
Chester, Clive R. Techniques in Partial Differential Equations. McGraw-Hill, New York, 1971.
Connolly, John W. D. “High Performance Computing in North America”, in High Performance Computing Systems and Applications., Andrew Pollard et al, eds.. 3. Kluwer Academic Publishers, 2000. Keynote address at the 13th High Performance Computing Systems and Applications Symposium (HPCS'99), Kingston, Ontario, June 13–16, 1999.
Fortier, Randy and Kent, Robert D. “A Dynamic Scheme in Support of Scalability in General Purpose Distributed Virtual Environments”, in High Performance Computing Systems and Applications., Nikitas Dimopoulos et al, eds..–??, Kluwer Academic Publishers, 2001.
Foster, Ian and Kesselman, Carl. “Globus: A metacomputing infrastructure toolkit”, International Journal of Supercomputer Application, 11, 1997.
Foster, Ian and Kesselman, Carl. “The Globus Project: A status report”, Proceedings of the 1998 IEEE Heterogeneous Computing Workshop (HCW'98), 4–18, 1998. Also, see the many references contained therein and in the remainder of the Proceedings.
Foster, Ian and Kesselman, Carl. “Computational Grids”, in The Grid: Blueprint for a New Computing Infrastructure, Ian Foster and Carl Kesselman, eds., 15–51. Morgan Kaufmann Publishers, San Francisco, 1999. Also, see the many references and other papers on grid computing therein.
King, David; Mullen, Tracy; Rice, Bart; Topping, Phillip; and Weyland, Nicholas. “Knowledge-Based FFT and Convolution Synthesis for any Number of Points”, in Intelligent Mathematical Software Systems, E. N. Houstis et al, eds., 143–153. Elsevier Science Publishers B. V., 1990.
Lindholm, Tim and Yellin, Frank. The Java Virtual Machine Specification. 2nd Edition. Addison-Wesley, Reading, 1999.
Manber, Udi. Introduction to algorithms. Addison-Wesley, Reading, 1989.
Preney, Paul D.; Kent, Robert D.; and Schlesinger, M. “Toward a Model of Models. Part I”, in High Performance Computing Systems and Applications, Andrew Pollard et al, eds.. 33–38. Kluwer Academic Publishers, 2000.
Schlesinger, Mordechay and Kent, Robert D. “Toward a Model of Models. Part II”, in High Performance Computing Systems and Applications., Andrew Pollard et al, eds.. 39–43. Kluwer Academic Publishers, 2000.
Shen, Weicheng and Oruc, A. Yavuz. “Systolic arrays for Multidimensional Discrete Transforms”, J. Supercomputing 4, 201–222 (1990).
Stroustrup, Bjarne. The C++ Programming Language. Third Edition. Addison-Wesley, Reading, 1997.
Van Loan, Charles. Computational Frameworks for the Fast Fourier Transform. Frontiers in Applied Mathematics, Vol. 10, 156–175. SIAM, Philadelphia, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kent, R.D., Majmudar, N., Schlesinger, M. (2002). Distributing Fast Fourier Transform Algorithms for Grid Computing. In: Dimopoulos, N.J., Li, K.F. (eds) High Performance Computing Systems and Applications. The Kluwer International Series in Engineering and Computer Science, vol 657. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0849-6_27
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0849-6_27
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5269-3
Online ISBN: 978-1-4615-0849-6
eBook Packages: Springer Book Archive