Hey, Vivek. On Fri, May 30, 2014 at 01:55:27PM -0400, Vivek Goyal wrote: > Now CFQ also dynamically adjusts the slice length based on the how > many queues are ready to do IO. One problem with fixed slice lenth > round robin was that if there are lot of queues doing IO, then after > serving one queue, same queue will get time slice after a long time. > > Corrado Zoccolo did work in this area in an attempt to improve latency. > Now slice length is calculated dynamically in an attempt to achieve > better latency.
Consdier it a better version of that. > Ok, so you prefer to have another IO scheduler instead of improving > CFQ? As I wrote in another reply, I think the best approach would be morphing cfq to accomodate the scheduling algorithm and heristics of bfq. > Tejun, I have spent significant amount of time on BFQ few years ago. And > that's the reason I have not read it again yet. My understanding was > that there was nothing which would not be done in CFQ (atleast things > which mattered). THERE IS A NEW PAPER. > Looks like you prefer introducing a new scheduler instead of improving > CFQ. My preference is to improve CFQ. Borrow good ideas from BFQ and > implement them in CFQ. LOOKS LIKE YOU ARE NOT READING ANYTHING AND JUST WRITING IRRELEVANT SHIT. > So why not improve CFQ instead of carrying and maintaining another > scheduler. And then have a discussion that what's the default scheduler. For fuck's sake, I'm out. This is total waste of time. You don't read what others are writing and refuse to study what's right there. What are you doing? -- tejun -- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majord...@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/