Arithmetic data value speculation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3740 LNCS, Issue , 2005, Pages 353-366

  Kelly, Daniel R ^a   Phillips, Braden J ^a  

^a UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ADDERS; APPROXIMATION THEORY; CODES (STANDARDS); DIGITAL ARITHMETIC; MATHEMATICAL TECHNIQUES;

INSTRUCTIONS EXECUTED PER CYCLE (IPC); IPC; PREDICTION TECHNIQUES; VALUE SPECULATION;

PROGRAM PROCESSORS;

EID: 33646512383     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11572961_28     Document Type: Conference Paper

References (12)

1. Jose Gonzalez and Antonio Gonzalez. Data value speculation in superscalar processors. Microprocessors-and-Microsystems, 22(6):293-301, November 1998.
2. A. Li. An empirical study of the longest carry length in real programs. Master's thesis, Department of Computer Science, Princeton University, May 2002.
3. D. Koes, T. Chelcea, C. Oneyama, and S. C. Goldstein. Adding faster with application specific early termination. School of Computer Science, Carnegie Mellon University, Pittsburgh, USA, January 2005.
4. S.M. Nowick, K. Y. Yun, P. A. Beerel, and A. E. Dooply. Speculative completion for the design of high performance asynchronous dynamic adders. In International Symposium on Advance Research in Asynchronous Circuits and Systems, pages 210-223, Eindhoven, The Netherlands, 1997. IEEE Comput. Soc. Press.
5. S-L. Lu. Speeding up processing with approximation circuits. Computer, 37(3):67-73, March 2004.
6. A. W. Burks, H. H. Goldstein, and J. von Neumann. Preliminiary discussion of the design of an electronic computing instrument. Inst. Advanced Study, Princeton, N.J., June 1946.
7. B. E. Briley. Some new results on average worst case carry. IEEE Transactions On Computers, C-22(5):459-463, 1973.
8. T. Liu and S-L. Lu. Performance improvement with circuit level speculation. In Proceedings of the 33rd Annual International Symposium on Microarchitecture, pages 348-355. IEEE, 2000.
9. B. Parhami. Computer Arithmetic: Algorithms and Hardware Designs. Oxford University Press, New York, 2000.
10. N. Pippenger. Analysis of carry propagation in addition: an elementary approach. Journal of Algorithms, 42(2):317-333, 2002.
11. David W. Wall. Limits of instruction-level parallelism. International Conference on Architectural Support for Programming Languages and Operating Systems - ASPLOS, 26(4): 176-188, 1991.
12. Hennessey J.L. and Patterson D.A. Computer Architecture: A Quantitative Approach. Morgan Kauffman Publishers, San Francisco, USA, 2003.