{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T00:10:26Z","timestamp":1736640626273,"version":"3.32.0"},"reference-count":11,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2006,10,27]],"date-time":"2006-10-27T00:00:00Z","timestamp":1161907200000},"content-version":"vor","delay-in-days":5505,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Concurrency: Pract. Exper."],"published-print":{"date-parts":[[1991,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>On sequential computers, the prime factor algorithm (PFA) allows the Computation of the discrete Fourier transform (DFT) with a higher efficiency than the traditional Cooley\u2010Tukey FFT algorithm (CTA). However, the PFA requires substantial data movement, which poses a challenging problem for distributed\u2010memory multi\u2010processor systems. In this paper, two approaches for a concurrent implementation of the PFA on these structures are presented. In the first approach, the concurrent PFA runs on all nodes of the multi\u2010processor system, which is inefficient on large configurations due to the large communication overhead. A second approach developed to reduce this bottleneck is also presented. These solutions have been benchmarked on Caltech hypercubes, and the performances achieved are reported. In both approaches, the<jats:italic>crystal_router<\/jats:italic>algorithm was exploited as a concurrent technique for communicating data among nodes.<\/jats:p>","DOI":"10.1002\/cpe.4330030503","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T16:20:10Z","timestamp":1163780410000},"page":"483-495","source":"Crossref","is-referenced-by-count":6,"title":["Two approaches to the concurrent implementation of the prime factor algorithm on a hypercube"],"prefix":"10.1002","volume":"3","author":[{"given":"G.","family":"Aloisio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Lopinto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Veneziani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. C.","family":"Fox","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. S.","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,27]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1111\/j.2517-6161.1958.tb00300.x","article-title":"The interaction of algorithm and practical Fourier analysis","volume":"20","author":"Good I. J.","year":"1958","journal-title":"J. Royal Statist. Soc."},{"key":"e_1_2_1_2_3","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1111\/j.2517-6161.1960.tb00384.x","volume":"22","year":"1960","journal-title":"J. Royal Statist. Soc."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1968.6477"},{"key":"e_1_2_1_5_2","unstructured":"S.Winograd \u2018Some bilinear forms whose multiplicative complexity depends on the field of constants\u2019 IBM Res. Rep. RC5669 (Oct.1975)."},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","unstructured":"S.Winograd \u2018A new method for computing DFT\u2019 Proc. IEEE Internal Conf. ASSPP 366\u2013368(1977).","DOI":"10.1109\/ICASSP.1977.1170234"},{"key":"e_1_2_1_7_2","unstructured":"H. J.Nassbaumer \u2018Fast Fourier transform and convolution algorithms\u2019 Springer Series in Information Science T. S. Huang (ed.)."},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/78.80774"},{"volume-title":"Solving Problem on Concurrent Processors","year":"1988","author":"Fox G. C.","key":"e_1_2_1_9_2"},{"volume-title":"Solving Problems on Concurrent Processors: Software for Concurrent Processors","year":"1990","author":"Angus I. G.","key":"e_1_2_1_9_3"},{"key":"e_1_2_1_10_2","unstructured":"G.Aloisio G. C.Fox J. S.KimandN.Veneziani \u2018Digital real\u2010time SAR processing: partitioning alternatives\u2019 Caltech Technical Report C3P\u2010485."}],"container-title":["Concurrency: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fcpe.4330030503","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.4330030503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T23:52:01Z","timestamp":1736639521000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cpe.4330030503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,10]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1991,10]]}},"alternative-id":["10.1002\/cpe.4330030503"],"URL":"https:\/\/doi.org\/10.1002\/cpe.4330030503","archive":["Portico"],"relation":{},"ISSN":["1040-3108","1096-9128"],"issn-type":[{"type":"print","value":"1040-3108"},{"type":"electronic","value":"1096-9128"}],"subject":[],"published":{"date-parts":[[1991,10]]}}}