[lkml]   [2004]   [Mar]   [21]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
    SubjectRe: [RFC][PATCH 1/3] radix priority search tree - objrmap complexity fix
    On Mon, 22 Mar 2004, Andrea Arcangeli wrote:

    > It would be curious to test it after changing the return 1 to return 0
    > in the page_referenced trylock failures?

    In the case of a trylock failure, it should probably return a
    random value. For heavily page faulting multithreaded apps,
    that would mean we'd tend towards random replacement, instead
    of FIFO.

    Then again, the locking problems shouldn't be too bad in most
    cases. If you're swapping the program will be waiting on IO
    and if it's not waiting on IO there's no problem.

    "Debugging is twice as hard as writing the code in the first place.
    Therefore, if you write the code as cleverly as possible, you are,
    by definition, not smart enough to debug it." - Brian W. Kernighan

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

     \ /
      Last update: 2005-03-22 14:01    [W:0.019 / U:6.888 seconds]
    ©2003-2017 Jasper Spaans. hosted at Digital OceanAdvertise on this site