{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T23:03:16Z","timestamp":1698361396936},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1007\/bf00129835","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T09:44:31Z","timestamp":1099734271000},"page":"345-356","source":"Crossref","is-referenced-by-count":7,"title":["Using local memory to boost the performance of FFT algorithms on the CRAY-2 supercomputer"],"prefix":"10.1007","volume":"4","author":[{"given":"David A.","family":"Carlson","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"Agarwal, R. 1987. An efficient formulation of the mixed-radix FFT algorithm. IBM T.J. Watson Research Center Tech. Rept."},{"issue":"9","key":"CR2","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., and Vitter, J.S. 1988. The input\/output complexity of sorting and related problems. CACM, 31, 9 (Sept.), 1116?1127.","journal-title":"CACM"},{"issue":"4","key":"CR3","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/BF00156677","volume":"2","author":"J. Armstrong","year":"1988","unstructured":"Armstrong, J. 1988. A multi-algorithm approach to very high performance one-dimensional FFTs. The J. Supercomputing, 2, 4 (Dec.), 415?433.","journal-title":"The J. Supercomputing"},{"issue":"1","key":"CR4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF00138605","volume":"1","author":"D. Bailey","year":"1987","unstructured":"Bailey, D. 1987. A high-performance fast Fourier transform algorithm for the CRAY-2. The J. Supercomputing, 1, 1: 43?60.","journal-title":"The J. Supercomputing"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1177\/109434208800200106","volume":"2","author":"D. Bailey","year":"1988","unstructured":"Bailey, D. 1988. A high-performance FFT algorithm for vector supercomputers: Internat. J. Supercomputer Applications, 2: 82?87.","journal-title":"Internat. J. Supercomputer Applications"},{"key":"CR6","volume-title":"The Fast Fourier Transform","author":"E. Brigham","year":"1974","unstructured":"Brigham, E. 1974. The Fast Fourier Transform. Prentice-Hall, Englewood Cliffs, N.J."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/TAU.1967.1161899","volume":"AU-15","author":"W.T. Cochran","year":"1967","unstructured":"Cochran, W.T., Cooley, J.W., Favin, D.L., Helms, H.D., Kaenel, R.A., Lang, W.W., Maling, G.C., Jr., Nelson, D.E., Rader, C.M., and Welch, P.D. 1967. What is the fast Fourier transform? IEEE Trans. Audio Electroacoustics, AU-15: 45?55.","journal-title":"IEEE Trans. Audio Electroacoustics"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"J.W. Cooley","year":"1965","unstructured":"Cooley, J.W., and Tukey, J.W. 1965. An algorithm for the machine calculation of complex Fourier series. Math. Comp. 19: 297?301.","journal-title":"Math. Comp."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/S0025-5718-81-99783-0","volume":"36","author":"B. Fornberg","year":"1981","unstructured":"Fornberg, B. 1981. A vector implementation of the fast Fourier transform algorithm. Math. Comp., 36: 189?191.","journal-title":"Math. Comp."},{"key":"CR10","unstructured":"Hong, J.-W., and Kung, H.T. 1981. I\/O complexity: The red-blue pebble game. Proc., 13th ACM Symp. on Theory of Computing, pp. 326?333."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1145\/321450.321457","volume":"15","author":"M.C. Pease","year":"1968","unstructured":"Pease, M.C. 1968. An adaptation of the fast Fourier transform for parallel processing. JACM, 15: 252?264.","journal-title":"JACM"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1109\/TIT.1978.1055938","volume":"IT-24","author":"J.E. Savage","year":"1978","unstructured":"Savage, J.E., and Swamy, S. 1978. Space-time tradeoffs on the FFT algorithm. IEEE Trans. Inf. Theory, IT-24: 563?568.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0167-8191(84)90413-7","volume":"1","author":"P.N. Swarztrauber","year":"1984","unstructured":"Swarztrauber, P.N. 1984. FFT algorithms for vector computers. Parallel Computing, 1: 45?63.","journal-title":"Parallel Computing"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0167-8191(87)90018-4","volume":"5","author":"P.N. Swarztrauber","year":"1987","unstructured":"Swarztrauber, P.N. 1987. Multiprocessor FFTs. Parallel Computing, 5: 197?210.","journal-title":"Parallel Computing"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0021-9991(83)90013-X","volume":"52","author":"C. Temperton","year":"1983","unstructured":"Temperton, C. 1983. Self-sorting, mixed-radix fast Fourier transforms. J. Comp. Physics, 52: 1?23.","journal-title":"J. Comp. Physics"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00129835.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00129835\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00129835","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T04:51:41Z","timestamp":1554267101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00129835"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["BF00129835"],"URL":"https:\/\/doi.org\/10.1007\/bf00129835","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}