{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:56:48Z","timestamp":1771703808246,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540437864","type":"print"},{"value":"9783540480518","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-48051-x_38","type":"book-chapter","created":{"date-parts":[[2007,5,18]],"date-time":"2007-05-18T16:49:55Z","timestamp":1179506995000},"page":"380-389","source":"Crossref","is-referenced-by-count":6,"title":["A Blocking Algorithm for Parallel 1-D FFT on Shared-Memory Parallel Computers"],"prefix":"10.1007","author":[{"given":"Daisuke","family":"Takahashi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,4]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"J.W. Cooley","year":"1965","unstructured":"Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19 (1965) 297\u2013301","journal-title":"Math. Comput."},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0167-8191(87)90018-4","volume":"5","author":"P.N. Swarztrauber","year":"1987","unstructured":"Swarztrauber, P.N.: Multiprocessor FFTs. Parallel Computing 5 (1987) 197\u2013210","journal-title":"Parallel Computing"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF00162341","volume":"4","author":"D.H. Bailey","year":"1990","unstructured":"Bailey, D.H.: FFTs in external or hierarchical memory. The Journal of Supercomputing 4 (1990) 23\u201335","journal-title":"The Journal of Supercomputing"},{"key":"38_CR4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970999","volume-title":"Computational Frameworks for the Fast Fourier Transform","author":"C. Loan Van","year":"1992","unstructured":"Van Loan, C.: Computational Frameworks for the Fast Fourier Transform. SIAM Press, Philadelphia, PA (1992)"},{"key":"38_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF01245402","volume":"9","author":"K.R. Wadleigh","year":"1995","unstructured":"Wadleigh, K.R., Gostin, G.B., Liu, J.: High-performance FFT algorithms for the Convex C4\/XA supercomputer. The Journal of Supercomputing 9 (1995) 163\u2013178","journal-title":"The Journal of Supercomputing"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Frigo, M., Johnson, S.G.: The fastest Fourier transform in the west. Technical Report MIT-LCS-TR-728, MIT Laboratory for Computer Science (1997)","DOI":"10.21236\/ADA479065"},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1177\/109434209901300206","volume":"13","author":"K.R. Wadleigh","year":"1999","unstructured":"Wadleigh, K.R.: High performance FFT algorithms for cache-coherent multiprocessors. The International Journal of High Performance Computing Applications 13 (1999) 163\u2013171","journal-title":"The International Journal of High Performance Computing Applications"},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1109\/TAU.1967.1161899","volume":"15","author":"W.T. Cochrane","year":"1967","unstructured":"Cochrane, W.T., Cooley, J.W., Favin, D.L., Helms, H.D., Kaenel, R.A., Lang, W.W., Maling, Jr., G.C., Nelson, D.E., Rader, C.M., Welch, P.D.: What is the fast Fourier transform? IEEE Trans. Audio Electroacoust. 15 (1967) 45\u201355","journal-title":"IEEE Trans. Audio Electroacoust"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0167-8191(84)90413-7","volume":"1","author":"P.N. Swarztrauber","year":"1984","unstructured":"Swarztrauber, P.N.: FFT algorithms for vector computers. Parallel Computing 1 (1984) 45\u201363","journal-title":"Parallel Computing"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Takahashi, D.: High-performance parallel FFT algorithms for the HITACHI SR8000. In: Proc. Fourth International Conference\/Exhibition on High Performance Computing in Asia-Pacific Region (HPC-Asia 2000). (2000) 192\u2013199","DOI":"10.1109\/HPC.2000.846545"},{"key":"38_CR11","unstructured":"OpenMP: Simple, Portable, Scalable SMP Programming. ( http:\/\/www.openmp.org )"},{"key":"38_CR12","unstructured":"Frigo, M., Johnson, S.G.: Fftw. ( http:\/\/www.fftw.org )"},{"key":"38_CR13","unstructured":"Omni: RWCP Omni OpenMP Compiler Project. ( http:\/\/www.hpcc.jp\/Omni\/ )"},{"key":"38_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/97.917698","volume":"8","author":"D. Takahashi","year":"2001","unstructured":"Takahashi, D.: An extended split-radix FFT algorithm. IEEE Signal Processing Letters 8 (2001) 145\u2013147","journal-title":"IEEE Signal Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Applied Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48051-X_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T04:45:31Z","timestamp":1556426731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48051-X_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540437864","9783540480518"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-48051-x_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002]]}}}