Skip to main content

A Majority-Based Control Scheme for Way-Adaptable Caches

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6310))

Abstract

Considering the trade-off between performance and power consumption has become significantly important in microprocessor design. For this purpose, one promising approach is to employ way-adaptable caches, which adjust the number of cache ways available to a running application based on assessment of its working set size. However, in a very short period, the estimated working set size by cache access locality assessment may become different from that of the overall trend in a long period. Such a locality assessment result will cause excessive adaptation to allocate too many cache ways to a thread and, as a result, deteriorate the energy efficiency of way-adaptable caches. To avoid the excessive adaptation, this paper proposes a majority-based control scheme, in which the number of activated ways is adjusted based on majority voting of locality assessment results of several short sampling periods. By using majority voting, the proposed scheme can make way-adaptable caches less sensitive to the results of the periods including exceptional behaviors. The experimental results indicate that the proposed scheme can reduce the number of activated ways by up to 37% and on average by 9.4%, while maintaining performance compared with a conventional scheme, resulting in reduction of power consumption.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ravindran, R., Chu, M., Mahlke, S.: Compiler-Managed Partitioned Data Caches for Low Power. In: Proc. the 2007 ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems, pp. 237–247 (2007)

    Google Scholar 

  2. Suh, G., Rudolph, L., Devadas, S.: Dynamic Partitioning of Shared Cache Memory. Journal of Supercomputing 28(1), 7–26 (2004)

    Article  MATH  Google Scholar 

  3. Qureshi, M.K., Patt, Y.N.: Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches. In: Proceedings of 39th Annual IEEE/ACM International Symposium on Microarchitecture, pp. 423–432 (2006)

    Google Scholar 

  4. Settle, A., Connors, D., Gibert, E., Gonzáles, A.: A Dynamically Reconfigurable Cache for Multithreaded Processors. Journal of Embedded Computing 2(2), 221–233 (2006)

    Google Scholar 

  5. Kihm, J., Settle, A., Janiszewski, A., Connors, D.: Understanding the Impact of Inter-Thread Cache Interference on ILP in Modern SMT Processors. The Journal of Instruction-Level Parallelism 7 (2005)

    Google Scholar 

  6. Albonesi, D.H.: Selective Cache Ways: On-Demand Cache Resource Allocation. In: Proceedings of 32nd Annual International Symposium on Microarchitecture, pp. 248–259 (1999)

    Google Scholar 

  7. Kobayashi, H., Kotera, I., Takizawa, H.: Locality Analysis to Control Dynamically Way-Adaptable Caches. ACM SIGARCH Computer Architecture News 33(3), 25–32 (2005)

    Article  Google Scholar 

  8. Kotera, I., Abe, K., Egawa, R., Takizawa, H., Kobayashi, H.: Power-Aware Dynamic Cache Partitioning for CMPs. Transaction on High-Performance Embedded Architectures and Compilers 3(2), 149–167 (2008)

    Google Scholar 

  9. Chandra, D., Guo, F., Kim, S., Solihin, Y.: Predicting Inter-Thread Cache Contention on a Chip Multi-Processor Architecture. In: Proceedings of the 11th International Symposium on High-Performance Computer Architecture, pp. 340–351 (2005)

    Google Scholar 

  10. Binkert, N.L., Dreslinski, R.G., Hsu, L.R., Lim, K.T., Saidi, A.G., Reinhardt, S.K.: The M5 Simulator: Modeling Networked Systems. IEEE Micro 26(4), 52–60 (2006)

    Article  Google Scholar 

  11. AMD: Family 10h AMD Phenom II Processor Product Data Sheet. Technical Documents of Advanced Micro Devices (June 2009)

    Google Scholar 

  12. Yang, S.H., Powell, M.D., Falsafi, B., Vijaykumar, T.N.: Exploiting choice in resizable cache design to optimize deep-submicron processor energy-delay. In: Proceedings of The Eighth International Symposium on High-Performance Computer Architecture (2002)

    Google Scholar 

  13. Henning, J.L.: SPEC CPU2006 Benchmark Descriptions. ACM SIGARCH Computer Architecture News 34(4), 1–17 (2006)

    Article  Google Scholar 

  14. Sato, M., Kotera, I., Egawa, R., Takizawa, H., Kobayashi, H.: A Cache-Aware Thread Scheduling Policy for Multi-Core Processors. In: Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, pp. 109–114 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Sato, M., Egawa, R., Takizawa, H., Kobayashi, H. (2010). A Majority-Based Control Scheme for Way-Adaptable Caches. In: Keller, R., Kramer, D., Weiss, JP. (eds) Facing the Multicore-Challenge. Lecture Notes in Computer Science, vol 6310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16233-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16233-6_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16232-9

  • Online ISBN: 978-3-642-16233-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics