【24h】

Distribution Fitting and Performance Modeling for Storage Traces

机译:存储跟踪的分布拟合和性能建模

获取原文

摘要

Understanding I/O workloads and modeling their performance is important for optimizing storage systems. A useful first step towards understanding the characteristics of storage workloads is to analyze their inter-arrival times and service requirements. If these characteristics are found to follow certain probability distributions, then corresponding stochastic models can be employed to efficiently estimate the performance of storage workloads. Such approaches have been explored in other domains using an assortment of distributions, including the Normal, Weibull, and Exponential. However, our analysis and others' past attempts revealed that none of those distributions provided a good fit for storage workloads. We analyzed over 200 traces across 4 different workload families using 20 widely used distributions, including ones seldom used for storage modeling. We found that the Hyper-exponential distribution with just two phases H_2 was superior in modeling the storage traces compared to other distributions under five diverse metrics of accuracy, including metrics that assess the risk of over-fitting. Based on these results, we developed a Markov-chain-based stochastic model that accurately estimates the storage system performance across several workload traces. To highlight the applicability of our model, we conducted what-if analyses to investigate the performance impact of workload variability and garbage collection under various scenarios.
机译:了解I / O工作负载并对其性能进行建模对于优化存储系统非常重要。理解存储工作负载特征的一个有用的第一步是分析它们的到达时间和服务需求。如果发现这些特征遵循某些概率分布,则可以采用相应的随机模型来有效地估计存储工作负载的性能。已经在其他领域中使用包括正态分布,威布尔分布和指数分布在内的各种分布对此类方法进行了探索。但是,我们的分析和其他人过去的尝试表明,这些分发都不适合存储工作负载。我们使用20种广泛使用的分布(包括很少用于存储建模的分布)分析了4个不同工作负载系列的200多个跟踪。我们发现,在五个不同的准确性指标(包括评估过度拟合风险的指标)下,仅具有两个阶段H_2的超指数分布在建模存储迹线方面优于其他分布。基于这些结果,我们开发了基于马尔可夫链的随机模型,该模型可以准确地估计跨多个工作负载轨迹的存储系统性能。为了突出模型的适用性,我们进行了假设分析,以调查各种情况下工作负载可变性和垃圾收集对性能的影响。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号