Open AccessDHL‐cache: dynamic per history length adjustment for low‐power L2 cache
Author(s) -
Joo H.W.,
Chung E.Y.
Publication year - 2016
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2016.1465
Subject(s) - cache , cache algorithms , cache invalidation , cache coloring , cache pollution , smart cache , page cache , computer science , mesi protocol , parallel computing , cache oblivious algorithm , cpu cache
The significant power dissipation of the on‐chip L2 cache is a major concern in modern microprocessors. This Letter proposes a unique low‐power technique for a high‐associative large L2 cache that has fragmented locality by L1 cache. The dynamic per history length adjustment cache (DHL‐cache) dynamically selects the qualified way candidates to be accessed and controls the way‐prediction window size based on the access history pattern. With a high degree of the way‐prediction accuracy, the DHL‐cache shows a 55.3% energy‐delay product improvement over the location‐cache with minimum hardware support. Therefore, the DHL‐cache alleviates the power limit issue for L2 cache, even with high associativity and fragmented locality.