deadline-iosched.txt 2.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869
  1. Deadline IO scheduler tunables
  2. ==============================
  3. This little file attempts to document how the deadline io scheduler works.
  4. In particular, it will clarify the meaning of the exposed tunables that may be
  5. of interest to power users.
  6. Selecting IO schedulers
  7. -----------------------
  8. Refer to Documentation/block/switching-sched.txt for information on
  9. selecting an io scheduler on a per-device basis.
  10. ********************************************************************************
  11. read_expire (in ms)
  12. -----------
  13. The goal of the deadline io scheduler is to attempt to guarantee a start
  14. service time for a request. As we focus mainly on read latencies, this is
  15. tunable. When a read request first enters the io scheduler, it is assigned
  16. a deadline that is the current time + the read_expire value in units of
  17. milliseconds.
  18. write_expire (in ms)
  19. -----------
  20. Similar to read_expire mentioned above, but for writes.
  21. fifo_batch
  22. ----------
  23. When a read request expires its deadline, we must move some requests from
  24. the sorted io scheduler list to the block device dispatch queue. fifo_batch
  25. controls how many requests we move.
  26. writes_starved (number of dispatches)
  27. --------------
  28. When we have to move requests from the io scheduler queue to the block
  29. device dispatch queue, we always give a preference to reads. However, we
  30. don't want to starve writes indefinitely either. So writes_starved controls
  31. how many times we give preference to reads over writes. When that has been
  32. done writes_starved number of times, we dispatch some writes based on the
  33. same criteria as reads.
  34. front_merges (bool)
  35. ------------
  36. Sometimes it happens that a request enters the io scheduler that is contigious
  37. with a request that is already on the queue. Either it fits in the back of that
  38. request, or it fits at the front. That is called either a back merge candidate
  39. or a front merge candidate. Due to the way files are typically laid out,
  40. back merges are much more common than front merges. For some work loads, you
  41. may even know that it is a waste of time to spend any time attempting to
  42. front merge requests. Setting front_merges to 0 disables this functionality.
  43. Front merges may still occur due to the cached last_merge hint, but since
  44. that comes at basically 0 cost we leave that on. We simply disable the
  45. rbtree front sector lookup when the io scheduler merge function is called.
  46. Nov 11 2002, Jens Axboe <jens.axboe@oracle.com>