Efficient overlapped FFT algorithms for hypercube-connected multicomputers

Simple item page
buir.contributor.authorAykanat, Cevdet
dc.citation.epage110en_US
dc.citation.issueNumber1-2en_US
dc.citation.spage91en_US
dc.citation.volumeNumber4en_US
dc.contributor.authorAykanat, Cevdeten_US
dc.contributor.authorDervis, A.en_US
dc.date.accessioned2016-02-08T10:53:17Z
dc.date.available2016-02-08T10:53:17Z
dc.date.issued1994en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.description.abstractIn this work, we propose parallel FFT algorithms, for medium-to-coarse grain hypercube-connected multicomputers, which are more elegant and efficient than the existing ones. The proposed algorithms achieve perfect load-balance for the efficient simplified-butterfly scheme, minimize the communication overhead by decreasing both the number and the volume of concurrent communications. Communication and computation cannot be overlapped easily due to the strong data dependencies in the FFT algorithm. In this paper, we propose a restructuring for the FFT algorithm which enables overlapping each communication with one fifth of the local computations involved in a stage. Two of the proposed parallel FET algorithms achieve overlapping by exploiting this restructuring while using the efficient table-lookup scheme for complex coefficients. The proposed algorithms are implemented on an Intel’s 32-node iPSC/2 hypercube multicomputer. High efficiency values are obtained even for small size FFT problems. © 1994, Taylor & Francis Group, LLC. All rights reserved.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:53:17Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1994en
dc.identifier.doi10.1080/10637199408915457en_US
dc.identifier.eissn1029-032X
dc.identifier.issn1063-7192
dc.identifier.urihttp://hdl.handle.net/11693/25981
dc.language.isoEnglishen_US
dc.relation.isversionofhttp://dx.doi.org/10.1080/10637199408915457en_US
dc.source.titleParallel Algorithms and Applicationsen_US
dc.subjectFFTen_US
dc.subjectHypercubeen_US
dc.subjectMulticomputeren_US
dc.subjectOverlapping communication and computationen_US
dc.subjectParallel computingen_US
dc.subjectPerfect load balanceen_US
dc.titleEfficient overlapped FFT algorithms for hypercube-connected multicomputersen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Efficient_overlapped_FFT_algorithms_for_hypercube_connected_multicomputers.pdf
Size:
231.06 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Computer Engineering