Right, for every pending set of events. But as load goes up, so does the
size of each pending set of events.
Poll gives you more and more information as load goes up. Events do not.
> >
> > Now, poll itself is O(n), but doing the I/O is going to be
> O(n) (here n
> > represents the number of fds or clients). So we make a call that is O(n)
> > with a frequency that is O(1/n). Hence the overall overhead of
> poll is O(1)
> > with respect to the number of active connections. Signals can't
> touch that
> > scalability.
>
> My computer science lecturer would have put a red pen through
> that and marked
> it 0
It would help me more if you would explain why it is wrong rather than just
stating that it is wrong.
DS
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu
Please read the FAQ at http://www.tux.org/lkml/