Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Efficient Overlapped FFT Algorithms for Hypercube-Connected Multicomputers
 

Summary: Efficient Overlapped FFT Algorithms for
Hypercube-Connected Multicomputers
Cevdet Aykanat and Argun Dervis¸
Department of Computer Engineering, Bilkent University
06533 Bilkent, Ankara, Turkey
Abstract
In 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 con-
current 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 FFT algorithms achieve overlap-
ping 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.
KEYWORDS : FFT, Parallel Computing, Multicomputer, Hypercube, Perfect Load Balance, Over-
lapping Communication and Computation.
1 Introduction

  

Source: Aykanat, Cevdet - Department of Computer Engineering, Bilkent University

 

Collections: Computer Technologies and Information Sciences