A helper thread based dynamic cache partitioning scheme for multithreaded applications

Mahmut Kandemir, Taylan Yemliha, Emre Kultursay

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Scopus citations

Abstract

Focusing on the problem of how to partition the cache space given to a multithreaded application across its threads, we show that different threads of a multithreaded application can have different cache space requirements, propose a fully automated, dynamic, intra-application cache partitioning scheme targeting emerging multicores with multilayer cache hierarchies, present a comprehensive experimental analysis of the proposed scheme, and show average improvements of 17.1% and 18.6% in SPECOMP and PARSEC suites.

Original languageEnglish (US)
Title of host publication2011 48th ACM/EDAC/IEEE Design Automation Conference, DAC 2011
Pages954-959
Number of pages6
StatePublished - Sep 16 2011
Event2011 48th ACM/EDAC/IEEE Design Automation Conference, DAC 2011 - San Diego, CA, United States
Duration: Jun 5 2011Jun 9 2011

Publication series

NameProceedings - Design Automation Conference
ISSN (Print)0738-100X

Other

Other2011 48th ACM/EDAC/IEEE Design Automation Conference, DAC 2011
CountryUnited States
CitySan Diego, CA
Period6/5/116/9/11

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Control and Systems Engineering
  • Electrical and Electronic Engineering
  • Modeling and Simulation

Cite this

Kandemir, M., Yemliha, T., & Kultursay, E. (2011). A helper thread based dynamic cache partitioning scheme for multithreaded applications. In 2011 48th ACM/EDAC/IEEE Design Automation Conference, DAC 2011 (pp. 954-959). [5981888] (Proceedings - Design Automation Conference).