“‘We are working [on] a new I/O scheduler based on CFQ, aiming
at improved predictability and fairness of the service, while
maintaining the high throughput it already provides,’ began Fabio
Checconi, announcing the BFQ I/O scheduler. ‘The Budget Fair
Queueing (BFQ) scheduler turns the CFQ Round-Robin scheduling
policy of time slices into a fair queuing scheduling of sector
budgets,’ he continued, ‘more precisely, each task is assigned a
budget measured in number of sectors instead of amount of time, and
budgets are scheduled using a slightly modified version of WF2Q+.
The budget assigned to each task varies over time as a function of
its behaviour. However, one can set the maximum value of the budget
that BFQ can assign to any task…'”
Web Webster has more than 20 years of writing and editorial experience in the tech sector. He’s written and edited news, demand generation, user-focused, and thought leadership content for business software solutions, consumer tech, and Linux Today, he edits and writes for a portfolio of tech industry news and analysis websites including webopedia.com, and DatabaseJournal.com.
LinuxToday is a trusted, contributor-driven news resource supporting all types of Linux users. Our thriving international community engages with us through social media and frequent content contributions aimed at solving problems ranging from personal computing to enterprise-level IT operations. LinuxToday serves as a home for a community that struggles to find comparable information elsewhere on the web.
Property of TechnologyAdvice. © 2025 TechnologyAdvice. All Rights Reserved
Advertiser Disclosure: Some of the products that appear on this site are from companies from which TechnologyAdvice receives compensation. This compensation may impact how and where products appear on this site including, for example, the order in which they appear. TechnologyAdvice does not include all companies or all types of products available in the marketplace.