{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:08:27Z","timestamp":1759133307930},"reference-count":25,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"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":[[1996,11]]},"DOI":"10.1016\/s0167-8191(96)00039-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T11:29:43Z","timestamp":1027596583000},"page":"1255-1279","source":"Crossref","is-referenced-by-count":24,"title":["Implementation of parallel FFT algorithms on distributed memory machines with a minimum overhead of communication"],"prefix":"10.1016","volume":"22","author":[{"given":"C.","family":"Calvin","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(96)00039-7_BIB1","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0167-8191(88)90086-5","article-title":"A segmented FFT algorithm for vector computers","volume":"6","author":"Asworth","year":"1988","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-8191(90)90031-4","article-title":"A parallel FFT on an MIMD machine","volume":"15","author":"Averbuch","year":"1990","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB3","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0167-8191(86)90033-5","article-title":"Two and three dimensional FFTs on highly parallel computers","volume":"3","author":"Brass","year":"1986","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB4","series-title":"Proceedings of PARCO'93","article-title":"Minimizing communication overhead using pipelining for multi-dimensional FFT on distributed memory machines","author":"Calvin","year":"1993"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB5","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 Computing"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB6","article-title":"Comparison of two-dimensional FFT methods on the hypercube","volume":"Vol. 2","author":"Chu","year":"1988"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB7","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","article-title":"An algorithm for the machine calculation of complex Fourier series","volume":"19","author":"Cooley","year":"1965","journal-title":"Math. Comput."},{"key":"10.1016\/S0167-8191(96)00039-7_BIB8","series-title":"EUROPAR'96","article-title":"Overlapping communication and computation in hypercubes","author":"De Cerio","year":"1996"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB9","series-title":"Proceedings of the 4th Conference on HCCA","article-title":"Implementing the DFT on an hypercube vector parallel computer","author":"Desbat","year":"1989"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB10","first-page":"100","article-title":"Parallelizing the spectral transform method: A comparison of alternative parallel algorithms","volume":"Vol. 1","author":"Foster","year":"1992"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB11","volume":"Vol 1","author":"Fox","year":"1998"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB12","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1109\/71.238626","article-title":"The scalability of FFT on parallel computers","volume":"4","author":"Gupta","year":"1993","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB13","author":"De Rumeur","year":"1994"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB14","series-title":"1987 International Conference on Parallel Processing","first-page":"621","article-title":"Algorithms for matrix transposition on Boolean n-cube Configured Ensemble Architectures","author":"Johnsson","year":"1987"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB15","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/12.29465","article-title":"Optimum broadcasting and personalized communications in hypercubes","volume":"38","author":"Johnsson","year":"1989","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB16","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1016\/0167-8191(92)90066-G","article-title":"Cooley-Tuckey FFT on the connection machine","volume":"18","author":"Johnsson","year":"1992","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB17","author":"Leighton","year":"1992"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB18","article-title":"Comparing interconnecting networks","author":"Monien","year":"1988"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB19","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0167-8191(89)90024-0","article-title":"Data communication in parallel architectures","volume":"11","author":"Saad","year":"1989","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB20","series-title":"Workshop on Massively Parallel Computing","article-title":"A methodologic approach to configure architectures applied to an MIMD transputer based machine for intage and signal processing","author":"Sentieys","year":"1992"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB21","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0743-7315(90)90026-L","article-title":"Intensive hypercube communication, prearranged communication in link-bound machines","author":"Stout","year":"1990","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB22","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0167-8191(87)90018-4","article-title":"Multiprocessors FFTs","volume":"5","author":"Swarztrauber","year":"1987","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB23","author":"Trew","year":"1991"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB24","article-title":"Parallelizing the spectral transform method \u2014 Part II","author":"Walker","year":"1991"},{"key":"10.1016\/S0167-8191(96)00039-7_BIB25","series-title":"The Third Conference On Hypercube Concurrent Computers and Applications","article-title":"Portable programming within a message-passing model: The FFT as an example","author":"Walker","year":"1988"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819196000397?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819196000397?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T01:22:06Z","timestamp":1556328126000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819196000397"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":25,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["S0167819196000397"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(96)00039-7","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}