The predictability of data values
暂无分享,去创建一个
[1] Andreas Moshovos,et al. Dynamic Speculation and Synchronization of Data Dependences , 1997, ISCA.
[2] Samuel P. Harbison. An architectural alternative to optimizing compilers , 1982, ASPLOS I.
[3] Stamatis Vassiliadis,et al. A load-instruction unit for pipelined processors , 1993, IBM J. Res. Dev..
[4] Mikko H. Lipasti,et al. Exceeding the dataflow limit via value prediction , 1996, Proceedings of the 29th Annual IEEE/ACM International Symposium on Microarchitecture. MICRO 29.
[5] G.S. Sohi,et al. Dynamic instruction reuse , 1997, ISCA '97.
[6] James E. Smith,et al. A study of branch prediction strategies , 1981, ISCA '98.
[7] Jean-Loup Baer,et al. Effective Hardware Based Data Prefetching for High-Performance Processors , 1995, IEEE Trans. Computers.
[8] Trevor N. Mudge,et al. Analysis of branch prediction via data compression , 1996, ASPLOS VII.
[9] Mikko H. Lipasti,et al. Value locality and load value prediction , 1996, ASPLOS VII.
[10] F. Gabbay. Speculative Execution based on Value Prediction Research Proposal towards the Degree of Doctor of Sciences , 1996 .
[11] Scott A. Mahlke,et al. Compiler synthesized dynamic branch prediction , 1996, Proceedings of the 29th Annual IEEE/ACM International Symposium on Microarchitecture. MICRO 29.
[12] Douglas J. Joseph,et al. Prefetching Using Markov Predictors , 1997, Conference Proceedings. The 24th Annual International Symposium on Computer Architecture.
[13] S. McFarling. Combining Branch Predictors , 1993 .
[14] Ian H. Witten,et al. Text Compression , 1990, 125 Problems in Text Algorithms.
[15] José González,et al. Speculative execution via address prediction and data prefetching , 1997, ICS '97.
[16] Yale N. Patt,et al. Target prediction for indirect jumps , 1997, ISCA '97.
[17] Ravi Nair,et al. Dynamic path-based branch correlation , 1995, MICRO 28.
[18] Todd M. Austin,et al. Zero-cycle loads: microarchitecture support for reducing load latency , 1995, Proceedings of the 28th Annual International Symposium on Microarchitecture.
[19] Vicki H. Allan,et al. Petri net versus module scheduling for software pipelining , 1995, MICRO 1995.
[20] Edward S. Davidson,et al. Information content of CPU memory referencing behavior , 1977, ISCA '77.
[21] Doug Burger,et al. Evaluating Future Microprocessors: the SimpleScalar Tool Set , 1996 .
[22] Michael D. Smith,et al. Improving the accuracy of static branch prediction using branch correlation , 1994, ASPLOS VI.
[23] S. Richardson. Caching Function Results: Faster Arithmetic by Avoiding Unnecessary Computation , 1992 .
[24] Anne Rogers,et al. The performance impact of incomplete bypassing in processor pipelines , 1995, MICRO 1995.
[25] Luddy Harrison. Examination of a memory access classification scheme for pointer-intensive and numeric programs , 1996, ICS '96.
[26] Y.N. Patt,et al. Using Hybrid Branch Predictors to Improve Branch Prediction Accuracy in the Presence of Context Switches , 1996, 23rd Annual International Symposium on Computer Architecture (ISCA'96).
[27] James E. Smith,et al. The performance potential of data dependence speculation and collapsing , 1996, Proceedings of the 29th Annual IEEE/ACM International Symposium on Microarchitecture. MICRO 29.