Clock2Q+: A Simple and Efficient Replacement Algorithm for Metadata Cache in VMware vSAN
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908694722117632 |
|---|---|
| author | Zhai, Yiyan Marthen, Bintang Dwi Balivada, Sarath Bojji, Vamsi Sudhakar Knauft, Eric Rohilla, Jitender Zuo, Jiaqi Liu, Quanxing Austruy, Maxime Wang, Wenguang Yang, Juncheng |
| author_facet | Zhai, Yiyan Marthen, Bintang Dwi Balivada, Sarath Bojji, Vamsi Sudhakar Knauft, Eric Rohilla, Jitender Zuo, Jiaqi Liu, Quanxing Austruy, Maxime Wang, Wenguang Yang, Juncheng |
| contents | Cache replacement algorithms are critical building blocks of storage systems. This paper examines the characteristics of metadata caches and argues that they inherently exhibit correlated references, even when the corresponding data accesses do not contain correlated references. The presence of correlated references reduces the effectiveness of cache replacement algorithms because these references are often mistakenly categorized as hot blocks. Clock2Q+ is specifically designed for metadata caches and has been implemented in vSAN and VDFS, two flagship storage products of VMware by Broadcom. Similar to S3-FIFO, Clock2Q+ uses three queues; however, Clock2Q+ introduces a correlation window in the Small FIFO queue, where blocks in this window do not set the reference bit. This simple enhancement allows Clock2Q+ to outperform state-of-the-art replacement algorithms. Compared to S3-FIFO, the second-best performing algorithm, Clock2Q+ achieves up to a 28.5% lower miss ratio on metadata traces. Clock2Q+ possesses the essential properties required for large-scale storage systems: it has low CPU overhead on cache hits, low memory overhead, scales efficiently to multiple CPUs, and is both easy to tune and implement. Additionally, Clock2Q+ outperforms state-of-the-art cache replacement algorithms on data traces as well. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_21958 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Clock2Q+: A Simple and Efficient Replacement Algorithm for Metadata Cache in VMware vSAN Zhai, Yiyan Marthen, Bintang Dwi Balivada, Sarath Bojji, Vamsi Sudhakar Knauft, Eric Rohilla, Jitender Zuo, Jiaqi Liu, Quanxing Austruy, Maxime Wang, Wenguang Yang, Juncheng Distributed, Parallel, and Cluster Computing Cache replacement algorithms are critical building blocks of storage systems. This paper examines the characteristics of metadata caches and argues that they inherently exhibit correlated references, even when the corresponding data accesses do not contain correlated references. The presence of correlated references reduces the effectiveness of cache replacement algorithms because these references are often mistakenly categorized as hot blocks. Clock2Q+ is specifically designed for metadata caches and has been implemented in vSAN and VDFS, two flagship storage products of VMware by Broadcom. Similar to S3-FIFO, Clock2Q+ uses three queues; however, Clock2Q+ introduces a correlation window in the Small FIFO queue, where blocks in this window do not set the reference bit. This simple enhancement allows Clock2Q+ to outperform state-of-the-art replacement algorithms. Compared to S3-FIFO, the second-best performing algorithm, Clock2Q+ achieves up to a 28.5% lower miss ratio on metadata traces. Clock2Q+ possesses the essential properties required for large-scale storage systems: it has low CPU overhead on cache hits, low memory overhead, scales efficiently to multiple CPUs, and is both easy to tune and implement. Additionally, Clock2Q+ outperforms state-of-the-art cache replacement algorithms on data traces as well. |
| title | Clock2Q+: A Simple and Efficient Replacement Algorithm for Metadata Cache in VMware vSAN |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2511.21958 |