Name
Abstract | ||
|---|---|---|
We present efficient methods to determine the four usual branch conditions for a sum or difference, before the result of the addition or subtraction is available. The methods lead to the design of an early branch resolver which integrates well with a regular adder/subtracter, adding only a small amount of circuitry and almost no delay. The methods exploit the properties of half-adder form. Sums in half-adder form can be computed very quickly (with the delay of a half adder), yet they have enough structure so that many of the properties of the final sum can be easily detected. The reduced latency for evaluating branch conditions means that an addition or subtraction and a dependent conditional instruction can execute in the same cycle, with a consequent increase in instruction-level parallelism, and improved performance for both single-issue and superscalar processors. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1109/ARITH.1997.614904 | IEEE Symposium on Computer Arithmetic |
Keywords | Field | DocType |
consequent increase,early branch resolver,dependent conditional instruction,half adder,half-adder form,efficient method,early branch condition resolution,branch condition,final sum,regular adder,usual branch condition,indexing terms,circuits,instruction sets,sum,adders,instruction level parallelism,difference,information science,computer performance,parallel processing,addition,testing,subtraction,circuitry,detectors | Resolver,Adder,Subtractor,Computer science,Latency (engineering),Parallel computing,Algorithm,Serial binary adder,Carry-save adder,Superscalar,Subtraction | Conference |
ISSN | ISBN | Citations |
1063-6889 | 0-8186-7846-1 | 7 |
PageRank | References | Authors |
0.88 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David R. Lutz | 1 | 24 | 4.91 |
| D. N. Jayasimha | 2 | 158 | 16.02 |