Re: Queued tasks

faq
flatforty
contribute
subscribe
configure
search
rdf

main
parent
thread

Re: Queued tasks
by giu73 on Wednesday 24/Jan/2007, @10:02

Can you expand on this? I don't really know how CFQ works, but, the "Fair" in its name makes me think that it would not be the best choice for this scenario. Basically, we have two large tasks, with a very high switching cost between the two. To optimize performance, we should minimize the number of switches, that is serving each task for a very long time interval before switching to the other (the best being serving one task until it is completely finished and then going to the other). This does not sound "Fair", to me.

Related Links

·   Articles on KDE Public Relations and Marketing
·   Also by giu73
·   Contact author

The Fine Print: The following comments are owned by whomever posted them.
( Reply )

Re: Queued tasks
by superstoned on Wednesday 24/Jan/2007, @10:21

but it is what CFQ does, both ensuring task interactivity AND increasing throughput. compared to the previous kernel scheduler, cfq uses longer timeslices, but has some logic to ensure reads don't slow down, and there are maximum waits for apps who want to read and write data.

[ Reply To This | View ]

The Fine Print: The previous comments are owned by whomever posted them.
( Reply )


		"The trolls are only human and make mistakes too." -- Charles Samuels
KDE®, "K Desktop Environment", "KDE Dot News", "got the dot?" and the KDE Logo® are trademarks or registered trademarks of KDE e.V. in the European Union, the United States and other countries. All other trademarks and copyrights on this page are owned by their respective owners. Comments are owned by the poster. The rest: Copyright © 2000-2008 KDE e.V. for The KDE Project. For further information or comments on this site, please contact the Webmaster.