FSB: A flexible set-balancing strategy for last-level caches

Mohamed Zahran, Bushra Ahsan, Mohammad Hammoud, Sangyeun Cho, Rami Melhem

Research output: Chapter in Book/Report/Conference proceedingChapter


This paper describes Flexible Set Balancing (FSB), a practical strategy for providing high-performance caching. Our work is motivated by a large asymmetry in the usage of cache sets. FSB extends the lifetime of cache lines via retaining some fraction of the working set at underutilized sets to satisfy far-flung reuses. FSB promotes a very flexible sharing among cache sets, referred to as many-from-many sharing, providing significant reduction in interference misses. Simulation results using a full-system simulator that models a 16-way tiled chip multiprocessor platform demonstrate that FSB achieves an average miss rate reduction of 36.6% on multithreading and multiprogramming benchmarks from SPEC2006, PARSEC, and SPLASH-2 suites. This translates into an average execution-time improvement of 13%. Furthermore, evaluations showed the outperformance of FSB over some recent proposals including DSBC [27] and V-WAY [25].

Original languageEnglish (US)
Title of host publicationMulticore Computing
Subtitle of host publicationAlgorithms, Architectures, and Applications
PublisherCRC Press
Number of pages28
ISBN (Electronic)9781439854358
ISBN (Print)9781439854341
StatePublished - Jan 1 2013

ASJC Scopus subject areas

  • General Computer Science
  • General Mathematics


Dive into the research topics of 'FSB: A flexible set-balancing strategy for last-level caches'. Together they form a unique fingerprint.

Cite this