On Sun, Oct 4, 2009 at 6:20 PM, Fabio Checconi <fchecconi@xxxxxxxxx> wrote: > But if the ``always ready to perform I/O'' assumption held then even RR > would have provided service differentiation, always seeing backlogged > queues and serving them according to their weights. Right, this property is too strong. But also a weaker "the two queues have think times less than the disk access time" will be enough to achieve the same goal by means of proper placement in the RR tree. If both think times are greater than access time, then each queue will get a service level equivalent to it being the only queue in the system, so in this case service differentiation will not apply (do we need to differentiate when everyone gets exactly what he needs?). If one think time is less, and the other is more than the access time, then we should decide what kind of fairness we want to have, especially if the one with larger think time has also higher priority. > In this case the problem is what Vivek described some time ago as the > interlocked service of sync queues, where the scheduler is trying to > differentiate between the queues, but they are not always asking for > service (as they are synchronous and they are backlogged only for short > time intervals). Corrado -- dm-devel mailing list dm-devel@xxxxxxxxxx https://www.redhat.com/mailman/listinfo/dm-devel
