On the complexity of parallelizing sequential circuits using the parallel-prefix method

DOI10.1109/81.956018MaRDI QIDQ4540097zbMATH OpenOpenAlexFDO

Authors Christoforos N. Hadjicostis

Publication date 21 July 2002

Published in IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/46cfc8c1a0cd34ac820d86de93da954f0187b449

zbMATH Keywords

discrete-time iteration boundfinite-state machineparallel processingparallel-prefix methodprefix problemsequential circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• Parallel Prefix Computation
• scientific article; zbMATH DE number 1307000
• Depth-size trade-offs for parallel prefix computation
• A class of almost-optimal size-independent parallel prefix circuits
• Faster optimal parallel prefix circuits: new algorithmic construction

Cited in

(7)

• Boolean circuit programming: A new paradigm to design parallel algorithms
• The complexity of parallel prefix problems on small domains
• Constructing \(H\)4, a fast depth-size optimal parallel prefix circuit
• A class of almost-optimal size-independent parallel prefix circuits
• scientific article; zbMATH DE number 1307000 (Why is no real title available?)
• The Dynamic Parallel Complexity of Computational Circuits
• scientific article; zbMATH DE number 2114154 (Why is no real title available?)

This page was built for publication: On the complexity of parallelizing sequential circuits using the parallel-prefix method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540097)