{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T01:54:35Z","timestamp":1649210075448},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2006,6]]},"abstract":"<jats:p> Computing the 1-D Fast Fourier Transform (FFT) using the conventional six-step FFT algorithm on parallel computers requires intensive all-to-all communication due to the necessity of matrix transpose in three steps. This all-to-all communication is a limiting factor in improving the performance of FFT in its parallel implementations. In this paper, we present two parallel algorithms for implementing the 1-D FFT without all-to-all communication between processors, at the expense of increased inner-processor computation as compared to the conventional six-step FFT algorithm. Our analysis reveals the advantage of these two algorithms over the six-step FFT algorithm in parallel systems where the cost of inter-processor communication outweighs the cost of inner-processor computation. As a case study, we choose a 32-node Beowulf cluster with fast processors (running at 2 GHz) but relatively slow inter-processor communication (over a 100 Mbit\/s switch). Simulation results on this cluster demonstrate that the proposed no-communication FFT algorithms can achieve a speedup ranging from 1.1 to 1.5 over the six-step FFT algorithm. <\/jats:p>","DOI":"10.1142\/s012962640600254x","type":"journal-article","created":{"date-parts":[[2006,7,20]],"date-time":"2006-07-20T11:36:02Z","timestamp":1153395362000},"page":"153-164","source":"Crossref","is-referenced-by-count":0,"title":["TWO PARALLEL 1-D FFT ALGORITHMS WITHOUT ALL-TO-ALL COMMUNICATION"],"prefix":"10.1142","volume":"16","author":[{"given":"RAMI","family":"AL NA'MNEH","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Alabama in Huntsville, Huntsville, Alabama 35899, USA"}]},{"given":"W. DAVID","family":"PAN","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Alabama in Huntsville, Huntsville, Alabama 35899, USA"}]},{"given":"SEONG-MOO","family":"YOO","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Alabama in Huntsville, Huntsville, Alabama 35899, USA"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(87)90018-4"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(00)00107-1"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/BF00162341"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1109\/71.80164"},{"key":"rf5","first-page":"1036","volume":"26","author":"Gertner I.","journal-title":"IEEE Trans. Acoust., Speech, and Signal Processing"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1109\/78.365307"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1109\/12.795223"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1109\/78.796458"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012962640600254X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:15:26Z","timestamp":1565108126000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012962640600254X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6]]},"references-count":8,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2006,6]]}},"alternative-id":["10.1142\/S012962640600254X"],"URL":"https:\/\/doi.org\/10.1142\/s012962640600254x","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6]]}}}