Re: Linux's implementation of poll() not scalable?

[Tobias Ringstrom]

On 23 Oct 2000, Linus Torvalds wrote:

> Either 
> 
>  (a) Solaris has solved the faster-than-light problem, and Sun engineers
>      should get a Nobel price in physics or something.
> 
>  (b) Solaris "scales" by being optimized for 10000 entries, and not
>      speeding up sufficiently for a small number of entries.
> 
> You make the call. 

You will probably get the 6.5 factor because you have some (big) contant
setup time. For example

        t = 1700 + n

This gives you an increase of 6.5 from 100 to 10000, although it is of
course is O(n). No magic there... :-)

/Tobias


-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [EMAIL PROTECTED]
Please read the FAQ at http://www.tux.org/lkml/