Modify IO scheduling algorithm in linux

View the current IO scheduling algorithm of the system: [root @ IO-0-1 ~] # Cat/sys/block/sda/queue/schedulernoopanticipatorydeadline [cfq] ---- modify the IO scheduling algorithm for the current algorithm in parentheses: www.2cto.com [root @ IO-0-1 ~] # Echo...
View the current IO scheduling algorithm of the system: [root @ IO-0-1 ~] # Cat/sys/block/sda/queue/scheduler noop anticipatory deadline [cfq] ---- modify the IO scheduling algorithm for the currently used algorithm in parentheses: www.2cto.com [root @ IO-0-1 ~] # Echo deadline>/sys/block/sda/queue/schedue [root @ IO-0-1 ~] # Cat/sys/block/sda/queue/scheduler noop anticipatory [deadline] cfq you can see that the IO scheduling algorithm has been modified to deadline's IO scheduling algorithm for MYSQL database servers. optimization settings: 1. CFQ is used in scenarios where IO sizes are very uniform. deadLine algorithm is recommended for complex OLTP environments. when IO performance is not a bottleneck, you can use the Noop algorithm www.2cto.com 4. anticipatory is suitable for file servers with ordered storage of big data, such as ftp server and web server. it is not suitable for database environments. this algorithm is not recommended for DB servers. 5. the simplest NOOP of emerging Solid State Disks, such as SSD and Fusion IO, may be the best algorithm, because the optimization of the other three algorithms is based on shortening the seek time, SSD does not have the so-called tracing time and the IO response time is very short. Deadline adjustable parameters such as: [root @ IO-0-1 ~] # Cat/sys/block/sdh/queue/iosched/read_expire 500 unfortunately there is no fixed answer to the specific value...