存储阵列的性能和能量建模

Sankaran Sivathanu, Ling Liu, C. Ungureanu
{"title":"存储阵列的性能和能量建模","authors":"Sankaran Sivathanu, Ling Liu, C. Ungureanu","doi":"10.1109/GREENCOMP.2010.5598308","DOIUrl":null,"url":null,"abstract":"We propose a novel framework for evaluating techniques for power optimization in storage. Given an arbitrary trace of disk requests, we split it into short time intervals, extract a set of simple statistics for each interval, and apply an analytical model to those statistics to obtain accurate information regarding the performance and energy characteristics of the system for that workload. The key abstraction used in our analytical model is the run-length - a single sequential run of requests at the disk level. Using this abstraction, the model is able to account for arbitrary interactions of random and sequential I/Os in the context of a RAID array, and obtain accurate results with less effort than a detailed individual request-level simulation. Various layout and migration policies aimed at power conservation can be easily expressed as transformations on this set of statistics for each time interval. We demonstrate the efficacy of our framework by using it to evaluate PARAID, a recently proposed technique for power optimization in storage arrays. We show that the performance and power predicted by the model under the migration and layout policies of PARAID accurately match the results of a detailed simulation of the system. The analytic model allows us to identify key parameters that affect PARAID performance, and propose an enhancement to the layout of data in PARAID which we show to perform superior to the original technique. We use both the analytic model and detailed simulations to illustrate the benefit of our new layout. This also demonstrates the significant simplicity of evaluating a new technique by applying a high-level model to the extracted trace statistics, compared to the current alternative of either implementing the new technique or simulating it at the level of individual requests","PeriodicalId":262148,"journal":{"name":"International Conference on Green Computing","volume":"255 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Modeling the performance and energy of storage arrays\",\"authors\":\"Sankaran Sivathanu, Ling Liu, C. Ungureanu\",\"doi\":\"10.1109/GREENCOMP.2010.5598308\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a novel framework for evaluating techniques for power optimization in storage. Given an arbitrary trace of disk requests, we split it into short time intervals, extract a set of simple statistics for each interval, and apply an analytical model to those statistics to obtain accurate information regarding the performance and energy characteristics of the system for that workload. The key abstraction used in our analytical model is the run-length - a single sequential run of requests at the disk level. Using this abstraction, the model is able to account for arbitrary interactions of random and sequential I/Os in the context of a RAID array, and obtain accurate results with less effort than a detailed individual request-level simulation. Various layout and migration policies aimed at power conservation can be easily expressed as transformations on this set of statistics for each time interval. We demonstrate the efficacy of our framework by using it to evaluate PARAID, a recently proposed technique for power optimization in storage arrays. We show that the performance and power predicted by the model under the migration and layout policies of PARAID accurately match the results of a detailed simulation of the system. The analytic model allows us to identify key parameters that affect PARAID performance, and propose an enhancement to the layout of data in PARAID which we show to perform superior to the original technique. We use both the analytic model and detailed simulations to illustrate the benefit of our new layout. This also demonstrates the significant simplicity of evaluating a new technique by applying a high-level model to the extracted trace statistics, compared to the current alternative of either implementing the new technique or simulating it at the level of individual requests\",\"PeriodicalId\":262148,\"journal\":{\"name\":\"International Conference on Green Computing\",\"volume\":\"255 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-08-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Green Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GREENCOMP.2010.5598308\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Green Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GREENCOMP.2010.5598308","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

我们提出了一个新的框架来评估存储中的功率优化技术。给定磁盘请求的任意跟踪,我们将其分成短时间间隔,为每个间隔提取一组简单的统计数据,并对这些统计数据应用分析模型,以获得有关该工作负载的系统性能和能量特征的准确信息。在我们的分析模型中使用的关键抽象是运行长度——在磁盘级别上单个顺序运行的请求。使用这种抽象,该模型能够解释RAID阵列上下文中随机和顺序I/ o的任意交互,并且比详细的单个请求级模拟更省力地获得准确的结果。以节能为目标的各种布局和迁移策略可以很容易地表示为每个时间间隔对这组统计数据的转换。我们通过使用该框架来评估PARAID(最近提出的用于存储阵列功率优化的技术)来证明该框架的有效性。结果表明,在PARAID的迁移和布局策略下,该模型预测的性能和功耗与系统的详细仿真结果准确匹配。分析模型使我们能够识别影响PARAID性能的关键参数,并提出对PARAID中数据布局的改进,我们表明该改进的性能优于原始技术。我们使用分析模型和详细的仿真来说明我们的新布局的好处。这也证明了通过将高级模型应用于提取的跟踪统计信息来评估新技术的简单性,与当前实现新技术或在单个请求级别模拟新技术的替代方法相比
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Modeling the performance and energy of storage arrays
We propose a novel framework for evaluating techniques for power optimization in storage. Given an arbitrary trace of disk requests, we split it into short time intervals, extract a set of simple statistics for each interval, and apply an analytical model to those statistics to obtain accurate information regarding the performance and energy characteristics of the system for that workload. The key abstraction used in our analytical model is the run-length - a single sequential run of requests at the disk level. Using this abstraction, the model is able to account for arbitrary interactions of random and sequential I/Os in the context of a RAID array, and obtain accurate results with less effort than a detailed individual request-level simulation. Various layout and migration policies aimed at power conservation can be easily expressed as transformations on this set of statistics for each time interval. We demonstrate the efficacy of our framework by using it to evaluate PARAID, a recently proposed technique for power optimization in storage arrays. We show that the performance and power predicted by the model under the migration and layout policies of PARAID accurately match the results of a detailed simulation of the system. The analytic model allows us to identify key parameters that affect PARAID performance, and propose an enhancement to the layout of data in PARAID which we show to perform superior to the original technique. We use both the analytic model and detailed simulations to illustrate the benefit of our new layout. This also demonstrates the significant simplicity of evaluating a new technique by applying a high-level model to the extracted trace statistics, compared to the current alternative of either implementing the new technique or simulating it at the level of individual requests
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信