Abstract
Value speculation is currently widely used in processor designs to increase the overall number of instructions executed per cycle (IPC). Current methods use sophisticated prediction techniques to speculate on the outcome of branches and execute code accordingly. Speculation can be extended to the approximation of arithmetic values. As arithmetic operations are slow to complete in pipelined execution an increase in overall IPC is possible through accurate arithmetic data value speculation. This paper will focus on integer adder units for the purposes of demonstrating arithmetic data value speculation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gonzalez, J., Gonzalez, A.: Data value speculation in superscalar processors. Microprocessors-and-Microsystems 22(6), 293–301 (1998)
Li, A.: An empirical study of the longest carry length in real programs. Master’s thesis, Department of Computer Science, Princeton University (May 2002)
Koes, D., Chelcea, T., Oneyama, C., Goldstein, S.C.: Adding faster with application specific early termination. School of Computer Science, Carnegie Mellon University, Pittsburgh, USA (January 2005)
Nowick, S.M., Yun, K.Y., Beerel, P.A., Dooply, A.E.: Speculative completion for the design of high performance asynchronous dynamic adders. In: International Symposium on Advance Research in Asynchronous Circuits and Systems, Eindhoven, The Netherlands, pp. 210–223. IEEE Comput. Soc. Press, Los Alamitos (1997)
Lu, S.-L.: Speeding up processing with approximation circuits. Computer 37(3), 67–73 (2004)
Burks, A.W., Goldstein, H.H., von Neumann, J.: Preliminiary discussion of the design of an electronic computing instrument. In: Inst. Advanced Study, Princeton, N.J (June 1946)
Briley, B.E.: Some new results on average worst case carry. IEEE Transactions On Computers C-22(5), 459–463 (1973)
Liu, T., Lu, S.-L.: Performance improvement with circuit level speculation. In: Proceedings of the 33rd Annual International Symposium on Microarchitecture, pp. 348–355. IEEE, Los Alamitos (2000)
Parhami, B.: Computer Arithmetic: Algorithms and Hardware Designs. Oxford University Press, New York (2000)
Pippenger, N.: Analysis of carry propagation in addition: an elementary approach. Journal of Algorithms 42(2), 317–333 (2002)
Wall, D.W.: Limits of instruction-level parallelism. In: International Conference on Architectural Support for Programming Languages and Operating Systems - ASPLOS, vol. 26(4), pp. 176–188 (1991)
Hennessey, J.L., Patterson, D.A.: Computer Architecture: A Quantitative Approach. Morgan Kauffman Publishers, San Francisco (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kelly, D.R., Phillips, B.J. (2005). Arithmetic Data Value Speculation. In: Srikanthan, T., Xue, J., Chang, CH. (eds) Advances in Computer Systems Architecture. ACSAC 2005. Lecture Notes in Computer Science, vol 3740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11572961_28
Download citation
DOI: https://doi.org/10.1007/11572961_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29643-0
Online ISBN: 978-3-540-32108-8
eBook Packages: Computer ScienceComputer Science (R0)