Sciweavers

Share
EUROPAR
2001
Springer

Execution Latency Reduction via Variable Latency Pipeline and Instruction Reuse

9 years 8 months ago
Execution Latency Reduction via Variable Latency Pipeline and Instruction Reuse
Operand bypass logic might be one of the critical structures for future microprocessors to achieve high clock speed. The delay of the logic imposes the execution time budget to be reduced signi cantly, resulting in that the execution stage is divided into several stages. Variable latency pipeline (VLP) structure has the advantages of pipelining and pseudo-asynchronous design techniques. According to source operands delivered to arithmetic units, the VLP changes execution latency and thus it achieves both high speed and low latency for most of the operands. In this paper we evaluate the VLP on dynamically scheduled superscalar processors using a cycle-by-cycle simulator. Our experimental results show that the VLP is e ective for reducing the e ective execution time, and thus the constraints on the operand bypass logic is mitigated. We also evaluate instruction reuse technique in order to support the VLP.
Toshinori Sato, Itsujiro Arita
Added 28 Jul 2010
Updated 28 Jul 2010
Type Conference
Year 2001
Where EUROPAR
Authors Toshinori Sato, Itsujiro Arita
Comments (0)
books