> This code looks pretty bad, all right. It looks like it is O(N^2)
> in PS_SELECT_WAIT(), especially if descriptors get randomly strewn
> amoungst the threads. It also looks like it is regenerating the FDS
masks
> on each call completely from scratch. It also looks
On Thu, Jan 28, 1999 at 04:10:26PM -0800, Matthew Dillon wrote:
> :In libc_r, I don't think the code in uthread_kern.c's
> :_thread_kern_select() scales at all.
> :
> :As the number of network connections (TCP) to my application grows, I
> :believe this routine takes longer and longer and my CPU go
:In libc_r, I don't think the code in uthread_kern.c's
:_thread_kern_select() scales at all.
:
:As the number of network connections (TCP) to my application grows, I
:believe this routine takes longer and longer and my CPU goes to 100%
:user space.
:
:Something makes me believe that this routine ha
In libc_r, I don't think the code in uthread_kern.c's
_thread_kern_select() scales at all.
As the number of network connections (TCP) to my application grows, I
believe this routine takes longer and longer and my CPU goes to 100%
user space.
Something makes me believe that this routine has an n^
