Dynamic directory table with victim cache: on-demand allocation of directory entries for active shared cache blocks

Han Jun Bae, Lynn Choi

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


In this paper, we present a novel directory architecture that can dynamically allocate a directory entry for a cache block on demand at runtime only when the block is shared by more than a single core. Thus, we do not maintain coherence for private blocks, substantially reducing the number of directory entries. Even for shared blocks, we allocate directory entry dynamically only when the block is actively shared, further reducing the number of directory entries at runtime. For this, we propose a new directory architecture called dynamic directory table (DDT), which is a decoupled directory storage from the shared cache and dynamically maintains directory entries only for actively shared blocks. Also, we add a small additional victim cache to its original DDT in order to reduce invalidation broadcasts caused by DDT eviction. Through our detailed simulation on PARSEC benchmarks, we show that DDT can outperform the expensive full-map directory by a slight margin with only 16.09% of directory area across a variety of different workloads. This is achieved by its faster access and high hit rates in the small directory. In addition, we demonstrate that even smaller DDTs can give comparable or higher performance compared to recent directory optimization schemes such as SPACE and DGD with considerably less area.

Original languageEnglish
Pages (from-to)425-446
Number of pages22
JournalJournal of Supercomputing
Issue number1
Publication statusPublished - 2019 Jan 9

Bibliographical note

Funding Information:
Acknowledgements The author(s) disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) and funded by the Ministry of Science, ICT and Future Planning (NRF-2017R1A2B2009 641). This research was also supported by the MSIP (Ministry of Science, ICT and Future Planning), Korea, under the ITRC (Information Technology Research Center) support program (IITP-2018-2015-0-00363) supervised by the IITP (Institute for Information and Communications Technology Promotion). This research was supported by Korea University.

Publisher Copyright:
© 2019, Springer Science+Business Media, LLC, part of Springer Nature.


  • Cache coherence
  • Directory
  • Multi-core architectures
  • Parallel processing
  • Scalable computing
  • Simulation

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Information Systems
  • Hardware and Architecture


Dive into the research topics of 'Dynamic directory table with victim cache: on-demand allocation of directory entries for active shared cache blocks'. Together they form a unique fingerprint.

Cite this