✦ LIBER ✦

A distributed memory algorithm for 3-D FFTs

✍ Scribed by Calin R. Costian; Dan C. Marinescu

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 687 KB
Volume: 66
Category: Article
ISSN: 0377-0427
DOI: 10.1016/0377-0427(95)00163-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Distributed Memory Algorithm for Lexic

A Distributed Memory Algorithm for Lexicon Building

✍ David Hawking 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 206 KB

A parallel algorithm for preparing word frequency concordances over two specified sets of documents from a collection is presented. Good parallel efficiency is demonstrated on a 128-node distributed memory machine using sets whose combined size exceeds one gigabyte. It is demonstrated that efficienc

Parallel Talbot's algorithm for distribu

Parallel Talbot's algorithm for distributed memory machines

✍ M.A. de Rosa; G. Giunta; M. Rizzardi 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 889 KB

A parallel 1-D FFT algorithm for the Hit

A parallel 1-D FFT algorithm for the Hitachi SR8000

✍ Daisuke Takahashi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 123 KB

In this paper, we propose a high-performance parallel one-dimensional fast Fourier transform (FFT) algorithm on clusters of vector symmetric multiprocessor (SMP) nodes. The fourstep FFT algorithm can be altered into a five-step FFT algorithm to expand the innermost loop length. We use the five-step

A segmented FFT algorithm for vector com

A segmented FFT algorithm for vector computers

✍ Mike Ashworth; Andrew G. Lyne 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 627 KB

A parallel FFT algorithm for transputer

A parallel FFT algorithm for transputer networks

✍ Yonggen Huang; Yakup Paker 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 468 KB

Huang, Y. and Y Paker, A parallel FFT algorithm for transputer networks, Parallel Computing 17 (1991) 895-906 This paper presents a parallel FFT algorithm suitable for MIMD machines\_ It has the properties of uniform granularity, the dominance of computation, and suitability to large data matrices T

A Task Duplication Based Scalable Schedu

A Task Duplication Based Scalable Scheduling Algorithm for Distributed Memory Systems

✍ Sekhar Darbha; Dharma P. Agrawal 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 466 KB

One of the major limitations of distributed memory systems (DMSs) is the high cost for interprocessor communication, which can be minimized by having an efficient task partitioning and scheduling algorithm. It is well known that scheduling the tasks of a directed acyclic graph (DAG) to obtain an opt