lkml.org 
[lkml]   [1999]   [Nov]   [11]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    /
    Date
    From
    SubjectRe: Max tcp connections
    David Schwartz wrote:
    > Poll is O(1) as well if implemented correctly. Consider the following loop:
    >
    > while(1)
    > {
    > Poll();
    > Do_the_io_poll_found();
    > }
    >
    > 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.

    How would it change the comparison if we had a vector version of
    sigwaitinfo that could return n siginfo's at once?

    - Dan

    --
    (The above is just my personal opinion; I don't speak for my employer,
    except on the occasional talk show.)

    -
    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/

    \
     
     \ /
      Last update: 2005-03-22 13:54    [W:0.023 / U:88.260 seconds]
    ©2003-2016 Jasper Spaans. hosted at Digital OceanAdvertise on this site