lkml.org 
[lkml]   [2004]   [Jul]   [5]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    /
    Date
    From
    SubjectRe: prio_tree generalization
    Werner Almesberger <wa@almesberger.net> wrote:
    >
    > I'm currently experimenting with the prio_tree code in an elevator
    > ("IO scheduler"),

    Offtopic, but that's a premature optmztn. O(n) linear searches work just
    fine for disk elevators under most circumstances - we don't get may
    complaints about CPU consumption in the 2.4 elevator.

    A disk isn't going to retire more than 100 requests/sec in practice, and
    the cost of an all-requests search is relatively small.

    Once the new design is settled in, is proven to be useful and desirable,
    that's the time to start thinking about millioptimisations such as
    converting the search complexity from O(n) to O(log(n)).
    -
    To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
    the body of a message to majordomo@vger.kernel.org
    More majordomo info at http://vger.kernel.org/majordomo-info.html
    Please read the FAQ at http://www.tux.org/lkml/

    \
     
     \ /
      Last update: 2005-03-22 14:04    [W:0.020 / U:90.400 seconds]
    ©2003-2016 Jasper Spaans. hosted at Digital OceanAdvertise on this site