[lkml]   [2011]   [Oct]   [4]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
    SubjectRe: [RFC][PATCH 0/5] Signal scalability series

    On Mon, Oct 03, 2011 at 03:56:26PM +0200, Thomas Gleixner wrote:
    > > Signal delivery is O(#threads)? Delivery of fatal signal is of course
    > > but where do we walk all threads during non-fatal signal deliveries?
    > > What am I missing?
    > Delivery of any process wide signal can result in an O(thread) walk to
    > find a valid target. That's true for user space originated and kernel
    > space originated (e.g. posix timers) signals.

    Ooh, right. Wakeup currently does linear scan of threads, but this is
    mostly a separate issue. As Peter suggested, tracking wakeup target
    probably is one sane way to solve this.

    Do you think siglock would still be a problem even after O(N) problem
    is solved? Maybe that would lessen contention enough such that the
    locking scope wouldn't matter anymore? Unless breaking up of the
    locks results in nice separate hot domains, being finer-grained
    doesn't mean much after all.

    Thank you.


     \ /
      Last update: 2011-10-04 09:41    [W:0.055 / U:12.644 seconds]
    ©2003-2016 Jasper Spaans. hosted at Digital OceanAdvertise on this site