Abstract
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 significantly, 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 effective for reducing the effective 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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Austin T. M.: DIVA: a reliable substrate for deep submicron microarchitecture design. 32nd International Symposium on Microarchitecture (1999)
Brooks D., Martonosi M.: Dynamically exploiting narrow width operands to improve processor power and performance. 5th International Symposium on High Performance Computer Architecture (1999)
Burger D., Austin T. M.: The SimpleScalar tool set, version 2.0. ACM SIGARCH Computer Architecture News, 25(3) (1997)
Hara T., Ando H., Nakanishi C., Nakata M.: Performance comparison of ILP machines with cycle time evaluation. 23rd International Symposium on Computer Architecture (1996)
Kessler R. E., McLellan E. J., Webb D. A.: The Alpha 21264 microprocessor architecture. International Conference on Computer Design (1998)
Kondo Y., Ikumi N., Ueno K., Mori J., Hirano M.: An early-completion-detecting ALU for a 1GHz 64b datapath. International Solid State Circuit Conference (1997)
Oberman S. F., Flynn M. J.: A variable latency pipelined floating-point adder. International Euro-Par Conference (1996)
Richardson S.E.: Exploiting trivial and redundant computation. 11th International Symposium on Computer Arithmetic (1993)
Rotenberg E.: AR-SMT: a microarchitectural approach to fault tolerance in microprocessors. 29th Fault-Tolerant Computing Symposium (1999)
Sodani A., Sohi G. S.: Dynamic instruction reuse. 24th International Symposium on Computer Architecture (1997)
Yeager K.C.: The MIPS R10000 superscalar microprocessor. IEEE Micro, April (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sato, T., Arita, I. (2001). Execution Latency Reduction via Variable Latency Pipeline and Instruction Reuse. In: Sakellariou, R., Gurd, J., Freeman, L., Keane, J. (eds) Euro-Par 2001 Parallel Processing. Euro-Par 2001. Lecture Notes in Computer Science, vol 2150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44681-8_62
Download citation
DOI: https://doi.org/10.1007/3-540-44681-8_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42495-6
Online ISBN: 978-3-540-44681-1
eBook Packages: Springer Book Archive