Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2695664.2695783acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Dynamic associativity management using utility based way-sharing

Published: 13 April 2015 Publication History

Abstract

The non-uniform distribution of memory accesses of todays applications affect the performance of cache memories. Due to such non-uniform accesses some sets of large sized caches are used heavily while some other sets are used lightly. This paper presents a technique WS-DAM, to dynamically increase the associativity of the heavily used sets without increasing the cache size. The heavily used sets can use the idle ways of the lightly used sets to distribute the load. A limited number of ways from every lightly used set are reserved for the heavily used sets. To search a block in a heavily used set, both: the set and the entire reserve area is searched. To reduce the cost of searching the entire reserve storage an additional tag-array is used. During execution the sets are re-categorized at intervals. The proposed technique needs much lesser storage, area and power overhead as compared to the other similar techniques. It improves both miss rate and CPI by 14.46% and 6.63% respectively as compared to an existing technique called V-Way. WS-DAM is also compared with another existing proposal called CMP-VR and it improves the performance by 9% and 4.20% in terms of miss-rate and CPI respectively.

References

[1]
R. Balasubramonian, N. P. Jouppi, and N. Muralimanohar. Multi-Core Cache Hierarchies. Morgan and Claypool Publishers, 2011.
[2]
B. M. Beckmann and D. A. Wood. Managing wire delay in large chip-multiprocessor caches. In Proceedings of the 37th Annual IEEE/ACM International Symposium on Microarchitecture, MICRO 37, pages 319--330. IEEE Computer Society, 2004.
[3]
C. Bienia. Benchmarking Modern Multiprocessors. PhD thesis, Princeton University, January 2011.
[4]
J. Chang and G. S. Sohi. Cooperative caching for chip multiprocessors. In Proceedings of the 33rd Annual International Symposium on Computer Architecture, ISCA '06, pages 264--276, 2006.
[5]
S. Das and H. K. Kapoor. Dynamic associativity management using fellow sets. In Proceedings of the 2013 International Symposium on Electronic System Design, ISED '13, pages 133--137, 2013.
[6]
S. Das and H. K. Kapoor. Victim retention for reducing cache misses in tiled chip multiprocessors. Microprocessors and Microsystems, 38(4):263--275, 2014.
[7]
S. Das and H. K. Kapoor. Exploration of migration and replacement policies for dynamic NUCA over tiled CMPs. In 28th International Conference on VLSI Design (VLSID), Jan 2015. (in press).
[8]
C. Kim, D. Burger, and S. W. Keckler. An adaptive, non-uniform cache structure for wire-delay dominated on-chip caches. SIGOPS Oper. Syst. Rev., 36:211--222, October 2002.
[9]
J. Lira, C. Molina, and A. González. HK-NUCA: Boosting data searches in dynamic non-uniform cache architectures for chip multiprocessors. In Proceedings of the 2011 IEEE International Parallel & Distributed Processing Symposium, IPDPS '11, pages 419--430, 2011.
[10]
P. S. Magnusson, M. Christensson, J. Eskilson, D. Forsgren, G. Hållberg, J. Högberg, F. Larsson, A. Moestedt, and B. Werner. Simics: A full system simulation platform. Computer, 35(2):50--58, Feb. 2002.
[11]
M. M. K. Martin, D. J. Sorin, B. M. Beckmann, M. R. Marty, M. Xu, A. R. Alameldeen, K. E. Moore, M. D. Hill, and D. A. Wood. Multifacet's general execution-driven multiprocessor simulator (gems) toolset. SIGARCH Comput. Archit. News, 33(4):92--99, Nov. 2005.
[12]
N. Muralimanohar, R. Balasubramonian, and N. Jouppi. Optimizing nuca organizations and wiring alternatives for large caches with cacti 6.0. In Proceedings of the 40th Annual IEEE/ACM International Symposium on Microarchitecture, MICRO 40, pages 3--14, 2007.
[13]
M. K. Qureshi, A. Jaleel, Y. N. Patt, S. C. Steely, and J. Emer. Adaptive insertion policies for high performance caching. SIGARCH Comput. Archit. News, 35(2):381--391, June 2007.
[14]
M. K. Qureshi and Y. N. Patt. Utility-based cache partitioning: A low-overhead, high-performance, runtime mechanism to partition shared caches. In Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture, MICRO 39, pages 423--432, 2006.
[15]
M. K. Qureshi, D. Thompson, and Y. N. Patt. The V-Way cache: Demand based associativity via global replacement. SIGARCH Comput. Archit. News, 33(2):544--555, May 2005.
[16]
D. Rolan, B. Fraguela, and R. Doallo. Adaptive line placement with the set balancing cache. In Proceedings of the 2009 42nd Annual IEEE/ACM International Symposium on Microarchitecture, MICRO '42, pages 529--540, Dec 2009.
[17]
D. Sanchez and C. Kozyrakis. The Zcache: Decoupling ways and associativity. In Proceedings of the 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture, MICRO '43, pages 187--198, 2010.
[18]
M. Zhang and K. Asanovic. Victim replication: Maximizing capacity while hiding wire delay in tiled chip multiprocessors. Computer Architecture, international symposium on, 0:336--345, 2005.

Cited By

View all
  • (2022)ACCURATE: Accuracy Maximization for Real-Time Multicore Systems With Energy-Efficient Way-Sharing CachesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2022.316140741:12(5246-5260)Online publication date: Dec-2022
  • (2018)Reducing the second-level cache conflict misses using a set folding techniqueThe Journal of Supercomputing10.1007/s11227-017-2174-874:2(970-993)Online publication date: 1-Feb-2018
  • (2015)Power aware cache miss reduction by energy efficient victim retention2015 19th International Symposium on VLSI Design and Test10.1109/ISVDAT.2015.7208078(1-6)Online publication date: Jun-2015

Index Terms

  1. Dynamic associativity management using utility based way-sharing

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SAC '15: Proceedings of the 30th Annual ACM Symposium on Applied Computing
    April 2015
    2418 pages
    ISBN:9781450331968
    DOI:10.1145/2695664
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 13 April 2015

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. CMP
    2. NUCA
    3. associativity management
    4. victim retention

    Qualifiers

    • Research-article

    Conference

    SAC 2015
    Sponsor:
    SAC 2015: Symposium on Applied Computing
    April 13 - 17, 2015
    Salamanca, Spain

    Acceptance Rates

    SAC '15 Paper Acceptance Rate 291 of 1,211 submissions, 24%;
    Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

    Upcoming Conference

    SAC '25
    The 40th ACM/SIGAPP Symposium on Applied Computing
    March 31 - April 4, 2025
    Catania , Italy

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)3
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 25 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2022)ACCURATE: Accuracy Maximization for Real-Time Multicore Systems With Energy-Efficient Way-Sharing CachesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2022.316140741:12(5246-5260)Online publication date: Dec-2022
    • (2018)Reducing the second-level cache conflict misses using a set folding techniqueThe Journal of Supercomputing10.1007/s11227-017-2174-874:2(970-993)Online publication date: 1-Feb-2018
    • (2015)Power aware cache miss reduction by energy efficient victim retention2015 19th International Symposium on VLSI Design and Test10.1109/ISVDAT.2015.7208078(1-6)Online publication date: Jun-2015

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media