Foreactor: Exploiting Storage I/O Parallelism with Explicit Speculation

Guanzhou Hu, Andrea Arpaci-Dusseau, Remzi Arpaci-Dusseau
{"title":"Foreactor: Exploiting Storage I/O Parallelism with Explicit Speculation","authors":"Guanzhou Hu, Andrea Arpaci-Dusseau, Remzi Arpaci-Dusseau","doi":"arxiv-2409.01580","DOIUrl":null,"url":null,"abstract":"We introduce explicit speculation, a variant of I/O speculation technique\nwhere I/O system calls can be parallelized under the guidance of explicit\napplication code knowledge. We propose a formal abstraction -- the foreaction\ngraph -- which describes the exact pattern of I/O system calls in an\napplication function as well as any necessary computation associated to produce\ntheir argument values. I/O system calls can be issued ahead of time if the\ngraph says it is safe and beneficial to do so. With explicit speculation,\nserial applications can exploit storage I/O parallelism without involving\nexpensive prediction or checkpointing mechanisms. Based on explicit speculation, we implement Foreactor, a library framework\nthat allows application developers to concretize foreaction graphs and enable\nconcurrent I/O with little or no modification to application source code.\nExperimental results show that Foreactor is able to improve the performance of\nboth synthetic benchmarks and real applications by significant amounts\n(29%-50%).","PeriodicalId":501333,"journal":{"name":"arXiv - CS - Operating Systems","volume":"60 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Operating Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.01580","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We introduce explicit speculation, a variant of I/O speculation technique where I/O system calls can be parallelized under the guidance of explicit application code knowledge. We propose a formal abstraction -- the foreaction graph -- which describes the exact pattern of I/O system calls in an application function as well as any necessary computation associated to produce their argument values. I/O system calls can be issued ahead of time if the graph says it is safe and beneficial to do so. With explicit speculation, serial applications can exploit storage I/O parallelism without involving expensive prediction or checkpointing mechanisms. Based on explicit speculation, we implement Foreactor, a library framework that allows application developers to concretize foreaction graphs and enable concurrent I/O with little or no modification to application source code. Experimental results show that Foreactor is able to improve the performance of both synthetic benchmarks and real applications by significant amounts (29%-50%).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Foreactor:通过明确推测利用存储 I/O 并行性
我们介绍了显式推测,这是 I/O 推测技术的一种变体,在显式应用代码知识的指导下,I/O 系统调用可以并行化。我们提出了一种形式抽象--前行动图,它描述了应用函数中 I/O 系统调用的确切模式,以及产生其参数值所需的相关计算。如果该图表明这样做是安全和有益的,那么就可以提前发出 I/O 系统调用。有了显式推测,串行应用程序就可以利用存储 I/O 并行性,而无需涉及昂贵的预测或检查点机制。实验结果表明,Foreactor 能够显著提高合成基准和实际应用的性能(29%-50%)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Analysis of Synchronization Mechanisms in Operating Systems Skip TLB flushes for reused pages within mmap's eBPF-mm: Userspace-guided memory management in Linux with eBPF BULKHEAD: Secure, Scalable, and Efficient Kernel Compartmentalization with PKS Rethinking Programmed I/O for Fast Devices, Cheap Cores, and Coherent Interconnects
×
引用
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