{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T06:52:03Z","timestamp":1768027923303,"version":"3.49.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"14","license":[{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"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":[[2001,12]]},"DOI":"10.1016\/s0167-8191(01)00118-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:49:09Z","timestamp":1027601349000},"page":"1847-1878","source":"Crossref","is-referenced-by-count":20,"title":["A simple and efficient parallel FFT algorithm using the BSP model"],"prefix":"10.1016","volume":"27","author":[{"given":"M\u00e1rcia A.","family":"Inda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob H.","family":"Bisseling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(01)00118-1_BIB1","series-title":"The DFT: An Owner's Manual for the Discrete Fourier Transform","author":"Briggs","year":"1995"},{"key":"10.1016\/S0167-8191(01)00118-1_BIB2","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":"Mathematics of Computation"},{"key":"10.1016\/S0167-8191(01)00118-1_BIB3","series-title":"Computational Frameworks for the Fast Fourier Transform","author":"Van Loan","year":"1992"},{"issue":"9","key":"10.1016\/S0167-8191(01)00118-1_BIB4","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1109\/PROC.1987.13880","article-title":"Vectorized mixed radix discrete Fourier transform algorithms","volume":"75","author":"Agarwal","year":"1987","journal-title":"Proceedings of the IEEE"},{"key":"10.1016\/S0167-8191(01)00118-1_BIB5","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":"Ashworth","year":"1988","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(01)00118-1_BIB6","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(01)00118-1_BIB7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0024-3795(98)10086-1","article-title":"FFT algorithms and their adaptation to parallel processing","volume":"284","author":"Chu","year":"1998","journal-title":"Linear Algebra and its Applications"},{"key":"10.1016\/S0167-8191(01)00118-1_BIB8","doi-asserted-by":"crossref","first-page":"1697","DOI":"10.1016\/0167-8191(94)90126-0","article-title":"A general purpose subroutine for Fast Fourier Transform on a distributed memory parallel machine","volume":"20","author":"Dubey","year":"1994","journal-title":"Parallel Computing"},{"issue":"8","key":"10.1016\/S0167-8191(01)00118-1_BIB9","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(01)00118-1_BIB10","series-title":"Proceedings of the Fourth European SGI\/Cray MPP Workshop","first-page":"188","article-title":"A parallel one-dimensional FFT for Cray T3E","author":"Haan","year":"1998"},{"key":"10.1016\/S0167-8191(01)00118-1_BIB11","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/0167-8191(96)00015-4","article-title":"Real and complex fast Fourier transforms on the Fujitsu VPP 500","volume":"22","author":"Hegland","year":"1996","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(01)00118-1_BIB12","series-title":"Introduction to Parallel Computing: Design and Analysis of Algorithms","author":"Kumar","year":"1994"},{"key":"10.1016\/S0167-8191(01)00118-1_BIB13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0167-739X(96)00030-1","article-title":"portability and predictability: The BSP approach to parallel programming","volume":"12","author":"McColl","year":"1996","journal-title":"Future Generation Computer Systems"},{"key":"10.1016\/S0167-8191(01)00118-1_BIB14","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 Computing"},{"key":"10.1016\/S0167-8191(01)00118-1_BIB15","unstructured":"M.A. Inda, Constructing parallel algorithms for discrete transforms: from FFTs to fast Legendre transforms, Ph.D. Thesis, Department of Mathematics, Utrecht University, Utrecht, The Netherlands, March 2000"},{"key":"10.1016\/S0167-8191(01)00118-1_BIB16","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/TASSP.1976.1162764","article-title":"One-dimensional and two-dimensional generalized discrete Fourier transforms","volume":"ASSP-24","author":"Bongiovanni","year":"1976","journal-title":"IEEE Transactions on Acoustics, Speech, and Signal Processing"},{"issue":"11","key":"10.1016\/S0167-8191(01)00118-1_BIB17","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1109\/TC.1979.1675262","article-title":"Properties of the multidimensional generalized discrete Fourier transform","volume":"c-28","author":"Corsini","year":"1979","journal-title":"IEEE Transactions on Computers"},{"issue":"4","key":"10.1016\/S0167-8191(01)00118-1_BIB18","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/1031127","article-title":"Kronecker products, unitary matrices and signal processing applications","volume":"31","author":"Regalia","year":"1989","journal-title":"SIAM Review"},{"issue":"8","key":"10.1016\/S0167-8191(01)00118-1_BIB19","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","article-title":"A bridging model for parallel computation","volume":"33","author":"Valiant","year":"1990","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0167-8191(01)00118-1_BIB20","series-title":"Workshop Numerical Analysis and its Applications 1996","first-page":"46","article-title":"Basic techniques for numerical linear algebra on bulk synchronous parallel computers","volume":"vol. 1196","author":"Bisseling","year":"1997"},{"key":"10.1016\/S0167-8191(01)00118-1_BIB21","doi-asserted-by":"crossref","first-page":"1947","DOI":"10.1016\/S0167-8191(98)00093-3","article-title":"BSPlib: The BSP programming library","volume":"24","author":"Hill","year":"1998","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(01)00118-1_BIB22","doi-asserted-by":"crossref","unstructured":"O. Bonorden, B. Juurlink, I. von Otte, I. Rieping, The Paderborn University BSP (PUB) library \u2013 design, implementation and performance, in: 13th International Parallel Processing Symposium & 10th Symposium on Parallel and Distributed Processing (IPPS\/SPDP), San Juan, Puerto Rico, 1999","DOI":"10.1109\/IPPS.1999.760442"},{"issue":"2","key":"10.1016\/S0167-8191(01)00118-1_BIB23","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1145\/321450.321457","article-title":"An adaptation of the fast Fourier transform for parallel processing","volume":"15","author":"Pease","year":"1968","journal-title":"Journal of the ACM"},{"issue":"1","key":"10.1016\/S0167-8191(01)00118-1_BIB24","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1137\/S1064827599355864","article-title":"On the efficient parallel computation of Legendre transforms","volume":"23","author":"Inda","year":"2001","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"1","key":"10.1016\/S0167-8191(01)00118-1_BIB25","first-page":"8","article-title":"Parallel implementation of the split-step Fourier method for solving nonlinear Sch\u00f6dinger systems","volume":"32","author":"Zoldi","year":"1999","journal-title":"SIAM News"},{"issue":"5","key":"10.1016\/S0167-8191(01)00118-1_BIB26","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1145\/42411.42415","article-title":"Reevaluating Amdahl's law","volume":"31","author":"Gustafson","year":"1988","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0167-8191(01)00118-1_BIB27","series-title":"Dynamics of Molecules and Chemical Reactions","first-page":"185","article-title":"Quantum molecular dynamics on grids","author":"Kosloff","year":"1996"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819101001181?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819101001181?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T12:21:05Z","timestamp":1556194865000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819101001181"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":27,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["S0167819101001181"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(01)00118-1","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2001,12]]}}}