Accelerating multi-tier storage cache simulations using knee detection

IF 1 4区 计算机科学 Q4 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Tyler Estro , Mário Antunes , Pranav Bhandari , Anshul Gandhi , Geoff Kuenning , Yifei Liu , Carl Waldspurger , Avani Wildani , Erez Zadok
{"title":"Accelerating multi-tier storage cache simulations using knee detection","authors":"Tyler Estro ,&nbsp;Mário Antunes ,&nbsp;Pranav Bhandari ,&nbsp;Anshul Gandhi ,&nbsp;Geoff Kuenning ,&nbsp;Yifei Liu ,&nbsp;Carl Waldspurger ,&nbsp;Avani Wildani ,&nbsp;Erez Zadok","doi":"10.1016/j.peva.2024.102410","DOIUrl":null,"url":null,"abstract":"<div><p>Storage cache hierarchies include diverse topologies, assorted parameters and policies, and devices with varied performance characteristics. Simulation enables efficient exploration of their configuration space while avoiding expensive physical experiments. Miss Ratio Curves (MRCs) efficiently characterize the performance of a cache over a range of cache sizes, revealing “key points” for cache simulation, such as knees in the curve that immediately follow sharp cliffs. Unfortunately, there are no automated techniques for efficiently finding key points in MRCs, and the cross-application of existing knee-detection algorithms yields inaccurate results.</p><p>We present a multi-stage framework that identifies key points in <em>any</em> MRC, for both stack-based (<em>e.g.</em>, LRU) and more sophisticated eviction algorithms (<em>e.g.</em>, ARC). Our approach quickly locates candidates using efficient hash-based sampling, curve simplification, knee detection, and novel post-processing filters. We introduce <em>Z-Method</em>, a new multi-knee detection algorithm that employs statistical outlier detection to choose promising points robustly and efficiently.</p><p>We evaluated our framework against seven other knee-detection algorithms, identifying key points in multi-tier MRCs with both ARC and LRU policies for 106 diverse real-world workloads. Compared to naïve approaches, our framework reduced the total number of points needed to accurately identify the best two-tier cache hierarchies by an average factor of approximately <span><math><mrow><mn>5</mn><mo>.</mo><mn>5</mn><mo>×</mo></mrow></math></span> for ARC and <span><math><mrow><mn>7</mn><mo>.</mo><mn>7</mn><mo>×</mo></mrow></math></span> for LRU.</p><p>We also show how our framework can be used to seed the initial population for evolutionary algorithms. We ran 32,616 experiments requiring over three million cache simulations, on 151 samples, from three datasets, using a diverse set of population initialization techniques, evolutionary algorithms, knee-detection algorithms, cache replacement algorithms, and stopping criteria. Our results showed an overall acceleration rate of 34% across all configurations.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2024-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Performance Evaluation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166531624000154","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Storage cache hierarchies include diverse topologies, assorted parameters and policies, and devices with varied performance characteristics. Simulation enables efficient exploration of their configuration space while avoiding expensive physical experiments. Miss Ratio Curves (MRCs) efficiently characterize the performance of a cache over a range of cache sizes, revealing “key points” for cache simulation, such as knees in the curve that immediately follow sharp cliffs. Unfortunately, there are no automated techniques for efficiently finding key points in MRCs, and the cross-application of existing knee-detection algorithms yields inaccurate results.

We present a multi-stage framework that identifies key points in any MRC, for both stack-based (e.g., LRU) and more sophisticated eviction algorithms (e.g., ARC). Our approach quickly locates candidates using efficient hash-based sampling, curve simplification, knee detection, and novel post-processing filters. We introduce Z-Method, a new multi-knee detection algorithm that employs statistical outlier detection to choose promising points robustly and efficiently.

We evaluated our framework against seven other knee-detection algorithms, identifying key points in multi-tier MRCs with both ARC and LRU policies for 106 diverse real-world workloads. Compared to naïve approaches, our framework reduced the total number of points needed to accurately identify the best two-tier cache hierarchies by an average factor of approximately 5.5× for ARC and 7.7× for LRU.

We also show how our framework can be used to seed the initial population for evolutionary algorithms. We ran 32,616 experiments requiring over three million cache simulations, on 151 samples, from three datasets, using a diverse set of population initialization techniques, evolutionary algorithms, knee-detection algorithms, cache replacement algorithms, and stopping criteria. Our results showed an overall acceleration rate of 34% across all configurations.

利用膝点检测加速多层存储缓存模拟
存储缓存层次结构包括不同的拓扑结构、各种参数和策略以及具有不同性能特征的设备。仿真可以有效探索其配置空间,同时避免昂贵的物理实验。未命中率曲线(MRC)能有效地描述不同大小缓存的性能,揭示缓存仿真的 "关键点",如紧随急崖之后的曲线膝点。我们提出了一个多阶段框架,可识别任何 MRC 中的关键点,既适用于基于堆栈的算法(如 LRU),也适用于更复杂的驱逐算法(如 ARC)。我们的方法利用高效的哈希采样、曲线简化、膝点检测和新型后处理滤波器快速定位候选点。我们针对其他七种膝点检测算法对我们的框架进行了评估,针对 106 种不同的实际工作负载,在采用 ARC 和 LRU 策略的多层 MRC 中识别关键点。与天真方法相比,我们的框架减少了准确识别最佳双层缓存层次结构所需的点总数,ARC 和 LRU 的平均系数分别约为 5.5 倍和 7.7 倍。我们在三个数据集的 151 个样本上进行了 32616 次实验,需要 300 多万次缓存模拟,使用了一系列不同的种群初始化技术、进化算法、膝检测算法、缓存替换算法和停止标准。我们的结果表明,在所有配置中,总体加速率为 34%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Performance Evaluation
Performance Evaluation 工程技术-计算机:理论方法
CiteScore
3.10
自引率
0.00%
发文量
20
审稿时长
24 days
期刊介绍: Performance Evaluation functions as a leading journal in the area of modeling, measurement, and evaluation of performance aspects of computing and communication systems. As such, it aims to present a balanced and complete view of the entire Performance Evaluation profession. Hence, the journal is interested in papers that focus on one or more of the following dimensions: -Define new performance evaluation tools, including measurement and monitoring tools as well as modeling and analytic techniques -Provide new insights into the performance of computing and communication systems -Introduce new application areas where performance evaluation tools can play an important role and creative new uses for performance evaluation tools. More specifically, common application areas of interest include the performance of: -Resource allocation and control methods and algorithms (e.g. routing and flow control in networks, bandwidth allocation, processor scheduling, memory management) -System architecture, design and implementation -Cognitive radio -VANETs -Social networks and media -Energy efficient ICT -Energy harvesting -Data centers -Data centric networks -System reliability -System tuning and capacity planning -Wireless and sensor networks -Autonomic and self-organizing systems -Embedded systems -Network science
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信