High Quality Content by WIKIPEDIA articles! CFQ, also known as "Completely Fair Queuing", is an I/O scheduler for the Linux kernel which was written by Jens Axboe. CFQ works by placing synchronous requests submitted by processes into a number of per-process queues and then allocating timeslices for each of the queues to access the disk. The length of the time slice and the number of requests a queue is allowed to submit depends on the IO priority of the given process. Asynchronous requests for all processes are batched together in fewer queues, one per priority. While CFQ does not do explicit anticipatory IO scheduling, it achieves the same effect of having good aggregate throughput for the system as a whole, by allowing a process queue to idle at the end of synchronous IO thereby "anticipating" further close IO from that process. It can be considered a natural extension of granting IO time slices to a process.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.