IO (input output) scheduling method and IO scheduling device

Abstract

The invention discloses an IO (input output) scheduling method and IO scheduling device. The IO scheduling method includes steps of creating an FIFO (first input first output) queue for each physical disk in a storage system when the storage system is initialized; creating an IO request conflict link table for each IO request inserted into the corresponding FIFO queue; starting scanning head IO requests of the queues after each IO request inserted into the corresponding FIFO queue is executed, judging queue conflicts, recording the IO request conflict link tables, preparing to-be-processed events and transmitting notification by the aid of the conflict link tables. The FIFO queues are in one-to-one correspondence with the physical disks. The IO request conflict link tables are in one-to-one correspondence with the IO requests. The notification indicates that other IO request conflicts in the link tables are relieved. The IO scheduling method and the IO scheduling device have the advantages that large quantities of IO conflicts caused when solid state disks are used as caches and are processed can be prevented, and I/O reading and writing rates and transmission rates can be effectively increased.

Description

technical field [0001] The invention relates to the field of computers, in particular to an IO scheduling method and device. Background technique [0002] The IO (InputOutput, input and output) types of block devices are mainly divided into two types: read and write, and the disk IO processing capacity is far lower than the CPU processing capacity, resulting in multiple IO requests accumulated in the system within a certain period of time, waiting for scheduling For traditional disks, there are currently two main types of scheduling algorithms, one is the first-in-first-out service (First Input First Output, FIFO); [0003] However, in the case of using a solid state disk (SSD) as a cache, the above scheduling algorithms have their disadvantages: first, FIFO cannot make good use of the low latency of SSD, which reduces performance. It is not necessary for the characteristic SSD. Simple use of these two scheduling algorithms cannot give full play to the characteristics of t...

AI Technical Summary

Problems solved by technology

[0003] However, in the case of using a solid state disk (SSD) as a cache, the above scheduling algorithms have their disadvantages: first, FIFO cannot make good use of the low latency of SSD, which reduces performance. It is not necessary for SSD with special features

Simple use of these two scheduling algorithms cannot give full play to the characteristics of SSD for processing

Moreover, due to the existence of the cache, the processing logic of IO is changed, and new problems are introduced, such as the probability of IO conflicts is greatly increased, which needs to be resolved

[0004] In the prior art, for storage system enterprises, especially in the process of using solid-state hard disk cache processing, how to efficiently and reasonably schedule IO to improve the read and write speed of the storage system is a difficult problem to solve

Images