CN102929801B - A kind of method and apparatus for disk addressing - Google Patents

Abstract

Embodiments of the present invention provide a method and device for addressing a disk, which can solve the problem of large addressing time consumed when operating a disk. The method includes: after the device receives the first queue of operation request messages for randomly reading and writing the disk, determine the first range of the I/O interface position requested by the read operation request message, and then set the I/O interface The I/O interface requested by the write operation request message whose position belongs to the first range is first sorted with the I/O interface requested by all the read operation request message to obtain the second queue of the operation request message; The write operation request message whose position does not belong to the first range is determined as the third queue, and the data requested by the write operation request message of the third queue is written into the cache; finally, according to the operation request message of the second queue , performing the requested operations on the disk in sequence. The present invention is applicable to the computer field.

Description

A method and device for disk addressing

technical field

The invention relates to the field of computer technology, in particular to a method and device for disk addressing.

Background technique

When using mechanical hard disk media to store data, it is often encountered that the data read and write positions are random, resulting in most of the time wasted in the disk media addressing process during the read and write process. Especially in a request, the memory corresponding to the read-write I/O interface that needs to be addressed is small, so that the requested data is distributed in the memory corresponding to multiple I/O interfaces. Based on the randomness of the read-write position, this The performance loss is more serious, resulting in a serious waste of disk addressing time.

In the prior art, the following two methods for reducing disk seek time are proposed:

1) Use the high-speed buffer register Cache to cache the data that deviates greatly from the current head. When reading and writing data again, judge whether to read and write the Cache according to whether the data is stored in the Cache. If it exists in the Cache, it does not need to read from the disk, and read it directly from the Cache. If it does not exist in the Cache, read it from the disk. read in. This method does not require all reads and writes to be implemented by addressing in the disk, which saves the time for disk addressing to a certain extent.

2) Adopt the Linux elevator solution. In the I/O scheduling process, when the method processes the message requests of the read-write I/O interface in the disk, it selects the optimal plan to merge and sort the message requests and then process them. Some messages that are not in the optimal plan The request will be temporarily suspended. When a new I/O interface request is added to the message request queue, first check whether each suspended message request in the disk can be merged into the new message request queue. If so, combine The current position of the magnetic head, the merged new message request queue selects the optimal sequence to read and write I/O interface operations. If the merge fails, the pending message request will be inserted in place. This method can complete the message request of reading and writing the I/O interface through a certain sort, and save the disk addressing time to a certain extent.

However, in the above two methods for solving the time waste of disk addressing, there are still the following problems:

When the cache register Cache is used to cache data, when the storage space in the Cache is full, the data cached in the Cache needs to be written to the disk. If the data cached in the Cache is saved to the disk, the data in the cache is still randomly written to the disk because the relationship between the location of the data in the Cache on the disk and the location of the currently requested I/O interface is not considered. This still causes the disk to operate, and consumes a large seek time.

When using the Linux elevator solution, some message requests for reading and writing I/O interfaces may be suspended for a long time due to sorting reasons before being executed. Inserted directly at the end of the queue. At this time, due to the addition of the pending request, it still consumes a relatively large seek time when operating on the disk.

Contents of the invention

Embodiments of the present invention provide a method and device for disk addressing, which can solve the problem of large addressing time consumed when operating a disk.

In order to achieve the above object, embodiments of the present invention adopt the following technical solutions:

In a first aspect, a method for disk addressing is provided, the method comprising:

A first queue for receiving operation request messages for random reading and writing of the disk, where each operation request message carries an I/O interface corresponding to an operation request for the disk;

Determining a first range of I/O interface locations requested by the read operation request message, the first range being the two read operation request message requests whose locations of the requested I/O interfaces in the first queue are farthest away The range determined by the I/O interface;

Performing a first sorting on the I/O interfaces requested by the write operation request message whose position of the I/O interface belongs to the first range and all the I/O interfaces requested by the read operation request message to obtain the second queue of the operation request message;

Determining the write operation request message whose position of the I/O interface does not belong to the first range as a third queue, and writing the data requested by the write operation request message of the third queue into the cache;

According to the operation request message of the second queue, perform the requested operation on the disk in sequence.

In a first possible implementation manner, according to the first aspect, after obtaining the second queue of the operation request message, the method further includes:

Determine whether the position of the I/O interface corresponding to the data in the cache has a first I/O interface belonging to the first range;

If there is the first I/O interface, according to the first sorting, insert a write operation request message for writing data corresponding to the first I/O interface into the second queue;

or

Performing a first sorting on the I/O interfaces requested by the write operation request messages belonging to the first scope and all the I/O interfaces requested by the read operation request messages, and before obtaining the second queue of the operation request messages, further includes:

Determine whether the position of the I/O interface corresponding to the data in the cache has a first I/O interface belonging to the first range;

If there is the first I/O interface, inserting a write operation request message for performing a write operation on data corresponding to the first I/O interface into the first queue of the disk.

In the second possible implementation manner, according to the first aspect or the first possible implementation manner, before writing the data requested by the write operation request message of the third queue into the cache, the method further includes:

Check whether the storage space in the cache is full;

If the storage space in the cache is full, determine the second I/O interface, the second I/O interface is the I/O interface requested in the third queue and the I/O interface corresponding to the cached data The position in the O interface is closest to the I/O interface of the second queue;

If the second I/O interface exists in the cache, according to the first sorting, insert a write operation request message for writing data corresponding to the second I/O interface into the second queue ;

If the second I/O interface exists in the third queue, according to the first sorting, insert the write operation request message corresponding to the second I/O interface of the third queue into the second queue middle.

In the third possible implementation manner, according to the first aspect or the first possible implementation manner or the second possible implementation manner, the first sorting is specifically:

The position of the I/O interface where the current magnetic head is located is the first previous I/O interface, and the I/O interface closest to the position of the previous I/O interface is determined as the next I/O interface, according to the I/O interface The sorting corresponds to the sorting of obtaining the operation request messages.

In the fourth possible implementation, according to the third possible implementation, before writing the data requested by the write operation request message of the third queue into the cache, the method further includes:

Check whether the first queue is full of write operation request messages;

If the first queue is full of write operation request messages, then determine the third I/O interface and the fourth I/O interface, and the third I/O interface is less than the distance from the previous I/O interface. A preset range of I/O interfaces, the fourth I/O interface is an I/O interface whose distance from any I/O interface of the third I/O interface is greater than the first preset range, so The write operation request message corresponding to the fourth I/O interface is determined as the third queue;

After getting the second queue of operation request messages, also include:

Inserting the write operation request message corresponding to the third I/O interface into the second queue according to the first sorting.

In the fifth possible implementation, according to the first aspect or the first possible implementation to the fourth possible implementation, after receiving the first queue of operation request messages for performing random read and write on the disk, Also includes:

Counting the request frequency of the I/O interface of the disk area corresponding to the I/O interface of the first queue request respectively, and judging whether the disk area is a remote area;

According to the operation request message of the second queue, after sequentially performing the requested operations on the disk, the method further includes:

If there is a fifth I/O interface in a remote area in the I/O interface requested by the read operation request message of the first queue, write the data read by the fifth I/O interface requested by the read operation request message into in the cache.

In a second aspect, a device for disk addressing is provided, and the device includes a receiving unit, a determining unit, and a processing unit;

The receiving unit is configured to receive a first queue of operation request messages for randomly reading and writing to the disk, and each operation request message carries an I/O interface corresponding to an operation request for the disk;

The determining unit is configured to determine a first range of I/O interface locations requested by the read operation request message, the first range being the location of the requested I/O interface in the first queue with the farthest distance The range determined by the I/O interface requested by the two read operation request messages;

The processing unit is configured to first sort the I/O interfaces requested by the write operation request messages whose I/O interface positions belong to the first range and the I/O interfaces requested by all the read operation request messages, to obtain the operation The second queue of request messages;

The determining unit is further configured to determine the write operation request message whose position of the I/O interface does not belong to the first range as the third queue, and the processing unit is further configured to assign the write operation request message of the third queue to the third queue. The data requested by the request message is written into the cache;

The processing unit is further configured to sequentially perform the requested operations on the disk according to the operation request messages of the second queue.

In a first possible implementation manner, in combination with the second aspect, the determining unit is further configured to, after obtaining the second queue of the operation request message, determine whether the position of the I/O interface corresponding to the data in the cache is There is a first I/O interface belonging to the first range;

The processing unit is further configured to, if there is the first I/O interface, according to the first sorting, insert into the second queue the data corresponding to the first I/O interface to perform the write operation Write operation request message;

or

The determining unit is further configured to first sort the I/O interfaces requested by the write operation request message and all the I/O interfaces requested by the read operation request message belonging to the first range, and obtain the second I/O interface of the operation request message. Before the queue, determine whether the position of the I/O interface corresponding to the data in the cache has a first I/O interface belonging to the first range;

The processing unit is further configured to, if there is the first I/O interface, insert a write operation request message for writing data corresponding to the first I/O interface into the first queue of the disk .

In a second possible implementation manner, according to the second aspect or the first possible implementation manner, the device further includes an inspection unit,

The checking unit is configured to check whether the storage space in the cache is full before writing the data requested by the write operation request message of the third queue into the cache;

The determining unit is further configured to determine a second I/O interface if the storage space in the cache is full, and the second I/O interface is the I/O interface requested in the third queue and the requested I/O interface. The position in the I/O interface corresponding to the data of the cache is closest to the I/O interface of the second queue;

The processing unit is further configured to insert data corresponding to the second I/O interface into the second queue according to the first sorting if the second I/O interface exists in the cache A write operation request message for a write operation;

The processing unit is further configured to: if the second I/O interface exists in the third queue, according to the first sorting, the write operation request corresponding to the second I/O interface of the third queue A message is inserted into said second queue.

In the third possible implementation manner, according to the second aspect or the first possible implementation manner or the second possible implementation manner, the first sorting is specifically:

The position of the I/O interface where the current magnetic head is located is the first previous I/O interface, and the I/O interface closest to the position of the previous I/O interface is determined as the next I/O interface, according to the I/O interface The sorting corresponds to the sorting of obtaining the operation request messages.

In the fourth possible implementation, according to the third possible implementation,

The checking unit is configured to check whether the first queue is full of write operation request messages before writing the data requested by the write operation request message of the third queue into the cache;

The determining unit is further configured to determine a third I/O interface and a fourth I/O interface if all of the first queue contains write operation request messages, and the third I/O interface is the same as the last I/O interface. The distance of the I/O interface is less than the I/O interface of the first preset range, and the distance between the fourth I/O interface and any I/O interface of the third I/O interface is greater than the first preset range of I/O interfaces, the write operation request message corresponding to the fourth I/O interface is determined as the third queue;

The processing unit is further configured to, after obtaining the second queue of operation request messages, insert the write operation request message corresponding to the third I/O interface into the second queue according to the first sorting.

In a fifth possible implementation manner, according to the second aspect or the first possible implementation manner to the fourth possible implementation manner, the device further includes a statistical unit,

The statistical unit is configured to, after receiving the first queue of operation request messages for randomly reading and writing the disk, count the I/O interfaces of the disk regions respectively corresponding to the I/O interfaces requested by the first queue Request frequency, judging whether the disk area is a remote area;

The processing unit is further configured to, after sequentially performing the requested operations on the disk according to the operation request message of the second queue, if the I/O interface requested by the read operation request message of the first queue There is a fifth I/O interface in a remote area, and the data read by the fifth I/O interface requested by the read operation request message is written into the cache.

The embodiment of the present invention provides a method and device for disk addressing. After receiving the first queue of operation request messages for random reading and writing of the disk, the method according to the information carried in each operation request message The corresponding I/O interface when performing an operation request on the disk, determine the first range of the I/O interface position requested by the read operation request message, and the first range is the I of the request in the first queue The position of the /O interface is the range determined by the I/O interfaces requested by the two read operation request messages farthest away, and then the position of the I/O interface belongs to the I/O interface requested by the write operation request message of the first range Perform first sorting with the I/O interfaces requested by all read operation request messages, obtain the second queue of operation request messages, and determine the write operation request messages whose positions of the I/O interface do not belong to the first range as the third queue , writing the data requested by the write operation request message of the third queue into the cache, and finally performing the requested operation on the disk in sequence according to the operation request message of the second queue.

First, the position of the I/O interface requested by the write operation request message in the third queue is not within the first range, and the data requested by the write operation request message in the third queue is directly written into the cache, which can save disk The addressing time also avoids that when the I/O interface requested by the operation request message is far away from the first range, the operation request message is suspended in the disk for a long time, and the operation request message is received again When it is inserted into the tail of the queue, it consumes a lot of addressing time.

In addition, when the data written in the cache is requested again, it can be directly read from the cache without addressing in the disk, and also saves disk addressing time.

Furthermore, the second queue is a sorted queue, so that when the second queue performs the requested operation on the disk, the requests are sequentially performed according to the sort order of the requested I/O interfaces Instead of performing the requested operation randomly after receiving the first queue, it also saves disk seek time.

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will briefly introduce the drawings that need to be used in the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description are only These are some embodiments of the present invention. Those skilled in the art can also obtain other drawings based on these drawings without creative work.

FIG. 1 is a schematic flowchart of a method for disk addressing provided by an embodiment of the present invention;

FIG. 2 is a schematic flowchart of another method for disk addressing provided by an embodiment of the present invention;

3 is a schematic diagram of processing the I/O interface of the received first queue request by using another method for disk addressing provided by an embodiment of the present invention;

FIG. 4 is a schematic structural diagram of a device for disk addressing provided by an embodiment of the present invention;

FIG. 5 is a schematic structural diagram of another device for disk addressing provided by an embodiment of the present invention;

FIG. 6 is a schematic structural diagram of another device for disk addressing provided by an embodiment of the present invention.

detailed description

The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some, not all, embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the protection scope of the present invention.

Embodiment one,

An embodiment of the present invention provides a method for disk addressing, specifically as shown in FIG. 1, the method includes:

101. A first queue for receiving operation request messages for performing random reads and writes on the disk, where each operation request message carries an I/O interface corresponding to an operation request on the disk.

Generally, a disk is composed of many sectors, and one or more sectors correspond to an I/O interface. When performing random read and write operations on the disk, the essence is to read data from the disk or read data from the disk through the I/O interface. The action of writing data to disk. Therefore, in the operation request messages for performing random reading and writing on the disk, each operation request message carries the corresponding I/O interface when performing an operation request on the disk.

102. Determine a first range of I/O interface locations requested by the read operation request message, where the first range is the two read operation requests in the first queue whose I/O interface locations are farthest from each other The scope determined by the I/O interface of the message request.

Determine the first range of I/O interface positions requested by the read operation request message, and when the first queue is full of read operation request messages, the first range includes all the request message requests in the first queue I/O interface; when the first queue is all write operation request messages, the first range is empty; when the first queue contains both read operation request messages and write operation request messages, then The first range may also include the I/O interface requested by the write operation request message.

103. First sort the I/O interfaces requested by the write operation request messages whose I/O interface positions belong to the first range and all the I/O interfaces requested by the read operation request messages, and obtain the second I/O interfaces requested by the operation request messages. queue.

In order to reduce disk addressing time, after the first range of I/O interface positions in the first queue is determined, the operation request messages of the first queue may be separated. Wherein, the read and write operation request messages whose positions of the I/O interfaces are within the first range are used as a queue; the write operation request messages whose positions of the I/O interfaces are outside the first range are used as a queue.

Then the I/O interface requested by the read and write operation request message whose position of the I/O interface belongs to the first range is first sorted, wherein the first sorting can be performed according to the position of the I/O interface from large to small Arranged in order, it can also be arranged in order from small to large, or the position of the I/O interface where the current head is located can be the first and last I/O interface, and the I/O interface closest to the position of the previous I/O interface can be The O interface is determined to be the next I/O interface, and accordingly the I/O interfaces requested by all operation request messages in the first range are sorted, and then the order of the operation request messages is obtained according to the order of the I/O interfaces. , to obtain the second queue of the operation request message. Specifically, this embodiment of the present invention does not specifically limit it.

104. Determine the write operation request message whose location of the I/O interface does not belong to the first range as the third queue, and write the data requested by the write operation request message of the third queue into the cache.

If the second queue includes all read operation request messages in the first queue and all write operation request messages whose I/O interface positions are within the first range, then the I/O interface positions do not belong to the first range All write operation request messages are determined as the third queue.

Since the location of the I/O interface requested by the write operation request message in the third queue is not within the first range, it indicates that the location of the I/O interface requested by the third queue is far from the second queue, in order to save disk addressing time , the data requested by the write operation request message in the third queue may be directly written into the cache.

In addition, the data in the write cache can be used to directly read in the cache when the read operation request message of the I/O interface corresponding to the data in the cache reappears, without searching for the data in the disk. address, and also save disk seek time.

It should be noted here that there is no absolute sequence in terms of time for acquiring the second queue and acquiring the third queue, and step 104 may be performed first, and then step 103 may be performed. This embodiment of the present invention does not limit it.

In addition, it should be noted that the cache is a permanent cache.

105. Perform the requested operation on the disk in sequence according to the operation request message in the second queue.

The second queue is a sorted queue, so that when the second queue performs the requested operation on the disk, the requested operations are performed sequentially according to the sort order of the requested I/O interfaces, Instead of performing the requested operation randomly after receiving the first queue, the disk addressing time is saved.

Correspondingly, it should be noted that step 105 may also be executed after acquiring the second queue in step 103, which is not specifically limited in this embodiment of the present invention.

An embodiment of the present invention provides a method for disk addressing. After receiving the first queue of operation request messages for randomly reading and writing to the disk, the method uses the address information carried in each operation request message to The corresponding I/O interface when the disk performs an operation request determines the first range of the I/O interface position requested by the read operation request message, and the first range is the requested I/O in the first queue The position of the interface is the range determined by the I/O interface requested by the two read operation request messages farthest away, and then the I/O interface requested by the write operation request message whose position of the I/O interface belongs to the first range and all The I/O interface requested by the read operation request message is first sorted to obtain the second queue of the operation request message, and the write operation request message whose position of the I/O interface does not belong to the first range is determined as the third queue, and the The data requested by the write operation request message of the third queue is written into the cache, and finally, according to the operation request message of the second queue, the requested operations are sequentially performed on the disk.

Based on the technical solution provided by the embodiment of the present invention, first, the position of the I/O interface requested by the write operation request message in the third queue is not within the first range, and the data requested by the write operation request message in the third queue Writing directly into the cache can save disk addressing time, and also avoids long-term hanging of the operation request message in the disk when the I/O interface requested by the operation request message is far from the first range. From the beginning, when the operation request message is received again, the problem of the consumed addressing time caused by being inserted into the tail of the queue is relatively large.

In addition, when the data written in the cache is requested again, it can be directly read from the cache without addressing in the disk, and also saves disk addressing time.

Furthermore, the second queue is a sorted queue, so that when the second queue performs the requested operation on the disk, the requests are sequentially performed according to the sort order of the requested I/O interfaces Instead of performing the requested operation randomly after receiving the first queue, it also saves disk seek time.

Embodiment two,

An embodiment of the present invention provides a method for disk addressing, specifically as shown in Figure 2, the method includes:

201. A first queue that receives operation request messages for random reading and writing of the disk, where each operation request message carries an I/O interface corresponding to the operation request for the disk.

Generally, a disk is composed of many sectors, and one or more sectors correspond to an I/O interface. When performing random read and write operations on the disk, the essence is to read data from the disk or read data from the disk through the I/O interface. The action of writing data to disk. Therefore, in the operation request messages for performing random reading and writing on the disk, each operation request message carries the corresponding I/O interface when performing an operation request on the disk.

For example, as shown in Figure 3, it is assumed that the I/O interfaces requested by the received operation request message of the first queue are respectively:

Read I/O port 1, write I/O port 15, read I/O port 6, read I/O port 9, write I/O port 7, and write I/O port 12. Each elliptical small unit represents an I/O interface requested by a read operation, and each rectangular small unit represents an I/O interface requested by a write operation.

202. Determine a first range of I/O interface locations requested by the read operation request message, where the first range is the two read operation requests in the first queue whose I/O interface locations are farthest from each other The scope determined by the I/O interface of the message request.

Determine the first range of I/O interface positions requested by the read operation request message, and when the first queue is full of read operation request messages, the first range includes all the request message requests in the first queue I/O interface; when the first queue is all write operation request messages, the first range is empty; when the first queue contains both read operation request messages and write operation request messages, then The first range may also include the I/O interface requested by the write operation request message.

Specifically as shown in Figure 3, in the first queue, the position between I/O interface 1 and I/O interface 9 is the farthest, so the first range of the first queue received should be I/O interface 1 to I I/O interface between /O interface 9.

203. First sort the I/O interfaces requested by the write operation request messages whose I/O interface positions belong to the first range and all the I/O interfaces requested by the read operation request messages, and obtain the second I/O interfaces requested by the operation request messages. queue.

In order to reduce disk addressing time, after the first range of I/O interface positions in the first queue is determined, the operation request messages of the first queue may be separated. Wherein, the read and write operation request messages whose positions of the I/O interfaces are within the first range are used as a queue; the write operation request messages whose positions of the I/O interfaces are outside the first range are used as a queue.

Then the I/O interface requested by the read and write operation request message whose position of the I/O interface belongs to the first range is first sorted, wherein the first sorting can be performed according to the position of the I/O interface from large to small Arranged in order, it can also be arranged in order from small to large, or the position of the I/O interface where the current head is located can be the first and last I/O interface, and the I/O interface closest to the position of the previous I/O interface can be The O interface is determined to be the next I/O interface, and accordingly the I/O interfaces requested by all operation request messages in the first range are sorted, and then the order of the operation request messages is obtained according to the order of the I/O interfaces. , to obtain the second queue of the operation request message. Specifically, this embodiment of the present invention does not specifically limit it.

Specifically as shown in Figure 3, the I/O interface 7 requested by the write operation request message is within the first range, and it is combined with the I/O interface I/O interface 1 and the I/O interface 6 requested by all read operation request messages. The I/O interface 9 carries out the first sorting together, assuming that in the first range, the I/O interface 6 is the closest to the I/O interface 5 where the current magnetic head is located, and now the I/O interface 6 is the I/O interface where the current magnetic head is located The next I/O interface of /O interface 5, then I/O interface 6 is used as the previous I/O interface, and the closest to I/O interface 6 is I/O interface 7. In this way, the next I/O The interfaces are I/O interface 9 and I/O interface 1 in turn. The finally obtained second queue is shown in Figure 3 as follows:

Read I/O port 6, write I/O port 7, read I/O port 9, and read I/O port 1.

Of course, the first sorting method can also have other methods, which can be arranged according to the above-mentioned sorting method, or in ascending order, so that the sorting result is: I/O1, I/O6, I/O7, I/O1 /O9, there can also be other ways, which are not specifically limited here.

204. Determine whether the position of the I/O interface corresponding to the data in the cache has a first I/O interface belonging to the first range.

Specifically, as shown in FIG. 3 , it is assumed that the I/O interfaces corresponding to the data in the cache are I/O interface 3 , I/O interface 10 , and I/O interface 18 .

At this time, the I/O interface 3 is within the first range, so there are I/O interfaces belonging to the first range in the cache, and the I/O interface 3 is the first I/O interface.

If there is the first I/O interface, perform step 205; if there is no first I/O interface, perform step 206.

205. If there is the first I/O interface, according to the first sorting, insert a write operation request message for writing data corresponding to the first I/O interface into the second queue.

If there is the first I/O interface, a write request message for writing data corresponding to the first I/O interface can be inserted into the second queue, on the one hand, without wasting redundant addressing time On the premise that the data corresponding to the first I/O interface in the cache is written into the first I/O interface; on the other hand, space can be saved for the cache to cache other data.

Specifically as shown in Figure 3, because it is determined in step 204 that the I/O interface 3 is an I/O interface belonging to the first range, at this time, the write operation request message of the data corresponding to the I/O interface 3 is inserted into the second queue , the second queue obtained in Figure 3 is:

Read I/O port 6, write I/O port 7, read I/O port 9, write I/O port 3, and read I/O port 1.

206. Determine the write operation request messages whose I/O interface locations do not belong to the first range as the third queue.

If the second queue includes all read operation request messages in the first queue and all write operation request messages whose I/O interface positions are within the first range, then the I/O interface positions do not belong to the first range All write operation request messages are determined as the third queue.

Since the position of the I/O interface requested by the write operation request message in the third queue is not within the first range, in order to save disk addressing time, the data requested by the write operation request message in the third queue can be directly written into the cache.

In addition, the data in the write cache can be used to directly read in the cache when the read operation request message of the I/O interface corresponding to the data in the cache reappears, without searching for the data in the disk. address, and also save disk seek time.

Specifically as shown in Figure 3, the position of the I/O interface does not belong to the I/O interface corresponding to the write operation request message of the first range is to write the I/O interface 15, and write the I/O interface 12, then the I/O The write operation request messages of the O interface 15 and the I/O interface 12 are determined as the third queue.

What needs to be explained here is that there is no absolute sequence in terms of time for acquiring the second queue and acquiring the third queue. You can also execute step 206 first, and then execute step 203; you can also execute step 203 and then execute 206. Step 203 must be executed before step 204, and when step 206 is executed earlier than step 204, if step 204 judges No, step 207 will be executed next.

207. Check whether the storage space in the cache is full.

On the premise that the storage space of the cache is full, the data requested by the write operation request message of the third queue cannot be directly written into the cache at this time. Therefore, before writing the data requested by the write operation request message of the third queue into the cache, it is first necessary to check whether the storage space in the cache is full.

Specifically as shown in FIG. 3 , it is assumed that when the cache initially stores the data corresponding to the I/O interface 3 , the I/O interface 10 , and the I/O interface 18 , the storage space of the cache is just full. After the write operation request message for writing data corresponding to the I/O interface 3 is inserted into the second queue, it indicates that space is reserved in the cache. And although there is a certain storage space in the cache, two write operation request messages are included in the third queue, corresponding to I/O interface 15 and I/O interface 12 respectively, assuming that the data requested by each operation request message occupies At this time, the cache space is not enough, so if the free storage space in the cache is smaller than the storage space corresponding to the data requested by the write operation request message of the third queue, the cache space is considered to be full at this time.

If the storage space in the cache is full, execute step 208; if the storage space in the cache is not full, execute step 211.

208. If the storage space in the cache is full, determine a second I/O interface, where the second I/O interface corresponds to the I/O interface requested in the third queue and the cached data The position in the I/O interface is closest to the I/O interface of the second queue.

In order to be able to process the write operation request message in the third queue in time and reduce the time of disk addressing as much as possible, when the cache space is full, it is necessary to determine the I/O interface requested in the third queue and the I/O interface in the cache. Among the I/O interfaces corresponding to the data, the I/O interface closest to the I/O interface requested by the second queue is the second I/O interface. Then insert a write operation request message for writing data corresponding to the second I/O interface into the second queue.

Specifically, as shown in Figure 3, the I/O interfaces corresponding to the write request messages in the third queue include I/O interface 12 and I/O interface 15, and the I/O interfaces corresponding to the data in the cache also have I/O interfaces 10. I/O interface 18, the second queue is reading I/O interface 6, writing I/O interface 7, reading I/O interface 9, writing I/O interface 3, and reading I/O interface 1.

At this time, the I/O interface requested by the third queue is sequentially compared with the I/O interface corresponding to the data in the cache, and the I/O interface closest to the I/O interface requested by the second queue is found. Obviously, the I/O interface closest to the second queue request among the I/O interface requested in the third queue and the I/O interface corresponding to the data in the cache is I/O interface 10, so it is determined that the second I/O interface The O interface may be the I/O interface 10, and at this time, there is enough storage space in the cache to write the data requested by the third queue.

Certainly, if multiple write operation request messages are included in the third queue, and when the storage space is full, after determining the first second I/O interface closest to the second queue in the third queue and the cache, The second second I/O interface can also be reselected from the remaining requested I/O interfaces in the third queue and cache until there is enough space in the cache to write the data requested by the third queue. In such a case, multiple second I/O interfaces may exist in the third queue and in the cache at the same time, and then the write corresponding to the second I/O interface of the third queue needs to be respectively Inserting an operation request message into the second queue, inserting a write operation request message for performing a write operation on data corresponding to the second I/O interface in the cache into the second queue, and then obtaining the first the second queue and the third queue.

209. If the second I/O interface exists in the cache, according to the first sorting, insert a write operation for writing data corresponding to the second I/O interface into the second queue request message.

If the second I/O interface exists in the cache, it means that the position of the I/O interface corresponding to the data in the cache is closest to the I/O interface of the second queue. At this time, in order to save disk seek time, Inserting a write operation request message for performing a write operation on data corresponding to the second I/O interface into the second queue.

In addition, after the write operation request message for writing data corresponding to the second I/O interface in the cache is inserted into the second queue, storage space is reserved in the cache, and the third queue can also be The data requested by the write operation request message is written into the cache.

Specifically as shown in Figure 3, in the second I/O interface, the I/O interface 10 is the I/O interface corresponding to the data in the cache, so according to the first sorting, insert the pair of the A write operation request message for writing data in the cache corresponding to the I/O interface 10 .

210. If the second I/O interface exists in the third queue, according to the first sorting, insert the write operation request message corresponding to the second I/O interface of the third queue into the first queue In the second queue.

When the second I/O interface is in the third queue, it indicates that the position of the I/O interface requested by the write operation request message in the third queue is the closest to the second queue. To save disk addressing time, insert the write operation request messages of the third queue into the second queue according to the first sorting.

211. Write the data requested by the write operation request message of the third queue into the cache.

Specifically as shown in Figure 3, the I/O interface requested by the write operation request message of the third queue is I/O interface 12 and I/O interface 15, so the I/O interface 12 and I/O interface 12 in the third queue will be The data requested by the write operation request message of the O interface 15 is written into the cache.

It should be noted that the cache here is a permanent cache.

212. According to the operation request message of the second queue, perform the requested operation on the disk in sequence.

As shown in Figure 3, after the above process, the final second queue is:

Read I/O6, write I/O7, read I/O9, write I/O10, write I/O3, read I/O1, and perform the requested operations on the disk in sequence according to the second queue.

The second queue is a sorted queue, so that when the second queue performs the requested operation on the disk, the requested operations are performed sequentially according to the sort order of the requested I/O interfaces, Instead of performing the requested operation randomly after receiving the first queue, the disk addressing time is saved.

It should be noted that, in the above embodiment, after step 203 is executed and the second queue is obtained, it is determined whether there is a first I/O interface in the cache and whether the data in the cache needs to be written to the disk. Optionally, before obtaining the second queue, it may also be determined in advance whether there is a first I/O interface in the cache, and whether the data in the cache needs to be written to the disk. The specific process includes: determining whether the position of the I/O interface corresponding to the data in the cache has a first I/O interface belonging to the first range; A write operation request message for writing data corresponding to an I/O interface is inserted into the first queue of the disk. Then after the first sorting, the second queue is obtained.

The second queue finally obtained by the two schemes is the same. Therefore, the embodiment of the present invention does not specifically limit whether to sort first and then insert into the second queue or to first insert into the first queue and then sort.

If the operation request messages contained in the first queue are all write operation request messages, the second queue should be empty at this time, and the write operation request messages contained in the third queue and the first queue are the same. All the data requested by the write operation request is written into the cache. Optionally, before writing the data requested by the write operation request message of the third queue into the cache, the method further includes:

Check whether the first queue is full of write operation request messages;

If the first queue is full of write operation request messages, then determine the third I/O interface and the fourth I/O interface, and the third I/O interface is less than the distance from the previous I/O interface. A preset range of I/O interfaces, the fourth I/O interface is an I/O interface whose distance from any I/O interface of the third I/O interface is greater than the first preset range, so The write operation request message corresponding to the fourth I/O interface is determined as the third queue.

Assume that the I/O interfaces requested by the received operation request messages of the first queue are:

Write I/O port 11, Write I/O port 12, Write I/O port 14, Write I/O port 1, Write I/O port 2, Write I/O port 3, Write I/O port 29. And the current magnetic head position is the position at I/O interface 10, and the first preset range is the scope that is less than or equal to the distance of two I/O interfaces; The I/O interface of the distance of the I/O interface is followed by I/O interface 11, I/O interface 12, and the I/O interface with the position of I/O interface 12 being less than or equal to the distance of two I/O interfaces is I/O interface 14, when I/O14 is used as the previous I/O interface, among the remaining I/O interfaces, there is no I/O whose distance from I/O interface 14 is less than or equal to the distance between two I/O interfaces interface, so make sure:

The third I/O interface is an I/O interface 11 , an I/O interface 12 , and an I/O interface 14 .

The I/O interface 1, the I/O interface 2, the I/O interface 3, and the I/O interface 29 are those whose distance from any I/O interface of the third I/O interface is greater than the first preset range. /O interface, so it is determined that: the fourth I/O interface is I/O interface 1, I/O interface 2, I/O interface 3, and I/O interface 29.

The write request message corresponding to the fourth I/O interface is determined as the third queue, then the third queue is: write I/O interface 1, write I/O interface 2, write I/O interface 3, write I /O interface 29.

Then according to the first sorting, insert the write operation request message corresponding to the third I/O interface into the second queue, and then insert the second queue request message according to the operation request message of the second queue The data corresponding to the I/O interface is written to the disk in sequence.

Optionally, after receiving the first queue of operation request messages for performing random read and write operations on the disk, the method further includes:

Counting the request frequency of the I/O interface of the disk area corresponding to the I/O interface of the first queue request respectively, and judging whether the disk area is a remote area;

According to the operation request message of the second queue, after sequentially performing the requested operations on the disk, the method further includes:

If there is a fifth I/O interface in a remote area in the I/O interface requested by the read operation request message of the first queue, write the data read by the fifth I/O interface requested by the read operation request message into in the cache.

After receiving the first queue of operation request messages for random reading and writing of the disk, the remote area is first judged, if the I/O interface corresponding to some read operation request messages is in a remote area, there is a fifth I I/O interface, then write the data read by the fifth I/O interface requested by the read operation request message into the cache. In this way, when the read operation request message of the fifth I/O interface appears next time, it can be directly read from the cache, saving disk addressing time.

An embodiment of the present invention provides a method for disk addressing. After receiving the first queue of operation request messages for randomly reading and writing to the disk, the method uses the address information carried in each operation request message to The corresponding I/O interface when the disk performs an operation request determines the first range of the I/O interface position requested by the read operation request message, and the first range is the requested I/O in the first queue The position of the interface is the range determined by the I/O interface requested by the two read operation request messages farthest away, and then the I/O interface requested by the write operation request message whose position of the I/O interface belongs to the first range and all The I/O interface requested by the read operation request message is first sorted to obtain the second queue of the operation request message, and the write operation request message whose position of the I/O interface does not belong to the first range is determined as the third queue, and the The data requested by the write operation request message of the third queue is written into the cache, and finally, according to the operation request message of the second queue, the requested operations are sequentially performed on the disk.

Based on the technical solution provided by the embodiment of the present invention, first, the position of the I/O interface requested by the write operation request message in the third queue is not within the first range, and the data requested by the write operation request message in the third queue Writing directly into the cache can save disk addressing time, and also avoids long-term hanging of the operation request message in the disk when the I/O interface requested by the operation request message is far from the first range. From the beginning, when the operation request message is received again, the problem of the consumed addressing time caused by being inserted into the tail of the queue is relatively large.

In addition, when the data written in the cache is requested again, it can be directly read from the cache without addressing in the disk, and also saves disk addressing time.

Furthermore, the second queue is a sorted queue, so that when the second queue performs the requested operation on the disk, the requests are sequentially performed according to the sort order of the requested I/O interfaces Instead of performing the requested operation randomly after receiving the first queue, it also saves disk seek time.

Embodiment three,

An embodiment of the present invention provides a device 40 for disk addressing, specifically as shown in FIG. 4 , the device 40 for disk addressing includes: a receiving unit 41 , a determining unit 42 and a processing unit 43 .

The receiving unit 41 is configured to receive a first queue of operation request messages for randomly reading and writing the disk, and each operation request message carries an I/O interface corresponding to an operation request for the disk .

Generally, a disk is composed of many sectors, and one or more sectors correspond to an I/O interface. When performing random read and write operations on the disk, the essence is to read data from the disk or read data from the disk through the I/O interface. The action of writing data to disk. Therefore, in the operation request messages for performing random reading and writing on the disk, each operation request message carries the corresponding I/O interface when performing an operation request on the disk.

The determining unit 42 is configured to determine a first range of the location of the I/O interface requested by the read operation request message, the first range being that the location of the requested I/O interface in the first queue is the farthest The range determined by the I/O interface requested by the two read operation request messages.

After determining the first range, when the first queue is all read operation request messages, the first range contains the I/O interfaces requested by all the request messages in the first queue; when the first queue When all are write operation request messages, the first range is empty; when the first queue contains both read operation request messages and write operation request messages, the first range may also contain write operations The I/O interface requested by the request message.

The processing unit 43 is configured to first sort the I/O interfaces requested by the write operation request messages whose I/O interface positions belong to the first range and all the I/O interfaces requested by the read operation request messages, to obtain Second queue for operation request messages.

In order to reduce disk addressing time, after the first range of I/O interface positions in the first queue is determined, the operation request messages of the first queue may be separated. Wherein, the read and write operation request messages whose positions of the I/O interfaces are within the first range are used as a queue; the write operation request messages whose positions of the I/O interfaces are outside the first range are used as a queue.

Then the I/O interface requested by the read and write operation request message whose position of the I/O interface belongs to the first range is first sorted, wherein the first sorting can be performed according to the position of the I/O interface from large to small Arranged in order, it can also be arranged in order from small to large, or the position of the I/O interface where the current head is located can be the first and last I/O interface, and the I/O interface closest to the position of the previous I/O interface can be The O interface is determined to be the next I/O interface, and accordingly the I/O interfaces requested by all operation request messages in the first range are sorted, and then the order of the operation request messages is obtained according to the order of the I/O interfaces. , to obtain the second queue of the operation request message. Specifically, this embodiment of the present invention does not specifically limit it.

The determining unit 42 is further configured to determine the write operation request messages whose I/O interface locations do not belong to the first range as the third queue.

If the second queue includes all read operation request messages in the first queue and all write operation request messages whose I/O interface positions are within the first range, then the I/O interface positions do not belong to the first range All write operation request messages are determined as the third queue.

Since the location of the I/O interface requested by the write operation request message in the third queue is not within the first range, it indicates that the location of the I/O interface requested by the third queue is far from the second queue, in order to save disk addressing time , the data requested by the write operation request message in the third queue may be directly written into the cache.

In addition, the data in the write cache can be used to directly read in the cache when the read operation request message of the I/O interface corresponding to the data in the cache reappears, without searching for the data in the disk. address, and also save disk seek time.

The processing unit 43 is further configured to write the data requested by the write operation request message of the third queue into the cache.

The processing unit 43 is further configured to sequentially perform the requested operation on the disk according to the operation request message in the second queue.

The second queue is a sorted queue, so that when the second queue performs the requested operation on the disk, the requested operations are performed sequentially according to the sort order of the requested I/O interfaces, Instead of performing the requested operation randomly after receiving the first queue, the disk addressing time is saved.

It should be noted that the cache is a permanent cache.

optional,

The determining unit 42 is further configured to determine whether the position of the I/O interface corresponding to the data in the cache has a first I/O interface belonging to the first range after obtaining the second queue of the operation request message. O interface.

The processing unit 43 is further configured to, if there is the first I/O interface, according to the first sorting, insert the data corresponding to the first I/O interface into the second queue to perform a write operation The write operation request message.

If there is the first I/O interface, a write request message for writing data corresponding to the first I/O interface can be inserted into the second queue, on the one hand, without wasting the addressing time On the premise, the data corresponding to the first I/O interface in the cache is written into the first I/O interface; on the other hand, space can be saved for the cache to cache other data.

Optionally, the determining unit 42 is further configured to first sort the I/O interfaces requested by the write operation request message and all the I/O interfaces requested by the read operation request message belonging to the first range, to obtain Before operating the second queue of the request message, it is determined whether there is a first I/O interface belonging to the first range at the position of the I/O interface corresponding to the data in the cache.

The processing unit 43 is further configured to, if there is the first I/O interface, insert a write operation request message for writing data corresponding to the first I/O interface into the first queue of the disk middle.

Optionally, as shown in FIG. 5 , the device 40 for disk addressing further includes a checking unit 44 .

The checking unit 44 is configured to check whether the storage space in the cache is full before writing the data requested by the write operation request message of the third queue into the cache.

On the premise that the storage space of the cache is full, the data requested by the write operation request message of the third queue cannot be directly written into the cache at this time. Therefore, before writing the data requested by the write operation request message of the third queue into the cache, the check unit 44 first needs to check whether the storage space in the cache is full.

The determining unit 42 is further configured to determine a second I/O interface if the storage space in the cache is full, and the second I/O interface is the I/O interface requested in the third queue and The position of the I/O interface corresponding to the cached data is closest to the I/O interface of the second queue.

In order to be able to process the write operation request message in the third queue in time and reduce the time of disk addressing as much as possible, when the cache space is full, it is necessary to determine the I/O interface requested in the third queue and the I/O interface in the cache. Among the I/O interfaces corresponding to the data, the I/O interface closest to the I/O interface requested by the second queue is the second I/O interface. Then insert a write operation request message for writing data corresponding to the second I/O interface into the second queue.

The processing unit 43 is further configured to, if the second I/O interface exists in the cache, according to the first sorting, insert the corresponding to the second I/O interface into the second queue A write operation request message for data write operation, after performing the requested operations on the disk in sequence according to the operation request message of the second queue, write the data requested by the write request message of the third queue into in cache.

If the second I/O interface exists in the cache, it means that the position of the I/O interface corresponding to the data in the cache is closest to the I/O interface of the second queue. At this time, in order to save disk seek time, Inserting a write operation request message for performing a write operation on data corresponding to the second I/O interface into the second queue.

In addition, after the write operation request message for writing data corresponding to the second I/O interface in the cache is inserted into the second queue, storage space is reserved in the cache, and the third queue can also be The data requested by the write operation request message is written into the cache.

It should be noted that the cache is a permanent cache.

The processing unit 43 is further configured to, if the second I/O interface exists in the third queue, perform the write operation corresponding to the second I/O interface of the third queue according to the order of the second queue. A request message is inserted into said second queue.

When the second I/O interface is in the third queue, it indicates that the position of the I/O interface requested by the write operation request message in the third queue is the closest to the second queue. To save disk addressing time, the processing unit 43 inserts the write operation request message corresponding to the second I/O interface of the third queue into the second queue according to the first sorting.

optional,

The first sort is:

The position of the I/O interface where the current magnetic head is located is the first previous I/O interface, and the I/O interface closest to the position of the previous I/O interface is determined as the next I/O interface, according to the I/O interface The sorting corresponds to the sorting of obtaining the operation request messages.

optional,

The checking unit 44 is further configured to check whether the first queue is full of write operation request messages before writing the data requested by the write operation request messages in the third queue into the cache.

The determining unit 42 is further configured to determine a third I/O interface and a fourth I/O interface if the first queue is full of write operation request messages, and the third I/O interface is connected to the above The distance of an I/O interface is less than the I/O interface of the first preset range, and the fourth I/O interface is an I/O interface whose distance from the previous I/O interface is greater than the first preset range, and The current position of the I/O interface where the magnetic head is located is the first and last I/O interface, and the write operation request message corresponding to the fourth I/O interface is determined to be the third queue.

The processing unit 43 is further configured to, after obtaining the second queue of operation request messages, insert the write operation request message corresponding to the third I/O interface into the second queue according to the first sorting.

Optionally, as shown in FIG. 6 , the device 40 for disk addressing further includes a statistics unit 45 .

The statistical unit 45 is configured to count the I/O interfaces of the disk regions corresponding to the I/O interfaces requested by the first queue after receiving the first queue of operation request messages for random reading and writing of the disk request frequency, and determine whether the disk area is a remote area.

The processing unit 43 is further configured to, after sequentially performing the requested operations on the disk according to the operation request message of the second queue, if the I/O requested by the read operation request message of the first queue There is a fifth I/O interface in a remote area among the interfaces, and the data read by the fifth I/O interface requested by the read operation request message is written into the cache.

It should be noted that the cache is a permanent cache.

For the detailed addressing process of the device 40 for addressing the disk, refer to the description in Embodiment 2, which will not be repeated in this embodiment.

An embodiment of the present invention provides a device for disk addressing, which includes a receiving unit, a determining unit, and a processing unit. Wherein, after the receiving unit receives the first queue of operation request messages for randomly reading and writing the disk, the determining unit is configured to perform an operation request on the disk according to the operation request carried in each operation request message For the corresponding I/O interface, determine the first range of the position of the I/O interface requested by the read operation request message, and the first range is the farthest from the position of the requested I/O interface in the first queue The range determined by the I/O interface requested by the two read operation request messages, and then the processing unit combines the I/O interface requested by the write operation request message whose position of the I/O interface belongs to the first range with all read operation requests The I/O interface of the message request is first sorted to obtain the second queue of the operation request message, and the determination unit also determines the write operation request message whose position of the I/O interface does not belong to the first range as the third queue The processing unit writes the data requested by the write operation request message of the third queue into the cache, and finally performs the requested operation on the disk in sequence according to the operation request message of the second queue.

Based on the device for disk addressing provided by the embodiment of the present invention, first, the position of the I/O interface requested by the write operation request message in the third queue is not within the first range, and the write operation in the third queue The data requested by the request message is directly written into the cache, which can save disk addressing time, and also avoids the operation request message when the I/O interface requested by the operation request message is far away from the first range. Suspended in the disk for a long time, when the operation request message is received again, it is inserted into the tail of the queue and consumes a large problem of seeking time.

In addition, when the data written in the cache is requested again, it can be directly read from the cache without addressing in the disk, and also saves disk addressing time.

Furthermore, the second queue is a sorted queue, so that when the second queue performs the operation of the request on the disk, the requests are performed sequentially according to the sort order of the requested I/O interface Instead of performing the requested operation randomly after receiving the first queue, it also saves the time of disk addressing.

Those of ordinary skill in the art can understand that all or part of the steps for realizing the above-mentioned method embodiments can be completed by hardware related to program instructions, and the aforementioned program can be stored in a computer-readable storage medium. When the program is executed, the It includes the steps of the above method embodiments; and the aforementioned storage medium includes: ROM, RAM, magnetic disk or optical disk and other various media that can store program codes.

The above is only a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Anyone skilled in the art can easily think of changes or substitutions within the technical scope disclosed in the present invention. Should be covered within the protection scope of the present invention. Therefore, the protection scope of the present invention should be determined by the protection scope of the claims.

Claims (12)

1. A method for disk addressing, characterized in that the method comprises: A first queue for receiving operation request messages for random reading and writing of the disk, where each operation request message in the operation request messages carries an I/O interface corresponding to the operation request for the disk; Determining a first range of I/O interface locations requested by the read operation request message, where the first range is between two I/O interfaces requested by the read operation request message whose locations are farthest from the requested I/O interface The range determined by all I/O interfaces between; The position of the I/O interface belongs to the I/O interface requested by the write operation request message of the first range and the I/O interface requested by all the read operation request messages are first sorted to obtain the second queue of the operation request message; Determining the write operation request message whose position of the I/O interface does not belong to the first range as a third queue, and writing the data requested by the write operation request message of the third queue into the cache; According to the operation request message of the second queue, perform the requested operation on the disk in sequence. 2. The method according to claim 1, characterized in that, after obtaining the second queue of the operation request message, the method further comprises: Determine whether the position of the I/O interface corresponding to the data in the cache has a first I/O interface belonging to the first range; If there is the first I/O interface, according to the first sorting, insert a write operation request message for writing data corresponding to the first I/O interface into the second queue; Or first sort the I/O interfaces requested by the write operation request messages belonging to the first range and the I/O interfaces requested by all read operation request messages, and before obtaining the second queue of the operation request messages, further include: Determine whether the position of the I/O interface corresponding to the data in the cache has a first I/O interface belonging to the first range; If there is the first I/O interface, inserting a write operation request message for performing a write operation on data corresponding to the first I/O interface into the first queue of the disk. 3. The method according to claim 1 or 2, wherein before the data requested by the write operation request message of the third queue is written into the cache, the method further comprises: Check whether the storage space in the cache is full; If the storage space in the cache is full, determine the second I/O interface, the second I/O interface is the I/O interface requested in the third queue and the I/O interface corresponding to the cached data The position in the O interface is closest to the I/O interface of the second queue; If the second I/O interface exists in the cache, according to the first sorting, insert a write operation request message for writing data corresponding to the second I/O interface into the second queue ; If the second I/O interface exists in the third queue, according to the first sorting, insert the write operation request message corresponding to the second I/O interface of the third queue into the second queue middle. 4. The method according to claim 1, wherein the first sorting is: The position of the I/O interface where the current magnetic head is located is the first previous I/O interface, and the I/O interface closest to the position of the previous I/O interface is determined as the next I/O interface, according to the I/O interface The sorting corresponds to the sorting of obtaining the operation request messages. 5. The method according to claim 4, wherein before the data requested by the write operation request message of the third queue is written into the cache, the method further comprises: Check whether the first queue is full of write operation request messages; If the first queue is full of write operation request messages, then determine the third I/O interface and the fourth I/O interface, and the third I/O interface is less than the distance from the previous I/O interface. A preset range of I/O interfaces, the fourth I/O interface is an I/O interface whose distance from any I/O interface of the third I/O interface is greater than the first preset range, so The write operation request message corresponding to the fourth I/O interface is determined as the third queue; Inserting the write operation request message corresponding to the third I/O interface into the second queue according to the first sorting. 6. The method of claim 1, wherein, After receiving the first queue of the operation request message for performing random read and write on the disk, it also includes: Counting the request frequency of the I/O interface of the disk area corresponding to the I/O interface of the first queue request respectively, and judging whether the disk area is a remote area; According to the operation request message of the second queue, after sequentially performing the requested operations on the disk, the method further includes: If there is a fifth I/O interface in a remote area in the I/O interface requested by the read operation request message of the first queue, write the data read by the fifth I/O interface requested by the read operation request message into in the cache. 7. A device for disk addressing, characterized in that the device comprises a receiving unit, a determining unit and a processing unit; The receiving unit is configured to receive a first queue of operation request messages for randomly reading and writing to the disk, where each operation request message in the operation request messages carries a corresponding I/O interface; The determining unit is configured to determine a first range of the I/O interface positions requested by the read operation request message, and the first range is the two read operation request messages whose positions of the requested I/O interfaces are farthest from each other The range determined by all I/O interfaces between the requested I/O interfaces; The processing unit is configured to first sort the I/O interfaces requested by the write operation request messages whose I/O interface positions belong to the first range and all the I/O interfaces requested by the read operation request messages, to obtain the operation The second queue of request messages; The determining unit is further configured to determine the write operation request message whose position of the I/O interface does not belong to the first range as the third queue, and the processing unit is further configured to assign the write operation request message of the third queue to the third queue. The data requested by the request message is written into the cache; The processing unit is further configured to sequentially perform the requested operations on the disk according to the operation request messages of the second queue. 8. The device of claim 7, wherein: The determining unit is further configured to determine whether the position of the I/O interface corresponding to the data in the cache has a first I/O interface belonging to the first range after obtaining the second queue of the operation request message; The processing unit is further configured to, if there is the first I/O interface, according to the first sorting, insert into the second queue the data corresponding to the first I/O interface to perform the write operation Write operation request message; or The determining unit is further configured to first sort the I/O interfaces requested by the write operation request message and all the I/O interfaces requested by the read operation request message belonging to the first range, and obtain the second I/O interface of the operation request message. Before the queue, determine whether the position of the I/O interface corresponding to the data in the cache has a first I/O interface belonging to the first range; The processing unit is further configured to, if there is the first I/O interface, insert a write operation request message for writing data corresponding to the first I/O interface into the first queue of the disk . 9. The device according to claim 7 or 8, characterized in that the device further comprises an inspection unit; The checking unit is configured to check whether the storage space in the cache is full before writing the data requested by the write operation request message of the third queue into the cache; The determining unit is further configured to determine a second I/O interface if the storage space in the cache is full, and the second I/O interface is the I/O interface requested in the third queue and the requested I/O interface. The position in the I/O interface corresponding to the data of the cache is closest to the I/O interface of the second queue; The processing unit is further configured to insert data corresponding to the second I/O interface into the second queue according to the first sorting if the second I/O interface exists in the cache A write operation request message for a write operation; The processing unit is further configured to, if the second I/O interface exists in the third queue, send the write operation request corresponding to the second I/O interface of the third queue according to the order of the second queue A message is inserted into said second queue. 10. The device according to claim 7, wherein the first sorting is: The position of the I/O interface where the current magnetic head is located is the first previous I/O interface, and the I/O interface closest to the position of the previous I/O interface is determined as the next I/O interface, according to the I/O interface The sorting corresponds to the sorting of obtaining the operation request messages. 11. The device according to claim 10, further comprising an inspection unit; The checking unit is configured to check whether the first queue is full of write operation request messages before writing the data requested by the write operation request message of the third queue into the cache; The determining unit is further configured to determine a third I/O interface and a fourth I/O interface if all of the first queue contains write operation request messages, and the third I/O interface is the same as the last I/O interface. The distance of the I/O interface is less than the I/O interface of the first preset range, and the distance between the fourth I/O interface and any I/O interface of the third I/O interface is greater than the first preset range of I/O interfaces, the write operation request message corresponding to the fourth I/O interface is determined as the third queue; The processing unit is further configured to, after obtaining the second queue of operation request messages, insert the write operation request message corresponding to the third I/O interface into the second queue according to the first sorting. 12. The device according to claim 7, further comprising a statistical unit, The statistical unit is configured to, after receiving the first queue of operation request messages for randomly reading and writing the disk, count the I/O interfaces of the disk regions respectively corresponding to the I/O interfaces requested by the first queue Request frequency, judging whether the disk area is a remote area; The processing unit is further configured to, after sequentially performing the requested operations on the disk according to the operation request message of the second queue, if the I/O interface requested by the read operation request message of the first queue There is a fifth I/O interface in a remote area, and the data read by the fifth I/O interface requested by the read operation request message is written into the cache.