{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:38:40Z","timestamp":1725493120197},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440499"},{"type":"electronic","value":"9783540457060"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45706-2_96","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T01:37:18Z","timestamp":1191721038000},"page":"691-700","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Blocking Algorithm for Parallel 1-D FFT on Clusters of PCs"],"prefix":"10.1007","author":[{"given":"Daisuke","family":"Takahashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taisuke","family":"Boku","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitsuhisa","family":"Sato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,20]]},"reference":[{"key":"96_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.2307\/2003354","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":"96_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":"96_CR3","unstructured":"Agarwal, R.C., Gustavson, F.G., Zubair, M.: A high performance parallel algorithm for 1-D FFT. In: Proc. Supercomputing\u2019 94. (1994) 34\u201340"},{"key":"96_CR4","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s002110050074","volume":"68","author":"M. Hegland","year":"1994","unstructured":"Hegland, M.: A self-sorting in-place fast Fourier transform algorithm suitable for vector and parallel processing. Numerische Mathematik 68 (1994) 507\u2013547","journal-title":"Numerische Mathematik"},{"key":"96_CR5","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1137\/S1064827597316266","volume":"20","author":"A. Edelman","year":"1999","unstructured":"Edelman, A., McCorquodale, P., Toledo, S.: The future fast Fourier transform? SIAM J. Sci. Comput. 20 (1999) 1094\u20131114","journal-title":"SIAM J. Sci. Comput."},{"key":"96_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/3-540-45545-0_17","volume-title":"Proc. 2001 International Conference on Computational Science (ICCS 2001)","author":"D. Mirkovi\u0107","year":"2001","unstructured":"Mirkovi\u0107, D., Johnsson, S, L.: Automatic performance tuning in the UHFFT library. In: Proc. 2001 International Conference on Computational Science (ICCS 2001). Volume 2073 of Lecture Notes in Computer Science., Springer-Verlag (2001) 71\u201380"},{"key":"96_CR7","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":"96_CR8","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":"Van Loan, C.: Computational Frameworks for the Fast Fourier Transform. SIAM Press, Philadelphia, PA (1992)"},{"key":"96_CR9","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":"96_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/3-540-48228-8_58","volume-title":"Proc. 9th International Conference on High Performance Computing and Networking Europe (HPCN Europe 2001)","author":"D. Takahashi","year":"2001","unstructured":"Takahashi, D.: A blocking algorithm for FFT on cache-based processors. In: Proc. 9th International Conference on High Performance Computing and Networking Europe (HPCN Europe 2001). Volume 2110 of Lecture Notes in Computer Science., Springer-Verlag (2001) 551\u2013554"},{"key":"96_CR11","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":"96_CR12","doi-asserted-by":"crossref","unstructured":"Frigo, M., Johnson, S.G.: The fastest Fourier transform in the west. Technical Report MIT-LCS-TR-728, MIT Lab for Computer Science (1997)","DOI":"10.21236\/ADA479065"},{"key":"96_CR13","unstructured":"Sumimoto, S., Tezuka, H., Hori, A., Harada, H., Takahashi, T., Ishikawa, Y.: High performance communication using a commodity network for cluster systems. In: Proc. Ninth International Symposium on High Performance Distributed Computing (HPDC-9). (2000) 139\u2013146"},{"key":"96_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","Euro-Par 2002 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45706-2_96","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T20:15:21Z","timestamp":1587327321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45706-2_96"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440499","9783540457060"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45706-2_96","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"20 August 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}