lkml.org 
[lkml]   [2000]   [Sep]   [19]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    /
    Date
    From
    SubjectRe: (reiserfs) Re: An elevator algorithm (patch)
    On Tue, Sep 19 2000, Andrea Arcangeli wrote:
    > > I don't see any reason why there can't be multiple p points in the current
    > > elevator.
    >
    > Without the proposed modification after the last barrier in the queue all the
    > requests should be in order.

    I haven't had a chance to really look at Peter's mods yet, but surely
    the current elevator can have many entries with 0 sequence. As an
    example, say the start sequence is 3 and we received request sector
    10...1 in descending order. The sorted order would then be

    7[3] 8[2] 9[1] 10[0] 3[3] 4[2] 5[1] 6[0] 1[3] 2[2]

    (sector[sequence])

    --
    * Jens Axboe <axboe@suse.de>
    * SuSE Labs
    -
    To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
    the body of a message to majordomo@vger.kernel.org
    Please read the FAQ at http://www.tux.org/lkml/

    \
     
     \ /
      Last update: 2005-03-22 12:38    [W:7.496 / U:0.296 seconds]
    ©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site