APP: Minimizing Interference Using Aggressive Pipelined Prefetching in Multi-level Buffer Caches

C. Patrick, Nicholas Voshell, M. Kandemir
{"title":"APP: Minimizing Interference Using Aggressive Pipelined Prefetching in Multi-level Buffer Caches","authors":"C. Patrick, Nicholas Voshell, M. Kandemir","doi":"10.1109/CCGrid.2011.47","DOIUrl":null,"url":null,"abstract":"As services become more complex with multiple interactions, and storage servers are shared by multiple services, the different I/O streams arising from these multiple services compete for disk attention. Aggressive Pipelined Prefetching (APP) enabled storage clients are designed to manage the buffer cache and I/O streams to minimize the disk I/O-interference arising from competing streams. Due to the large number of streams serviced by a storage server, most of the disk time is spent seeking, leading to degradation in response times. The goal of APP is to decrease application execution time by increasing the throughput of individual I/O streams and utilizing idle capacity on remote nodes along with idle network times thus effectively avoiding alternating bursts of activity followed by periods of inactivity. APP significantly increases overall I/O throughput and decreases overall messaging overhead between servers. In APP, the intelligence is embedded in the clients and they automatically infer parameters in order to achieve the maximum throughput. APP clients make use of aggressive prefetching and data offloading to remote buffer caches in multi-level buffer cache hierarchies in an effort to minimize disk interference and tranquilize the effects of aggressive prefetching. We used an extremely I/O-intensive Radix-k application employed in studies on the scalability of parallel image composition and particle tracing developed at the Argonne National Laboratory with data sets of up to 128GB and implemented our scheme on a 16-node Linux cluster. We observed that the execution time of the application decreased by 68\\% on average when using our scheme.","PeriodicalId":376385,"journal":{"name":"2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCGrid.2011.47","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

As services become more complex with multiple interactions, and storage servers are shared by multiple services, the different I/O streams arising from these multiple services compete for disk attention. Aggressive Pipelined Prefetching (APP) enabled storage clients are designed to manage the buffer cache and I/O streams to minimize the disk I/O-interference arising from competing streams. Due to the large number of streams serviced by a storage server, most of the disk time is spent seeking, leading to degradation in response times. The goal of APP is to decrease application execution time by increasing the throughput of individual I/O streams and utilizing idle capacity on remote nodes along with idle network times thus effectively avoiding alternating bursts of activity followed by periods of inactivity. APP significantly increases overall I/O throughput and decreases overall messaging overhead between servers. In APP, the intelligence is embedded in the clients and they automatically infer parameters in order to achieve the maximum throughput. APP clients make use of aggressive prefetching and data offloading to remote buffer caches in multi-level buffer cache hierarchies in an effort to minimize disk interference and tranquilize the effects of aggressive prefetching. We used an extremely I/O-intensive Radix-k application employed in studies on the scalability of parallel image composition and particle tracing developed at the Argonne National Laboratory with data sets of up to 128GB and implemented our scheme on a 16-node Linux cluster. We observed that the execution time of the application decreased by 68\% on average when using our scheme.
APP:在多级缓冲缓存中使用积极的流水线预取来最小化干扰
由于服务变得越来越复杂,存在多种交互,并且存储服务器由多个服务共享,因此这些多个服务产生的不同I/O流会争夺磁盘注意力。启用了APP (Aggressive pipeline prefetch)功能的存储客户端被设计用来管理缓冲缓存和I/O流,以最大限度地减少由竞争流引起的磁盘I/O干扰。由于存储服务器服务的流数量很大,大部分磁盘时间都花在查找上,从而导致响应时间的降低。APP的目标是通过增加单个I/O流的吞吐量和利用远程节点上的空闲容量以及空闲网络时间来减少应用程序的执行时间,从而有效地避免交替的活动爆发,然后是不活动的时期。APP显著提高了总体I/O吞吐量,降低了服务器之间的总体消息传递开销。在APP中,智能被嵌入到客户端中,客户端自动推断参数,以达到最大的吞吐量。APP客户端利用主动预取和数据卸载到多级缓冲缓存层次结构中的远程缓冲缓存,以尽量减少磁盘干扰并平息主动预取的影响。我们使用了一个极其I/ o密集型的Radix-k应用程序,用于研究并行图像合成和粒子跟踪的可扩展性,该应用程序由Argonne国家实验室开发,数据集高达128GB,并在16节点的Linux集群上实现了我们的方案。我们观察到,当使用我们的方案时,应用程序的执行时间平均减少了68%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信