IEEE Transactions on Computers · 1992 · 51 citations · 10 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureParallel AlgorithmsParallel ComputingParallel ArchitecturesParallel Computer ArchitecturePipeline ParallelismTiming AnalysisAddersBranch InstructionsFast Arithmetic CircuitsResponse Time
The response time of parallel adders is mainly determined by the carry propagation delay. The evaluation of conditions of the type A+B=K is addressed. Although an addition is involved in the comparison, it is shown that it can be evaluated without carry propagation, thus drastically reducing the computation time. Dependencies produced by branches degrade the performance of pipelined computers. The evaluation of conditions is often one of the critical paths in the execution of branch instructions. A circuit is proposed for the fast evaluation of A+B=K conditions that can significantly improve processor performance.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
10
A Regular Layout for Parallel Adders
Brent, Kung · IEEE Transactions on Computers · 1982 · 1.1K citations
Scott McFarling, J. Hennesey · ACM SIGARCH Computer Architecture News · 1986 · 263 citations
Hennessy · IEEE Transactions on Computers · 1984 · 215 citations
David A. Patterson, Carlo H. Séquin · 1998 · 183 citations