IO scheduling method and system of Linux disk

Abstract

The invention provides an IO scheduling method and system for a Linux disk. The method comprises the steps that an IO scheduling layer receives a request sent by a universal block layer; the IO scheduling layer allocates corresponding memory resources for the request so as to maintain a data structure related to the request; detecting whether the request is sent by a new process or not, if yes, allocating corresponding memory resources to the new process to maintain the data structure of the new process, adding the request to the FIFO tail of the new process, and adding the new process to the tail of a block device queue; if not, adding the request to the FIFO queue of the corresponding process; when the request is added to the FIFO queue, a starting label is added to the request according to the weight; and comparing the first requests of each process chain, determining the request with the minimum value of the starting label, and assigning the request with the minimum value of the starting label to a block device driver layer. According to the method, the corresponding IO bandwidths are distributed for different disk IO processes according to the weights of the processes, so that the concurrent disk IO processes can obtain fair services.

Description

technical field [0001] The invention belongs to the field of disk scheduling control, and more specifically relates to a Linux disk IO scheduling method and system. Background technique [0002] The Qiongzhou Strait is a channel shared by cargo ships and ferries. Due to the narrow channel and crowded ships, it is easy to cause accidents. Therefore, it is necessary to closely monitor the passing ships and waterways in the Qiongzhou Strait and collect a large amount of data. All data needs to be processed on the server. For the stability of the system, all servers use the Linux system. Due to the frequent reading and writing of data, the pressure is very high, so it is necessary to study the fairness algorithm of the Linux disk scheduler. [0003] The current Linux disk scheduler fairness algorithm has the elevator algorithm (No Operation, NOOP) algorithm: this algorithm implements the simplest first-in-first-out (First Input First Output, FIFO) queue, and all IO requests ar...

AI Technical Summary

Problems solved by technology

[0006] For the defects of prior art, the purpose of the present invention is to provide a kind of IO scheduling method and system of Linux disk, aiming at solving the problem that the IO scheduling method of existing Linux disk cannot provide good fair service and cannot provide Qos service

Images