[lkml]   [2008]   [Apr]   [17]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
    SubjectRe: [RESEND][RFC] BFQ I/O Scheduler
    Jens Axboe wrote:
    > On Tue, Apr 01 2008, Fabio Checconi wrote:
    >> [sorry for reposting, wrong subject]
    >> Hi,
    >> we are working to a new I/O scheduler based on CFQ, aiming at
    >> improved predictability and fairness of the service, while maintaining
    >> the high throughput it already provides.

    Here are some microbenchmark results. Test setup is a 2-way IA64 with a
    single 15k RPM 73GiB SCSI disk with TCQ depth set to 1. Workloads are
    generated with FIO: 128 processes issuing synchronous, O_DIRECT, 16KiB
    block size requests.

    Figures are quoted as average (stdev). CFQ (i=0) means idle window
    disabled. All other tunables are default.


    Random Readers
    Latency (ms) Bandwidth (KiB/s)
    CFQ 841.788 (4070.3) 2428.032 (23.1)
    CFQ (i=0) 536.728 (216.9) 3841.024 (8.5)
    BFQ 884.4 (8816.0) 2439.04 (1375.0)

    Sequential 1MiB Readers
    Latency (ms) Bandwidth (KiB/s)
    CFQ 2865.331 (737.2) 46866.048 (103.1)
    CFQ (i=0) 2544.618 (1047.2) 52685.952 (294.2)
    BFQ 2860.795 (419.1) 46850.944 (81.5)

    Clearly BFQ suffers from the same idle window problems as CFQ, but otherwise
    the performance seems comparable in bandwidth terms. I'm guessing variability
    in random workload service is due to max budget being too large compared to
    CFQ's default time-slice. Sequential access looks nice and consistent, though.

     \ /
      Last update: 2008-04-18 03:29    [W:0.020 / U:42.552 seconds]
    ©2003-2017 Jasper Spaans. hosted at Digital OceanAdvertise on this site