A fine‐grained thread‐aware management policy for shared caches‡. (29th August 2013)

• Record Type: Journal Article
• Authors: Rolán, Dyer; Andrade, Diego; Fraguela, Basilio B.; Doallo, Ramón; Qiu, Judy; Foster, Ian; Goble, Carole; Doallo, Ramón; Plata, Óscar
• Is Part Of: Concurrency and computation. Volume 26:Number 6(2014:Apr.)
• Page Start: 1355
• Page End: 1374
• Publication Date: 2013-08-29
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3123
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main" id="cpe3123-abs-0001"> <title>SUMMARY</title> <p id="cpe3123-para-0002">Two of the main sources of inefficiency in current caches are the non‐uniform distribution of the memory accesses across the cache sets, which causes misses due to the mapping restrictions of non fully associative caches and the access patterns with little locality that degrade the performance of caches under the traditional least recently used. replacement policy. This paper proposes a technique to tackle in a coordinated way both kinds of problems in the context of chip multiprocessors, whose last level caches can be shared by threads with different patterns of locality. Our proposal, called thread‐aware mapping and replacement miss reduction (TAMR2) policy, tracks the behavior of each thread in each set in order to decide the appropriate combination of policies to deal with these problems. Despite its small overhead, TAMR2 achieved in our experiments average power consumption and memory latency reductions of 10% and 12%, respectively, resulting in an average throughput improvement of 5.6%, relative to a traditional cache design using four cores. TAMR2 also outperformed many recent related approaches in the field. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p> </abstract>