Heavy-tailed distribution of parallel I/O system response time

Bin Dong, S. Byna, Kesheng Wu
{"title":"Heavy-tailed distribution of parallel I/O system response time","authors":"Bin Dong, S. Byna, Kesheng Wu","doi":"10.1145/2834976.2834978","DOIUrl":null,"url":null,"abstract":"Estimating I/O time of applications is critical for computing system research and developments, such as performance tuning and job scheduling. Parallel I/O systems on large-scale HPC systems typically use several I/O servers attached to a number of hard disk drives to read and write data concurrently. As a result, the response time of individual I/O servers affects the overall I/O performance and modeling the response time distribution holds the key to estimate I/O time. Existing studies have generally considered that the response time follows a Uniform or a Normal distribution. However, none of these studies considered supercomputing environments that are actively used by a number of users to verify the existence of Uniform or Normal distributions. In this study, we collected ≈ 2,500,000 measurements on two peta-scale class supercomputers that are actively used by ≈5000 users. These two systems, Hopper and Edison at the National Energy Research Scientific Computing Center (NERSC), typically support hundreds of concurrent jobs. Our performance measurements include the overheads introduced by the entire parallel I/O stack (I/O library, network, parallel file system software, cache and hardware). Our study shows that the response time of parallel I/O system follows a heavy-tailed property, in contrary to the widely accepted Normal or Uniform distributions. In exploring for new models, we identify that a mix of Power Law and Normal distributions is a good fit for the response time of parallel I/O systems that are actively used by hundreds of jobs concurrently.","PeriodicalId":218652,"journal":{"name":"International Parallel Data Systems Workshop","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Parallel Data Systems Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2834976.2834978","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Estimating I/O time of applications is critical for computing system research and developments, such as performance tuning and job scheduling. Parallel I/O systems on large-scale HPC systems typically use several I/O servers attached to a number of hard disk drives to read and write data concurrently. As a result, the response time of individual I/O servers affects the overall I/O performance and modeling the response time distribution holds the key to estimate I/O time. Existing studies have generally considered that the response time follows a Uniform or a Normal distribution. However, none of these studies considered supercomputing environments that are actively used by a number of users to verify the existence of Uniform or Normal distributions. In this study, we collected ≈ 2,500,000 measurements on two peta-scale class supercomputers that are actively used by ≈5000 users. These two systems, Hopper and Edison at the National Energy Research Scientific Computing Center (NERSC), typically support hundreds of concurrent jobs. Our performance measurements include the overheads introduced by the entire parallel I/O stack (I/O library, network, parallel file system software, cache and hardware). Our study shows that the response time of parallel I/O system follows a heavy-tailed property, in contrary to the widely accepted Normal or Uniform distributions. In exploring for new models, we identify that a mix of Power Law and Normal distributions is a good fit for the response time of parallel I/O systems that are actively used by hundreds of jobs concurrently.
并行I/O系统响应时间的重尾分布
估计应用程序的I/O时间对于计算系统的研究和开发至关重要,例如性能调优和作业调度。大型HPC系统上的并行I/O系统通常使用连接到多个硬盘驱动器的多个I/O服务器来并发地读写数据。因此,单个I/O服务器的响应时间会影响整体I/O性能,对响应时间分布进行建模是估计I/O时间的关键。现有的研究一般认为响应时间服从均匀分布或正态分布。然而,这些研究都没有考虑到大量用户积极使用的超级计算环境来验证均匀分布或正态分布的存在。在这项研究中,我们在两台被约5000名用户活跃使用的千万亿级超级计算机上收集了约250万次测量结果。国家能源研究科学计算中心(NERSC)的Hopper和Edison这两个系统通常支持数百个并发工作。我们的性能测量包括整个并行I/O堆栈(I/O库、网络、并行文件系统软件、缓存和硬件)带来的开销。我们的研究表明,并行I/O系统的响应时间遵循一个重尾特性,与广泛接受的正态或均匀分布相反。在探索新模型的过程中,我们发现幂律和正态分布的混合很适合同时被数百个作业积极使用的并行I/O系统的响应时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信
小红书