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
Discussion
View source
View history
Purge
English
Log in

A practical hierarchical model of parallel computation. II: Binary tree and FFT algorithms

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

DOI10.1016/0743-7315(92)90035-LzbMath0794.68050OpenAlexW2092991296MaRDI QIDQ1206378

Sanjay Ranka, Todd Heywood

Publication date: 1 April 1993

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-7315(92)90035-l


zbMATH Keywords

FFTparallel computationcomplete binary tree computationshierarchical PRAM modelstructured computations


Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)


Related Items (2)

The Fork95 programming language: Design, implementation, application. ⋮ Optimal broadcast on parallel locality models







This page was built for publication: A practical hierarchical model of parallel computation. II: Binary tree and FFT algorithms

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