Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

A parallel FFT algorithm for transputer networks

From MaRDI portal
Publication:1180606
Jump to:navigation, search

DOI10.1016/S0167-8191(05)80073-0zbMath0752.65097OpenAlexW1984662206MaRDI QIDQ1180606

Yakup Paker, Yonggen Huang

Publication date: 27 June 1992

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(05)80073-0


zbMATH Keywords

performancefast Fourier transformparallel algorithmsMIMD machinestree topologycubic topologyOccam languagetransputer networks


Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)


Related Items (1)

PERFORMANCE ANALYSIS OF A PARALLEL FFT ALGORITHM ON A TRANSPUTER NETWORK







This page was built for publication: A parallel FFT algorithm for transputer networks

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1180606&oldid=12038146"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 29 January 2024, at 23:57.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki