Revisiting Virtual L1 Caches A Practical Design Using Dynamic Synonym Remapping

被引:0
|
作者
Yoon, Hongil [1 ]
Sohi, Gurindar S. [1 ]
机构
[1] Univ Wisconsin Madison, Dept Comp Sci, Madison, WI 53706 USA
关键词
ADDRESS CACHES; MEMORY; PERFORMANCE; BUFFER;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Virtual caches have potentially lower access latency and energy consumption than physical caches because they do not consult the TLB prior to cache access. However, they have not been popular in commercial designs. The crux of the problem is the possibility of synonyms. This paper makes several empirical observations about the temporal characteristics of synonyms, especially in caches of sizes that are typical of L1 caches. By leveraging these observations, the paper proposes a practical design of an L1 virtual cache that (1) dynamically decides a unique virtual page number for all the synonymous virtual pages that map to the same physical page and (2) uses this unique page number to place and look up data in the virtual caches. Accesses to this unique page number proceed without any intervention. Accesses to other synonymous pages are dynamically detected, and remapped to the corresponding unique virtual page number to correctly access data in the cache. Such remapping operations are rare, due to the temporal properties of synonyms, allowing a Virtual Cache with Dynamic Synonym Remapping (VC-DSR) to achieve most of the benefits of virtual caches but without software involvement. Experimental results based on real world applications show that VC-DSR can achieve about 92% of the dynamic energy savings for TLB lookups, and 99.4% of the latency benefits of ideal (but impractical) virtual caches for the configurations considered.
引用
收藏
页码:212 / 224
页数:13
相关论文
共 50 条
  • [41] Design of high-order digital differentiators using L1 error criteria
    Natl Taiwan Univ, Taipei, Taiwan
    IEEE Trans Circuits Syst II Analog Digital Signal Process, 4 (287-291):
  • [42] Modeling and Design Optimization for Quadcopter Control System Using L1 Adaptive Control
    Thu, Kyaw Myat
    Igorevich, Gavrilov Alexander
    7TH IEEE ANNUAL INFORMATION TECHNOLOGY, ELECTRONICS & MOBILE COMMUNICATION CONFERENCE IEEE IEMCON-2016, 2016,
  • [43] METHOD OF VIRTUAL DISPLACEMENTS FOR DEGENERATE DISCRETE L1 APPROXIMATION PROBLEM
    FRASER, W
    BENNETT, JM
    MATHEMATICS OF COMPUTATION, 1978, 32 (142) : 421 - 430
  • [44] Mutagenesis in rodents using the L1 retrotransposon
    Ostertag E.M.
    Madison B.B.
    Kano H.
    Genome Biology, 8 (Suppl 1)
  • [45] Mutagenesis in rodents using the L1 retrotransposon
    Ostertag, Eric M.
    Madison, Blair B.
    Kano, Hiroki
    GENOME BIOLOGY, 2007, 8
  • [46] Power-Aware Optimization of Software-Based Self-Test for L1 Caches in Microprocessors
    Theodorou, G.
    Kranitis, N.
    Paschalis, A.
    Gizopoulos, D.
    PROCEEDINGS OF THE 2014 IEEE 20TH INTERNATIONAL ON-LINE TESTING SYMPOSIUM (IOLTS), 2014, : 154 - 159
  • [47] Quantifying the Impact of Monolithic 3D (M3D) Integration on L1 Caches
    Gong, Young-Ho
    Kong, Joonho
    Chung, Sung Woo
    IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING, 2021, 9 (02) : 854 - 865
  • [48] Impact on Performance and Energy of the Retention Time and Processor Frequency in L1 Macrocell-Based Data Caches
    Valero, Alejandro
    Sahuquillo, Julio
    Lorente, Vicente
    Petit, Salvador
    Lopez, Pedro
    Duato, Jose
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2012, 20 (06) : 1108 - 1117
  • [49] Fault buffers Enabling near-true voltage scaling in variation-sensitive L1 caches
    Mahmood, Tayyeb
    Kim, Soontae
    DESIGN AUTOMATION FOR EMBEDDED SYSTEMS, 2013, 17 (02) : 411 - 438
  • [50] Dynamic systems, maturational constraints and L1 phonetic attrition
    de Leeuw, Esther
    Mennen, Ineke
    Scobbie, James M.
    INTERNATIONAL JOURNAL OF BILINGUALISM, 2013, 17 (06) : 683 - 700