{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:42:55Z","timestamp":1757544175206,"version":"3.30.2"},"reference-count":23,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1016\/0167-8191(94)90126-0","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T06:10:42Z","timestamp":1060323042000},"page":"1697-1710","source":"Crossref","is-referenced-by-count":10,"title":["A general purpose subroutine for fast fourier transform on a distributed memory parallel machine"],"prefix":"10.1016","volume":"20","author":[{"given":"A.","family":"Dubey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Zubair","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.E.","family":"Grosch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(94)90126-0_BIB1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-8191(90)90031-4","article-title":"A parallel FFT on a MIMD machine","volume":"15","author":"Auerbuch","year":"1990","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(94)90126-0_BIB2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF00138605","article-title":"A high-performance Fast Fourier Transform algorithm for the CRAY-2","volume":"1","author":"Bailey","year":"1987","journal-title":"J. Supercomput."},{"doi-asserted-by":"crossref","unstructured":"Bailey, D.H., Frederickson, P.O., Performance results for two of the NAS parallel benchmarks, Supercomputing '91, 166\u2013173","key":"10.1016\/0167-8191(94)90126-0_BIB3","DOI":"10.1145\/125826.125930"},{"unstructured":"S.H. Bokhari, Complete exchange on the iPSC\/860, ICASE Report No. 91-4.","key":"10.1016\/0167-8191(94)90126-0_BIB4"},{"unstructured":"S.H. Bokhari, Multiphase complete exchange on a circuit switched hypercube, ICASE Report No. 91-5.","key":"10.1016\/0167-8191(94)90126-0_BIB5"},{"key":"10.1016\/0167-8191(94)90126-0_BIB6","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF00129773","article-title":"Ultrahigh-performance FFTs for the Cray-2 and Cray Y-MP supercomputers","volume":"6","author":"Carlson","year":"1992","journal-title":"J. Supercomput."},{"key":"10.1016\/0167-8191(94)90126-0_BIB7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0167-8191(88)90087-7","article-title":"Gray codes, Fast Fourier Transforms and Hypercubes","volume":"6","author":"Chamberlain","year":"1988","journal-title":"Parallel Comput."},{"year":"1990","author":"Seidel","article-title":"Concurrent bidirectional communication on the Intel iPSC\/860 and iPSC\/2","key":"10.1016\/0167-8191(94)90126-0_BIB8"},{"year":"1975","author":"Rabiner","series-title":"Theory and Application of Digital Signal Processing","key":"10.1016\/0167-8191(94)90126-0_BIB9"},{"year":"1981","author":"Hockney","series-title":"Parallel Computers","key":"10.1016\/0167-8191(94)90126-0_BIB10"},{"key":"10.1016\/0167-8191(94)90126-0_BIB11","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0743-7315(86)90027-4","article-title":"FFT algorithm for SIMD parallel processing systems","volume":"3","author":"Jamieson","year":"1986","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/0167-8191(94)90126-0_BIB12","first-page":"223","article-title":"Computing Fast Fourier Transform on Boolean cubes and related networks","volume":"vol. 826","author":"Johnson","year":"1987"},{"key":"10.1016\/0167-8191(94)90126-0_BIB13","series-title":"Proc. Supercomputing 89","first-page":"809","article-title":"A radix 2 FFT on the connection machine","author":"Johnsson","year":"1989"},{"year":"1989","author":"Johnsson","article-title":"High radix FFT on Boolean cube networks","key":"10.1016\/0167-8191(94)90126-0_BIB14"},{"year":"1991","author":"Johnsson","article-title":"Communication efficient multiprocessor FFT","key":"10.1016\/0167-8191(94)90126-0_BIB15"},{"key":"10.1016\/0167-8191(94)90126-0_BIB16","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1016\/0167-8191(92)90066-G","article-title":"Cooley-Tukey FFT on the Connection Machine","volume":"18","author":"Johnsson","year":"1992","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(94)90126-0_BIB17","series-title":"Proc. Conf. on Scientific Applications on The Connection Machine","first-page":"134","article-title":"Fast Fourier Transform algorithm design and tradeoffs on the CM-2","author":"Kamin","year":"1988"},{"issue":"3","key":"10.1016\/0167-8191(94)90126-0_BIB18","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1145\/355841.355847","article-title":"Basic linear algebra subprogram for FORTRAN usage","volume":"5","author":"Lawson","year":"1979","journal-title":"ACM Trans. Math. Soft."},{"year":"1990","author":"Schmiermund","article-title":"A communication model for the Intel iPSC\/2","key":"10.1016\/0167-8191(94)90126-0_BIB19"},{"key":"10.1016\/0167-8191(94)90126-0_BIB20","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0167-8191(87)90018-4","article-title":"Multiprocessor FFTs","volume":"5","author":"Swarztrauber","year":"1987","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(94)90126-0_BIB21","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/S0167-8191(05)80051-1","article-title":"Bluestein's FFT for arbitrary N on the hypercube","volume":"17","author":"Swarztrauber","year":"1991","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(94)90126-0_BIB22","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0743-7315(91)90028-8","article-title":"Ordered Fast Fourier Transform on a massively parallel hypercube multiprocessor","volume":"12","author":"Tong","year":"1991","journal-title":"J. Parallel Distributed Comput."},{"year":"1991","author":"Walker","article-title":"Design issues for a scalable library algebra subroutines","key":"10.1016\/0167-8191(94)90126-0_BIB23"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819194901260?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819194901260?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T12:39:13Z","timestamp":1734093553000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819194901260"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":23,"journal-issue":{"issue":"12","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0167819194901260"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(94)90126-0","relation":{},"ISSN":["0167-8191"],"issn-type":[{"type":"print","value":"0167-8191"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}