|
Reference [1]Y Sazeides and J. E. Smith, “The Predictability of Data Values,” in Proc. of 30th Annual intemational Symposium on Microarchitecture (MICRO-30), pages 248-258, Dec. 1997. [2]A. Sodani and G. S. Sohi, “Dynamic Instruction Reuse,” in Proc. of 24th Annual International Symposium on Computer Architecture, pages 194-205, July 1997. [3]D. Burger, T. M. Austin, and S. Bennett, “Evaluating Future Microprocessors: The SimpleScalar Tool Set.” Technical Report CS-TR-961308, University of Wisconsin-Madison, July 1996. (URL: http://www.cs.wisc.edu/-mscalar/simplescalar.html) [4]S. P. Harbison. “A Computer Architecture for the Dynamic Optimization of High-Level Linguage Programs.” Ph.D. thesis, Carnegie Mellon University, Sept. 1980. [5]M. H. Lipasti and J. P. Shen, “Exceeding the dataflow limit via value prediction,” in Proceedings of the 29th Annual ACM/IEEE International Symposium and Workshop on Microarchitecture, pp. 226-237, December 1996. [6]M. H. Lipasti, C. B. Wilkerson, and J. P. Shen, “Value locality and data speculation,” in Proceedings of the 7th International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 138-147, October 1996. [7]A. Sodani and G. S. Sohi, “Understanding the Difference Between Value Prediction and Instruction Reuse,” in Proc. of 24th Annual International Symposium on Computer Architecture, pages 194-205, July 1997. [8]S. Mehrotra and L. Harrison, “Examination of a memory access classification scheme for pointer intensive and numeric programs,” in Proceedings of the l0th International Conference on Supercomputing, May 1996. [9]D. Joseph and D. Grunwald, “Prefetching using markov predictors,” in Proceedings of the 24th International Symposium on Computer Architecture, pp. 252-263, June 1997. [10]R. J. Eickerneyer and S. Vassiliadis, “A load instruction unit for pipelined processors,” IBM Journal of Research and Development., vol. 37, pp. 547-564, July 1993. [11]J. Gonzalez and A. Gonzalez, “Speculative execution via address prediction and data prefetching,” in Proceedings of the 11th International Conference on Supercomputing, pp. 196-203, July 1997. [12]A. Mendelson and F. Gabbay, “Speculative execution based on value prediction.” Tech. Rep. (Available from http://www-ee.technion.ac.il/fredg), Technion, 1997. [13]Yichen Liu, “Study on Instruction Reuse in RISC Architecture.” Master thesis, Tatung Institute of Technology , Juan 1999. [14]T.-Y. Ych and Y. N. Patt, “Alternative implementations of two-level adaptive branch prediction,” in Proceedings of the 19th International Symposium on Computer Architecture, pp. 124-134, May 1992. [15]P.-Y Chang, E. Hao, and Y N. Patt, “Target prediction for indirect jumps,” in Proceedings of the 24th International Symposium on Computer Architecture, pp. 274-283, June 1997 [16]C. Young and M. D. Smith, “Improving the accuracy of static branch prediction using branch correlation,” in Proceedings of the 6th International Conference on Architectural Supportfor Programming Languages and Operating Systems, pp. 232-241, October 1994. [17]R. Nair, “Dynamic path-based branch correlation,” in Proceedings of the 28th Annual ACM/IEEE International Syrnposium and Workshop on Microarchitecture, pp. 15-23, December 1995. [18]S. Mahlke and B. Natarajan, “Compiler synthesized dynamic branch prediction,” in Proceedings of the 29th Annual ACM/IEEE International Symposium and Workshop on Microarchitecture, pp. 153-164, Decernber 1996. [19]L-C. K. Cheng, J. T. Coffey, and T. N. Mudge, “Analysis of branch prediction via data compression,” in Proceedings of the 7th International Conference on Architectural Support for Prograrnming Languages and Operating Systems, October 1996. [20]S. P. Harbison, “An architectural alternative to optimizing compilers,” in Proc. International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), page 57 65, Mar. 1982. [21]S. E. Richardson, “Caching function results: Faster arithmetic by avoiding unnecessary computation.” Technical Report SMLI TR-92- 1, Sun Microsystems Laboratories, Sept. 1992. [22]S. F. Oberman and M. J. Flynn,”On Division and Reciprocal Caches.” Technical Report CSL-TR-95-666, Stanford University, Apr. 1995. [23]F. Gabbay and A. Mendelson, “Using Value Prediction to Increase the Power of Speculative Execution Hardware.” ACM Transaction on Computer Systems (TOCS), Aug. 1998. [24]J.L. Hennessy and D.A. Patterson. Computer Architecture a Quantitative Approach. Morgan Kaufman Publishers, Inc., Second edition, 1995
|