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

From: Kai Henningsen (
Date: Wed Oct 25 2000 - 08:41:00 EST (Linus Torvalds) wrote on 23.10.00 in <>:

> actually inform about the events. The way to do this simply is to limit it
> in very clear ways, the most notable one being simply that there is only
> one event queue per process (or rather, per "struct files_struct" - so
> threads would automatically share the event queue). This keeps the

While the rest looks fine, I suspect this one is a show-stopper.

IMO, the ability to wait for separate event sets in separate threads is a
MUST. In a single-threaded program, it would probably still be useful in a
number of situations.

Not that it's all that difficult to expand your model to do multiple

MfG Kai
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to
Please read the FAQ at

This archive was generated by hypermail 2b29 : Tue Oct 31 2000 - 21:00:15 EST