1990
DOI: 10.1049/ip-e.1990.0032
|View full text |Cite
|
Sign up to set email alerts
|

A comparative architectural study of three MIMD computing surfaces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 2 publications
0
2
0
Order By: Relevance
“…P C P P C Solving 2D FFTon theMMCPC In t h e following we solve a 2D fast Fourier transform (FFT)problem on the MMCPC to show that the addition of buses to a mesh is indeed a cost-effective performance enhancement to a real problem. We first introduce the 2D FFT algorithm designed for the mesh-like multicomputer [21] and then findout thespeedup. 2 Algorithm: Performing a 2D p -point FFT on the mesh-like 2 message-passing MIMD machine with N PE's in total.…”
Section: Duties Of the Communication Servermentioning
confidence: 99%
See 1 more Smart Citation
“…P C P P C Solving 2D FFTon theMMCPC In t h e following we solve a 2D fast Fourier transform (FFT)problem on the MMCPC to show that the addition of buses to a mesh is indeed a cost-effective performance enhancement to a real problem. We first introduce the 2D FFT algorithm designed for the mesh-like multicomputer [21] and then findout thespeedup. 2 Algorithm: Performing a 2D p -point FFT on the mesh-like 2 message-passing MIMD machine with N PE's in total.…”
Section: Duties Of the Communication Servermentioning
confidence: 99%
“…The architecture has generated excellent performance. The detail analysis of computation and communications times for the FFT algorithm can befoundin [21].…”
mentioning
confidence: 99%