Instruction-level parallelism from execution interlock collapsing
- 1 September 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGARCH Computer Architecture News
- Vol. 20 (4) , 38-43
- https://doi.org/10.1145/142880.142893
Abstract
An innovative technique has been developed that permits the collapsing of execution interlocks between integer ALU operations as well as between address generation operations, allowing parallel execution of two instructions, having true dependencies, in a single cycle. Given that the proposed scheme has been shown not to increase the machine cycle time, it potentially provides an attractive means for increasing the instruction--level parallelism. Preliminary results show that within the basic blocks, the geometric mean of the speedup from this new design technique is up to 10% in the integer SPEC Benchmarks. The geometric mean of the speedup including floating point benchmarks is up to 6%. The results also suggest that depending on the application environment this new design may be used as an alternative to the relatively more expensive out--of--order instruction issue approach.Keywords
This publication has 8 references indexed in Scilit:
- High-performance 3-1 interlock collapsing ALU'sIEEE Transactions on Computers, 1994
- Interlock collapsing ALU'sIEEE Transactions on Computers, 1993
- Proof of correctness of high-performance 3—1 interlock collapsing ALUsIBM Journal of Research and Development, 1993
- Limits of instruction-level parallelismPublished by Association for Computing Machinery (ACM) ,1991
- Single instruction stream parallelism is greater than twoPublished by Association for Computing Machinery (ACM) ,1991
- Recursive equations for hardwired binary addersInternational Journal of Electronics, 1989
- Implementing precise interrupts in pipelined processorsIEEE Transactions on Computers, 1988
- A comparison between adders with new defined carries and traditional schemes for additionInternational Journal of Electronics, 1988