{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:26:49Z","timestamp":1725488809430},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540417293"},{"type":"electronic","value":"9783540707349"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-70734-4_37","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T05:01:45Z","timestamp":1186894905000},"page":"316-323","source":"Crossref","is-referenced-by-count":1,"title":["A Parallel 3-D FFT Algorithm on Clusters of Vector SMPs"],"prefix":"10.1007","author":[{"given":"Daisuke","family":"Takahashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,4,10]]},"reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.2307\/2003354","volume":"19","author":"J. W. Cooley","year":"1965","unstructured":"J. W. Cooley and J. W. Tukey, \u201cAn algorithm for the machine calculation of complex Fourier series,\u201d Math. Comput., vol. 19, pp. 297\u2013301, 1965.","journal-title":"Math. Comput."},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0167-8191(86)90033-5","volume":"3","author":"A. Brass","year":"1986","unstructured":"A. Brass and G. S. Pawley, \u201cTwo and three dimensional FFTs on highly parallel computers,\u201d Parallel Computing, vol. 3, pp. 167\u2013184, 1986.","journal-title":"Parallel Computing"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"R. C. Agarwal, F. G. Gustavson, and M. Zubair, \u201cAn efficient parallel algorithm for the 3-D FFT NAS parallel benchmark,\u201d in Proceedings of the Scalable High-Performance Computing Conference, May 23-25, 1994, Knoxville, Tennessee, pp. 129\u2013133, IEEE Computer Society Press, 1994.","DOI":"10.1109\/SHPCC.1994.296635"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/0167-8191(96)00015-4","volume":"22","author":"M. Hegland","year":"1996","unstructured":"M. Hegland, \u201cReal and complex fast Fourier transforms on the Fujitsu VPP 500,\u201d Parallel Computing, vol. 22, pp. 539\u2013553, 1996.","journal-title":"Parallel Computing"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1016\/S0167-8191(96)00039-7","volume":"22","author":"C. Calvin","year":"1996","unstructured":"C. Calvin, \u201cImplementation of parallel FFT algorithms on distributed memory machines with a minimum overhead of communication,\u201d Parallel Computing, vol. 22, pp. 1255\u20131279, 1996.","journal-title":"Parallel Computing"},{"key":"37_CR6","unstructured":"IBM Corporation, Parallel Engineering and Scientific Subroutine Library Version 2 Release 1.2 Guide and Reference (SA22-7273), 3rd ed., 1999."},{"key":"37_CR7","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970999","volume-title":"Computational Frameworks for the Fast Fourier Transform","author":"C. Loan Van","year":"1992","unstructured":"C. Van Loan, Computational Frameworks for the Fast Fourier Transform. SIAM Press, Philadelphia, PA, 1992."},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1137\/0916018","volume":"16","author":"M. Hegland","year":"1995","unstructured":"M. Hegland, \u201cAn implementation of multiple and multi-variate Fourier transforms on vector processors,\u201d SIAM J. Sci. Comput., vol. 16, pp. 271\u2013288, 1995.","journal-title":"SIAM J. Sci. Comput."},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"1635","DOI":"10.1016\/S0167-8191(99)00078-2","volume":"25","author":"K. Nakazawa","year":"1999","unstructured":"K. Nakazawa, H. Nakamura, T. Boku, I. Nakata, and Y. Yamashita, \u201cCP-PACS: A massively parallel processor at the University of Tsukuba,\u201d Parallel Computing, vol. 25, pp. 1635\u20131661, 1999.","journal-title":"Parallel Computing"},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0167-8191(87)90018-4","volume":"5","author":"P. N. Swarztrauber","year":"1987","unstructured":"P. N. Swarztrauber, \u201cMultiprocessor FFTs,\u201d Parallel Computing, vol. 5, pp. 197\u2013210, 1987.","journal-title":"Parallel Computing"},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF00162341","volume":"4","author":"D. H. Bailey","year":"1990","unstructured":"D. H. Bailey, \u201cFFTs in external or hierarchical memory,\u201d The Journal of Supercomputing, vol. 4, pp. 23\u201335, 1990.","journal-title":"The Journal of Supercomputing"},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF01245402","volume":"9","author":"K. R. Wadleigh","year":"1995","unstructured":"K. R. Wadleigh, G. B. Gostin, and J. Liu, \u201cHigh-performance FFT algorithms for the Convex C4\/XA supercomputer,\u201d The Journal of Supercomputing, vol. 9, pp. 163\u2013178, 1995.","journal-title":"The Journal of Supercomputing"},{"key":"37_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0167-8191(84)90413-7","volume":"1","author":"P. N. Swarztrauber","year":"1984","unstructured":"P. N. Swarztrauber, \u201cFFT algorithms for vector computers,\u201d Parallel Computing, vol. 1, pp. 45\u201363, 1984.","journal-title":"Parallel Computing"},{"key":"37_CR14","doi-asserted-by":"publisher","first-page":"1605","DOI":"10.1137\/S1064827595281940","volume":"18","author":"S. Goedecker","year":"1997","unstructured":"S. Goedecker, \u201cFast radix 2, 3, 4, and 5 kernels for fast Fourier transformations on computers with overlapping multiply-add instructions,\u201d SIAM J. Sci. Comput., vol. 18, pp. 1605\u20131611, 1997.","journal-title":"SIAM J. Sci. Comput."},{"key":"37_CR15","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1137\/0913039","volume":"13","author":"C. Temperton","year":"1992","unstructured":"C. Temperton, \u201cA generalized prime factor FFT algorithm for any N = 2p3q5r,\u201d SIAM J. Sci. Stat. Comput., vol. 13, pp. 676\u2013686, 1992.","journal-title":"SIAM J. Sci. Stat. Comput."}],"container-title":["Lecture Notes in Computer Science","Applied Parallel Computing. New Paradigms for HPC in Industry and Academia"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-70734-4_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T10:31:29Z","timestamp":1550745089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-70734-4_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540417293","9783540707349"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-70734-4_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}