Evolution of the BFQ Storage-I/O Scheduler

P. Valente, Arianna Avanzini
{"title":"Evolution of the BFQ Storage-I/O Scheduler","authors":"P. Valente, Arianna Avanzini","doi":"10.1109/MST.2015.9","DOIUrl":null,"url":null,"abstract":"An accurate storage-I/O scheduler, named Budget Fair Queueing (BFQ), was integrated with a special set of heuristics a few years ago. The resulting, improved scheduler, codenamed BFQ-v1, was able to guarantee a number of desirable service properties, including a high responsiveness, to applications and system services. In the intervening years, BFQ-v1 has become relatively popular on desktop and handheld systems, and has further evolved. But no official, comprehensive and concentrated documentation has been provided about the improvements that have followed each other. In this paper we fill this documentation gap, by describing the current, last version of BFQ (v7r8). We also show the performance of BFQ-v7r8 through some experimental results, in terms of throughput and application responsiveness, and on both an HDD and an SSD.","PeriodicalId":252572,"journal":{"name":"2015 Mobile Systems Technologies Workshop (MST)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Mobile Systems Technologies Workshop (MST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MST.2015.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

An accurate storage-I/O scheduler, named Budget Fair Queueing (BFQ), was integrated with a special set of heuristics a few years ago. The resulting, improved scheduler, codenamed BFQ-v1, was able to guarantee a number of desirable service properties, including a high responsiveness, to applications and system services. In the intervening years, BFQ-v1 has become relatively popular on desktop and handheld systems, and has further evolved. But no official, comprehensive and concentrated documentation has been provided about the improvements that have followed each other. In this paper we fill this documentation gap, by describing the current, last version of BFQ (v7r8). We also show the performance of BFQ-v7r8 through some experimental results, in terms of throughput and application responsiveness, and on both an HDD and an SSD.
BFQ存储i /O调度器的演变
几年前,一个名为预算公平排队(BFQ)的精确存储i /O调度器与一组特殊的启发式方法集成在一起。改进后的调度器,代号为BFQ-v1,能够保证许多理想的服务属性,包括对应用程序和系统服务的高响应性。在此期间,BFQ-v1在桌面和手持系统上变得相对流行,并得到了进一步发展。但是,没有提供官方的、全面的和集中的文件来说明相继出现的改进。在本文中,我们通过描述BFQ的最新版本(v7r8)来填补这一文档空白。我们还通过一些实验结果展示了BFQ-v7r8在吞吐量和应用程序响应方面的性能,以及在HDD和SSD上的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信