Characterization of silent stores
暂无分享,去创建一个
[1] F. Gabbay. Speculative Execution based on Value Prediction Research Proposal towards the Degree of Doctor of Sciences , 1996 .
[2] S. E. Richardson. Exploiting trivial and redundant computation , 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.
[3] Samuel P. Harbison. An architectural alternative to optimizing compilers , 1982, ASPLOS I.
[4] Mikko H. Lipasti,et al. On the value locality of store instructions , 2000, Proceedings of 27th International Symposium on Computer Architecture (IEEE Cat. No.RS00201).
[5] 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.
[6] BurgerDoug,et al. The SimpleScalar tool set, version 2.0 , 1997 .
[7] Antonio González,et al. Reducing Memory Traffic Via Redundant Store Instructions , 1999, HPCN Europe.
[8] G.S. Sohi,et al. Dynamic instruction reuse , 1997, ISCA '97.
[9] H LipastiMikko,et al. Value locality and load value prediction , 1996 .
[10] David A. Patterson,et al. Computer Architecture: A Quantitative Approach , 1969 .
[11] Sarita V. Adve,et al. Shared Memory Consistency Models: A Tutorial , 1996, Computer.
[12] Andrew W. Appel,et al. Modern Compiler Implementation in ML , 1997 .
[13] Brad Calder,et al. Value profiling , 1997, Proceedings of 30th Annual International Symposium on Microarchitecture.
[14] Todd M. Austin,et al. The SimpleScalar tool set, version 2.0 , 1997, CARN.