[Subject Prev][Subject Next][Thread Prev][Thread Next][Subject Index][Thread Index]
Re: Linux Kernel scheduling
On Thu, Mar 29, 2001 at 03:51:00PM +0530, Ambar Roy wrote:
> > Linux kernel still uses the same algorithm. Kernel gods don't agree that
> > this is a problem.
> so then what is the new improved perf and smoother multitasking capablity of
> the new 2.4 series kernels?
If they think it's not broken, then it's not going to get fixed. The
argument is that, the linux scheduling algo is good, if there are few
*runnable* threads. In your case, most threads are blocked i.e. sleeping
and hence not runnable.
The Linux algo is O(n), where n is the number of runnable threads.
> > However, having many open connections != many threads
> with java and the normal blocking io, each open connection eats up a new
Not necessarily. You could use thread pooling to get fewer threads to serve
that many connections. All the appservers in the market do this.