现代存储系统的自适应智能分层

IF 1 4区 计算机科学 Q4 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Performance Evaluation Pub Date : 2023-05-01 DOI:10.1016/j.peva.2023.102332
Lu Pang , Anis Alazzawe , Madhurima Ray , Krishna Kant , Jeremy Swift
{"title":"现代存储系统的自适应智能分层","authors":"Lu Pang ,&nbsp;Anis Alazzawe ,&nbsp;Madhurima Ray ,&nbsp;Krishna Kant ,&nbsp;Jeremy Swift","doi":"10.1016/j.peva.2023.102332","DOIUrl":null,"url":null,"abstract":"<div><p><span>Enterprise systems routinely use tiered storage consisting of a hierarchy of storage devices that vary in speed and size. One key to obtaining good performance in such a hierarchy is to migrate data elements intelligently to the appropriate tier. For example, moving the most used data towards the fastest tier and the least used data towards the slowest tier. Tiering is typically done based on usage </span>statistics<span><span> over relatively long time periods. In this paper, we consider a much more agile tiering mechanism called Adaptive Intelligent Tiering (AIT). It can dynamically adapt to the changing behavior of storage accesses by the running applications. The AIT mechanism uses a deep learning model to generate a set of candidate movements and employs a </span>reinforcement learning mechanism to further refine the candidates. Based on extensive simulations in a 3-tier system, we show that the proposed scheme, compared with several other methods, enhances workload performance up to 85% on storage traces with a wide range of characteristics.</span></p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"160 ","pages":"Article 102332"},"PeriodicalIF":1.0000,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Adaptive Intelligent Tiering for modern storage systems\",\"authors\":\"Lu Pang ,&nbsp;Anis Alazzawe ,&nbsp;Madhurima Ray ,&nbsp;Krishna Kant ,&nbsp;Jeremy Swift\",\"doi\":\"10.1016/j.peva.2023.102332\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p><span>Enterprise systems routinely use tiered storage consisting of a hierarchy of storage devices that vary in speed and size. One key to obtaining good performance in such a hierarchy is to migrate data elements intelligently to the appropriate tier. For example, moving the most used data towards the fastest tier and the least used data towards the slowest tier. Tiering is typically done based on usage </span>statistics<span><span> over relatively long time periods. In this paper, we consider a much more agile tiering mechanism called Adaptive Intelligent Tiering (AIT). It can dynamically adapt to the changing behavior of storage accesses by the running applications. The AIT mechanism uses a deep learning model to generate a set of candidate movements and employs a </span>reinforcement learning mechanism to further refine the candidates. Based on extensive simulations in a 3-tier system, we show that the proposed scheme, compared with several other methods, enhances workload performance up to 85% on storage traces with a wide range of characteristics.</span></p></div>\",\"PeriodicalId\":19964,\"journal\":{\"name\":\"Performance Evaluation\",\"volume\":\"160 \",\"pages\":\"Article 102332\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-05-01\",\"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/S0166531623000020\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Performance Evaluation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166531623000020","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

企业系统通常使用分层存储,分层存储由不同速度和大小的存储设备组成。在这种层次结构中获得良好性能的一个关键是将数据元素智能地迁移到适当的层。例如,将使用最多的数据移动到最快的层,将使用最少的数据移动到最慢的层。分级通常基于相对较长时间内的使用统计数据。在本文中,我们考虑了一种更敏捷的分层机制,称为自适应智能分层(AIT)。它可以动态地适应运行中的应用程序对存储访问行为的变化。AIT机制使用深度学习模型生成一组候选运动,并使用强化学习机制进一步细化候选。基于在三层系统中的大量模拟,我们表明,与其他几种方法相比,所提出的方案在具有广泛特征的存储走线上将工作负载性能提高了85%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Adaptive Intelligent Tiering for modern storage systems

Enterprise systems routinely use tiered storage consisting of a hierarchy of storage devices that vary in speed and size. One key to obtaining good performance in such a hierarchy is to migrate data elements intelligently to the appropriate tier. For example, moving the most used data towards the fastest tier and the least used data towards the slowest tier. Tiering is typically done based on usage statistics over relatively long time periods. In this paper, we consider a much more agile tiering mechanism called Adaptive Intelligent Tiering (AIT). It can dynamically adapt to the changing behavior of storage accesses by the running applications. The AIT mechanism uses a deep learning model to generate a set of candidate movements and employs a reinforcement learning mechanism to further refine the candidates. Based on extensive simulations in a 3-tier system, we show that the proposed scheme, compared with several other methods, enhances workload performance up to 85% on storage traces with a wide range of characteristics.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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
期刊最新文献
Analysis of a queue-length-dependent vacation queue with bulk service, N-policy, set-up time and cost optimization FedCust: Offloading hyperparameter customization for federated learning Trust your local scaler: A continuous, decentralized approach to autoscaling Enabling scalable and adaptive machine learning training via serverless computing on public cloud Symbolic state-space exploration meets statistical model checking
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1