Messages in this thread | | | Date | Sun, 9 Dec 2001 17:06:04 -0800 (PST) | From | Davide Libenzi <> | Subject | Re: [RFC] Scheduler queue implementation ... |
| |
On Mon, 10 Dec 2001, Alan Cox wrote:
> > So we can have simply two queues ( per CPU ), one that stores I/O bound ( > > counter > K for example ) and RT tasks that is walked entirely searching > > for the better tasks, the other queue will store CPU bound tasks that are > > executed in a FIFO policy. > > Oh as an aside btw - there are many real world workloads where we have a lot > of non cpu hog processes running. A lot of messaging systems have high task > switch rates but very few cpu hogs. So you still need to handle the non hogs > carefully to avoid degenerating back into Linus scheduler.
In my experience, if you've I/O bound tasks that lead to a long run queue, that means that you're suffering major kernel latency problems ( other than the scheduler ).
- Davide
- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |