A practical hierarchical model of parallel computation. II: Binary tree and FFT algorithms
From MaRDI portal
Publication:1206378
DOI10.1016/0743-7315(92)90035-LzbMath0794.68050OpenAlexW2092991296MaRDI QIDQ1206378
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
FFTparallel computationcomplete binary tree computationshierarchical PRAM modelstructured computations
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