The value locality of store instructions

被引:0
|
作者
Lepak, KM [1 ]
Lipasti, MH [1 ]
机构
[1] Univ Wisconsin, Dept Elect & Comp Engn, Madison, WI 53706 USA
来源
PROCEEDING OF THE 27TH INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE | 2000年
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Value locality, a recently discovered program attribute that describes the likelihood of the recurrence of previously-seen program values, has been studied enthusiastically in the recent published literature. Much of the energy has focused on refining the initial efforts at predicting load instruction outcomes, with the balance of the effort examining the value locality of either all register-writing instructions, or a focused subset of them. Surprisingly, there has been very little published characterization of or effort to exploit the value locality of data words stored to memory by computer programs. This paper presents such a characterization, proposes both memory-centric (based on message passing) and producer-centric (based on program structure) prediction mechanisms for stored data values, introduces the concept of silent stores and new definitions of multiprocessor false sharing based on these observations, and suggests new techniques for aligning cache coherence protocols and microarchitectural store handling techniques to exploit the value locality of stores. We find that realistic implementations of these techniques can significantly reduce multiprocessor data bus traffic and are more effective at reducing address bus traffic than the addition of Exclusive state to a MSI coherence protocol. We also show that squashing of silent stores can provide uniprocessor speedups greater than the addition of store-to-load forwarding.
引用
收藏
页码:182 / 191
页数:10
相关论文
共 50 条
  • [41] Exploiting basic block value locality with block reuse
    Huang, JA
    Lilja, DJ
    FIFTH INTERNATIONAL SYMPOSIUM ON HIGH-PERFORMANCE COMPUTER ARCHITECTURE, PROCEEDINGS, 1999, : 106 - 114
  • [42] Compiler-directed classification of value locality Behavior
    Zhao, Q
    Lilja, DJ
    2001 INTERNATIONAL CONFERENCE ON COMPUTER DESIGN, ICCD 2001, PROCEEDINGS, 2001, : 240 - 248
  • [43] Characterizing and Exploiting Small-Value Memory Instructions
    Islam, Mafijul Md
    Stenstrom, Per
    IEEE TRANSACTIONS ON COMPUTERS, 2014, 63 (07) : 1640 - 1655
  • [44] Monkey: Optimal Navigable Key-Value Store
    Dayan, Niv
    Athanassoulis, Manos
    Idreos, Stratos
    SIGMOD'17: PROCEEDINGS OF THE 2017 ACM INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2017, : 79 - 94
  • [46] Tapeworm chromosomes: their value in systematics with instructions for cytogenetic study
    Orosova, Martina
    Spakulova, Marta
    FOLIA PARASITOLOGICA, 2018, 65
  • [47] HyperDex: A Distributed, Searchable Key-Value Store
    Escriva, Robert
    Wong, Bernard
    Sirer, Emin Guen
    ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2012, 42 (04) : 25 - 36
  • [48] Key-Value Store Implementations for Arduino Microcontrollers
    Fazackerley, Scott
    Huang, Eric
    Douglas, Graeme
    Kudlac, Raffi
    Lawrence, Ramon
    2015 IEEE 28TH CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING (CCECE), 2015, : 158 - 164
  • [49] The Effect of Convenience Store Dessert on Consumers Value and Satisfaction
    Cha, Seong-Soo
    Lee, Su-Han
    JOURNAL OF ASIAN FINANCE ECONOMICS AND BUSINESS, 2020, 7 (03): : 191 - 199
  • [50] CaSSanDra: An SSD Boosted Key-Value Store
    Menon, Prashanth
    Rabl, Tilmann
    Sadoghi, Mohammad
    Jacobsen, Hans-Arno
    2014 IEEE 30TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2014, : 1162 - 1167