blob: c23cab13c3d1403a1a2f599a6b26b461296d2234 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001Deadline IO scheduler tunables
2==============================
3
4This little file attempts to document how the deadline io scheduler works.
5In particular, it will clarify the meaning of the exposed tunables that may be
6of interest to power users.
7
Alan D. Brunelle23c76982007-10-15 13:22:26 +02008Selecting IO schedulers
9-----------------------
10Refer to Documentation/block/switching-sched.txt for information on
11selecting an io scheduler on a per-device basis.
Linus Torvalds1da177e2005-04-16 15:20:36 -070012
13
14********************************************************************************
15
16
17read_expire (in ms)
18-----------
19
Matt LaPlantea2ffd272006-10-03 22:49:15 +020020The goal of the deadline io scheduler is to attempt to guarantee a start
Linus Torvalds1da177e2005-04-16 15:20:36 -070021service time for a request. As we focus mainly on read latencies, this is
22tunable. When a read request first enters the io scheduler, it is assigned
23a deadline that is the current time + the read_expire value in units of
Matt LaPlante2fe0ae72006-10-03 22:50:39 +020024milliseconds.
Linus Torvalds1da177e2005-04-16 15:20:36 -070025
26
27write_expire (in ms)
28-----------
29
30Similar to read_expire mentioned above, but for writes.
31
32
33fifo_batch
34----------
35
36When a read request expires its deadline, we must move some requests from
37the sorted io scheduler list to the block device dispatch queue. fifo_batch
Alan D. Brunelle23c76982007-10-15 13:22:26 +020038controls how many requests we move.
Linus Torvalds1da177e2005-04-16 15:20:36 -070039
40
Alan D. Brunelle23c76982007-10-15 13:22:26 +020041writes_starved (number of dispatches)
42--------------
Linus Torvalds1da177e2005-04-16 15:20:36 -070043
44When we have to move requests from the io scheduler queue to the block
45device dispatch queue, we always give a preference to reads. However, we
46don't want to starve writes indefinitely either. So writes_starved controls
47how many times we give preference to reads over writes. When that has been
48done writes_starved number of times, we dispatch some writes based on the
49same criteria as reads.
50
51
52front_merges (bool)
53------------
54
55Sometimes it happens that a request enters the io scheduler that is contigious
56with a request that is already on the queue. Either it fits in the back of that
57request, or it fits at the front. That is called either a back merge candidate
58or a front merge candidate. Due to the way files are typically laid out,
59back merges are much more common than front merges. For some work loads, you
60may even know that it is a waste of time to spend any time attempting to
61front merge requests. Setting front_merges to 0 disables this functionality.
62Front merges may still occur due to the cached last_merge hint, but since
63that comes at basically 0 cost we leave that on. We simply disable the
64rbtree front sector lookup when the io scheduler merge function is called.
65
66
Rob Landley26bbb292007-10-15 11:42:52 +020067Nov 11 2002, Jens Axboe <jens.axboe@oracle.com>
Linus Torvalds1da177e2005-04-16 15:20:36 -070068
69