A class of almost-optimal size-independent parallel prefix circuits

DOI10.1016/J.JPDC.2013.03.012zbMath1284.94163OpenAlexW2085318004MaRDI QIDQ2443006

Hatem M. El-Boghdadi

Publication date: 2 April 2014

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.2013.03.012

zbMATH Keywords

parallel algorithmsdepth-size optimalprefix operationsproblem-size independent

Mathematics Subject Classification ID

Analytic circuit theory (94C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiple addition and prefix sum on a linear array with a reconfigurable pipelined bus system
• Faster optimal parallel prefix circuits: new algorithmic construction
• The parallel complexity of integer prefix summation
• Faster optimal parallel prefix sums and list ranking
• A new approach to constructing optimal parallel prefix circuits with small depth
• Parallel tree contraction and prefix computations on a large family of interconnection topologies

This page was built for publication: A class of almost-optimal size-independent parallel prefix circuits