Faster optimal parallel prefix circuits: new algorithmic construction
From MaRDI portal
Publication:852883
DOI10.1016/J.JPDC.2005.05.017zbMath1103.68976OpenAlexW2118884301MaRDI QIDQ852883
Publication date: 15 November 2006
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2005.05.017
parallel algorithmsdepthprefix computationcombinational circuitsdepth-size optimalfan-outsize optimal
Related Items (2)
A class of almost-optimal size-independent parallel prefix circuits ⋮ Functional and dynamic programming in the design of parallel prefix networks
This page was built for publication: Faster optimal parallel prefix circuits: new algorithmic construction