Request processing method and device, computer equipment, storage medium and program product

Abstract

The invention relates to a request processing method and device, computer equipment, a storage medium and a program product. The method comprises the steps that when a read-write request is received, basic information of the read-write request is recorded in a first target array in a first queue, the first target array is an array corresponding to the write-in time of the read-write request, and further, when a preset timeout duration is reached, according to the number of the basic information contained in an array to be checked in the first queue, the read-write request is checked according to the number of the basic information contained in the array to be checked in the first queue; and determining whether a timeout read-write request exists or not. The ordered queue for recording the basic information of the read-write request is formed in the form of the array, so that processing resources required for determining whether the overtime read-write request exists or not are reduced, the read-write performance of the server is improved, whether the overtime read-write request exists or not is determined only when the preset overtime duration is reached, and the read-write efficiency of the server is improved. And the frequency of determining whether the overtime read-write request exists or not is reduced.

Description

Technical Field

[0001] The present application relates to the field of data processing technology, and in particular to a request processing method, apparatus, computer equipment, storage medium and program product. Background Art

[0002] When the server performs read and write operations based on the received read and write requests, it needs to determine whether there are any read and write requests that have timed out. As hardware capabilities improve, the number of read and write operations per second that a single hardware can support is also gradually increasing. As the number of read and write operations per second increases, the number of operations to determine whether a read and write request has timed out is also gradually increasing.

[0003] In the conventional technology, when processing a read / write request, the method for determining whether the read / write request has timed out includes: determining the insertion position of the read / write request in real time after the read / write request enters a linked list, updating the front and back data structures of the removal position in real time after the read / write request is processed, and recording the read / write information of the read / write request in the form of a linked list, and then traversing the read / write information of the read / write request recorded in the form of a linked list to determine whether the read / write request has timed out.

[0004] However, the above method for processing read and write requests has the problem of reducing the read and write performance of the server. Summary of the invention

[0005] Based on this, it is necessary to provide a request processing method, device, computer equipment, storage medium and program product that can improve the read and write performance of the server in response to the above technical problems.

[0006] In a first aspect, the present application provides a request processing method, comprising:

[0007] When a read / write request is received, basic information of the read / write request is recorded in a first target array in a first queue; the first target array corresponds to the writing time of the read / write request;

[0008] When the preset timeout period is reached, it is determined whether there is a timed-out read / write request according to the amount of basic information contained in the array to be checked in the first queue.

[0009] In one embodiment, when a preset timeout period is reached, the method further includes:

[0010] Recording basic information of the read / write request in a second target array in the first queue; the second target array corresponds to the write time of the read / write request;

[0011] The array to be checked is determined according to the timeout duration, the recording duration of the first target array, and the position of the second target array in the first queue.

[0012] In one embodiment, determining the array to be checked according to the timeout duration, the recording duration of the first target array, and the position of the second target array in the first queue includes:

[0013] Determine the target quantity based on the ratio of the overtime duration to the recorded duration;

[0014] The array to be checked is determined according to the target quantity and the position of the second target array in the first queue.

[0015] In one embodiment, determining whether there is a timed read / write request according to the amount of basic information contained in the array to be checked in the first queue includes:

[0016] If the amount of basic information included in the array to be checked is the first value, it is determined that there is no timed read or write request;

[0017] If the amount of basic information contained in the array to be checked is a second value, it is determined that there is a timed-out read / write request.

[0018] In one embodiment, the method further comprises:

[0019] If it is determined that there is no timed read or write request, the timeout duration is updated according to the amount of basic information contained in the next array of the array to be checked.

[0020] In one embodiment, the method further comprises:

[0021] If it is determined that there is a timed-out read or write request, then one queue is selected from the candidate queues as a new first queue.

[0022] In one embodiment, the method further comprises:

[0023] If it is determined that there is a timed read or write request, multiple areas are divided in the local storage space; the area is used to record basic information of the next read or write request and indicate whether there is a timed read or write request according to the new timeout policy.

[0024] In one embodiment, determining whether there is a timed-out read or write request according to a new timeout policy includes:

[0025] When receiving the next read / write request, basic information of the next read / write request is recorded in the free target slots in the multiple zones;

[0026] When the timeout time corresponding to the target area where the target slot is located is reached, the basic information in all the slots in the target area is traversed, and it is determined whether there is a timeout according to the read and write requests corresponding to the traversed basic information.

[0027] In one embodiment, determining whether there is a timed read / write request according to the amount of basic information contained in the array to be checked in the first queue includes:

[0028] Determine the amount of basic information contained in the array to be checked according to the count value of the counter corresponding to the first queue;

[0029] Based on the amount of basic information, determine whether there is a timed-out read or write request.

[0030] In one embodiment, the method further comprises:

[0031] After recording the basic information of the read / write request in the first target array in the first queue, starting the counter to increase the preset value;

[0032] After the read / write request corresponding to any basic information recorded in the first target array is processed, the counter is started to decrease the preset value.

[0033] In a second aspect, the present application further provides a request processing device, including:

[0034] A receiving module, configured to record basic information of the read / write request in a first target array in a first queue upon receiving the read / write request; the first target array corresponds to a write time of the read / write request;

[0035] The determination module is used to determine whether there is a timed read or write request according to the amount of basic information contained in the array to be checked in the first queue when a preset timeout period is reached.

[0036] In a third aspect, the present application further provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the following steps are implemented:

[0037] When a read / write request is received, basic information of the read / write request is recorded in a first target array in a first queue; the first target array corresponds to the writing time of the read / write request;

[0038] When the preset timeout period is reached, it is determined whether there is a timed-out read / write request according to the amount of basic information contained in the array to be checked in the first queue.

[0039] In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the following steps are implemented:

[0040] When a read / write request is received, basic information of the read / write request is recorded in a first target array in a first queue; the first target array corresponds to the writing time of the read / write request;

[0041] When the preset timeout period is reached, it is determined whether there is a timed-out read / write request according to the amount of basic information contained in the array to be checked in the first queue.

[0042] In a fifth aspect, the present application further provides a computer program product, including a computer program, which implements the following steps when executed by a processor:

[0043] When a read / write request is received, basic information of the read / write request is recorded in a first target array in a first queue; the first target array corresponds to the writing time of the read / write request;

[0044] When the preset timeout period is reached, it is determined whether there is a timed-out read / write request according to the amount of basic information contained in the array to be checked in the first queue.

[0045] The above-mentioned request processing method, device, computer equipment, storage medium and program product, when receiving a read / write request, records the basic information of the read / write request in the first target array in the first queue, the first target array being an array corresponding to the write time of the read / write request, and further, when the preset timeout duration is reached, determines whether there is a timed read / write request according to the number of basic information contained in the array to be checked in the first queue. An ordered queue for recording the basic information of the read / write request is formed in the form of an array, so as to determine whether there is a timed read / write request according to the number of basic information in the array to be checked, without traversing all the basic information, reducing the processing resources required to determine whether there is a timed read / write request, improving the read / write performance of the server, and determining whether there is a timed read / write request only when the preset timeout duration is reached, reducing the frequency of determining whether there is a timed read / write request, further reducing the processing resources required to determine whether there is a timed read / write request, and improving the read / write performance of the server. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] In order to more clearly illustrate the technical solutions in the embodiments of the present application or related technologies, the drawings required for use in the embodiments of the present application or related technical descriptions will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0047] FIG1 is an application environment diagram of a request processing method in one embodiment;

[0048] FIG2 is a schematic diagram of a process flow of a request processing method in one embodiment;

[0049] FIG3 is a schematic diagram of a first queue in one embodiment;

[0050] FIG4 is a schematic diagram of a flow chart of a request processing method in another embodiment;

[0051] FIG5 is a schematic diagram of a flow chart of a request processing method in another embodiment;

[0052] FIG6 is a schematic diagram of a flow chart of a request processing method in another embodiment;

[0053] FIG7 is a schematic diagram of a flow chart of a request processing method in another embodiment;

[0054] FIG8 is a schematic diagram of a flow chart of a request processing method in another embodiment;

[0055] FIG9 is a schematic flow chart of a request processing method in another embodiment;

[0056] FIG10 is a schematic flow chart of a request processing method in another embodiment;

[0057] FIG11 is a schematic diagram of dividing multiple areas in one embodiment;

[0058] FIG12 is a schematic flow chart of a request processing method in another embodiment;

[0059] FIG13 is a schematic diagram of a flow chart of a request processing method in another embodiment;

[0060] FIG14 is a schematic flow chart of a request processing method in another embodiment;

[0061] FIG15 is a block diagram of a request processing device in one embodiment;

[0062] FIG. 16 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0063] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0064] When the server performs read and write operations based on the received read and write requests, it needs to determine whether there are any read and write requests that have timed out. As hardware capabilities improve, the number of read and write operations per second that a single hardware can support is also gradually increasing. As the number of read and write operations per second increases, the number of operations to determine whether a read and write request has timed out is also gradually increasing.

[0065] In traditional technology, since common timeouts have different timeout times and it is impossible to determine the actual order of completion, information is generally recorded in the form of a linked list. After the read / write request enters the server, the insertion position is determined in real time, and the data structure before and after the pull-out position is updated in real time after completion. The phenomenon of discontinuity of the access address of the linked list is more obvious. Each update requires modifying the predecessor and successor of the position to be updated. Since most of the addresses of the data corresponding to the read / write request are far apart, it is necessary to collide with multiple possibly discontinuous positions, making it difficult to achieve cache hits, turning data access into real data memory access, and increasing the use of processing resources. In addition, since there are few cases of timed-out read / write requests in the server, timeout judgment is meaningless for most scenarios, and only increases the execution time of the processor. However, timeout judgment is a necessary fault-tolerant process, so processor access with low timeout judgment can obtain more time for other processing operations, which can effectively improve system performance.

[0066] The request processing method provided in the embodiment of the present application can be applied in the application environment shown in Figure 1. Among them, the electronic device 102 communicates with the target server 104 through the network. The data storage system can store the data that the target server 104 needs to process. The data storage system can be integrated on the target server 104, or it can be placed on the cloud or other network servers. The target server 104 receives the read and write request sent by the electronic device 102. When the target server 104 receives the read and write request, the basic information of the read and write request is recorded in the first queue. Among them, the electronic device 102 can be a terminal or a server. The electronic device 102 can be, but is not limited to, various personal computers, laptops, smart phones, tablet computers, Internet of Things devices and portable wearable devices. The Internet of Things devices can be smart speakers, smart TVs, smart air conditioners, smart car devices, projection devices, etc. Portable wearable devices can be smart watches, smart bracelets, head-mounted devices, etc. The head mounted device may be a virtual reality (VR) device, an augmented reality (AR) device, smart glasses, etc.; the electronic device 102 may also be an independent physical server, a server cluster or a distributed system consisting of multiple physical servers, or a cloud server providing cloud computing services. The target server 104 may be an independent physical server, a server cluster or a distributed system consisting of multiple physical servers, or a cloud server providing cloud computing services.

[0067] In one embodiment, as shown in FIG. 2 , a request processing method is provided, which is described by taking the method applied to the target server in FIG. 1 as an example, and includes the following steps:

[0068] S201, when a read / write request is received, basic information of the read / write request is recorded in a first target array in a first queue; the first target array corresponds to a write time of the read / write request.

[0069] The basic information of the read / write request may include identification information of the read / write request, address information corresponding to the read / write request, and the like.

[0070] In an embodiment of the present application, all read and write requests can be classified into types according to the timeout duration of the read and write requests, so that a first queue can be pre-set for each type of read and write request. The first queue includes multiple arrays, and the multiple arrays are formed according to the time length corresponding to the first queue and the preset recording duration. The first queue can be used cyclically. When starting to accept read and write requests, the array at the starting position in the first queue is used as the target array, and the target array is updated once every interval recording duration. The first target array is the target array corresponding to the above read and write request when it is written. Optionally, the next array adjacent to the current target array can be updated as the target array every interval recording duration. Further, at the first moment, when a read and write request is received, the basic information of the read and write request is extracted, the current first target array is determined according to the write time of the read and write request, and the basic information of the read and write request is recorded in the first target array.

[0071] Exemplarily, the timeout period of a read or write request may be 60ms, the recording period may be 20ms, and the time length corresponding to the first queue may be 100ms. As shown in FIG3 , the first queue includes five arrays, namely, data 0, array 1, array 2, array 3, and array 4. When the time of receiving the read / write request is within the range of 0 to 20 ms after the start of receiving the read / write request, array 0 is used as the target array; when the time of receiving the read / write request is within the range of 20 ms to 40 ms after the start of receiving the read / write request, array 1 is used as the target array; when the time of receiving the read / write request is within the range of 40 ms to 60 ms after the start of receiving the read / write request, array 2 is used as the target array; when the time of receiving the read / write request is within the range of 60 ms to 80 ms after the start of receiving the read / write request, array 3 is used as the target array; when the time of receiving the read / write request is within the range of 80 ms to 100 ms after the start of receiving the read / write request, array 4 is used as the target array; further, the arrays in the first queue can be used cyclically, and when the time of receiving the read / write request is within the range of 100 ms to 120 ms after the start of receiving the read / write request, array 0 is used as the target array. For example, if the read / write request is received 10 ms after the start of receiving the read / write request, the first target array is array 0, and the basic information of the read / write request is recorded in array 0.

[0072] S202: When a preset timeout period is reached, determine whether there is a timed-out read / write request according to the amount of basic information contained in the array to be checked in the first queue.

[0073] In the embodiment of the present application, when the timeout period of the read / write request is reached, the array to be checked is determined according to the target array corresponding to the current moment, and whether there is a timed read / write request is determined according to the amount of basic information in the array to be checked. Optionally, the amount of basic information in the array to be checked can be determined by traversing each slot in the array to be checked.

[0074] Exemplarily, if the amount of basic information is greater than or equal to a preset threshold, it is determined that there is a timed-out read or write request; if the amount of basic information is less than the preset threshold, it is determined that there is no timed-out read or write request.

[0075] Optionally, if it is determined that there is a timed read / write request, the first queue stops recording basic information of the read / write request, releases the basic information of the timed read / write request in the first queue, and releases data of the timed read / write request in the memory.

[0076] In the above request processing method, when a read / write request is received, the basic information of the read / write request is recorded in the first target array in the first queue, and the first target array is an array corresponding to the write time of the read / write request. Furthermore, when the preset timeout period is reached, it is determined whether there is a timed read / write request based on the number of basic information contained in the array to be checked in the first queue. An ordered queue for recording the basic information of the read / write request is formed in the form of an array, so that it is determined whether there is a timed read / write request based on the number of basic information in the array to be checked, without traversing all the basic information, reducing the processing resources required to determine whether there is a timed read / write request, improving the read / write performance of the server, and determining whether there is a timed read / write request only when the preset timeout period is reached, reducing the frequency of determining whether there is a timed read / write request, further reducing the processing resources required to determine whether there is a timed read / write request, and improving the read / write performance of the server.

[0077] In one embodiment, as shown in FIG4 , the request processing method further includes:

[0078] S203, recording basic information of the read / write request in a second target array in the first queue; the second target array corresponds to the write time of the read / write request.

[0079] In an embodiment of the present application, at the second moment, when a read / write request is received, basic information of the read / write request is extracted, the current second target array is determined according to the write time of the read / write request, and the basic information of the read / write request is recorded in the second target array. Exemplarily, the timeout of the read / write request can be 60ms, the recording time is 20ms, and the time length corresponding to the first queue is 100ms. As shown in FIG3 , the first queue includes 5 arrays, and the 5 data are data 0, array 1, array 2, array 3, and array 4. When the time of receiving the read / write request is within the range of 0 to 20ms after the start of accepting the read / write request, array 0 is used as the target array; when the time of receiving the read / write request is within the range of 20ms to 40ms after the start of accepting the read / write request, array 1 is used as the target array; when the time of receiving the read / write request is within the range of 40ms to 60ms after the start of accepting the read / write request, array 2 is used as the target array; when the time of receiving the read / write request is within the range of 60ms to 80ms after the start of receiving the read / write request, array 3 is used as the target array; when the time of receiving the read / write request is within the range of 80ms to 100ms after the start of receiving the read / write request, array 4 is used as the target array; for example, when the read / write request is received 70ms after the start of receiving the read / write request, the second target array is array 3, and the basic information of the read / write request is recorded in array 3.

[0080] S204, determining the array to be checked according to the timeout duration, the recording duration of the first target array, and the position of the second target array in the first queue.

[0081] Optionally, the candidate area to be checked in the first queue can be determined based on the timeout duration and the position of the second target array in the first queue. For example, the area that is before the second target array and has a corresponding time length of the timeout duration is determined as the candidate area. Further, the candidate area is divided into multiple sub-areas based on the recording time of the first target array, and the array in the sub-area that is at the front of the candidate area is determined as the array to be checked.

[0082] The request processing method provided in the embodiment of the present application determines the array to be checked according to the timeout duration, the recording duration of the first target array, and the position of the second target array in the first queue, and determines the corresponding array to be checked according to the current second target array, thereby improving the accuracy of the array to be checked, reducing the traversal process, and improving the read and write performance of the server.

[0083] In one embodiment, an implementation of the above S204 is provided, as shown in FIG5 , wherein the above “determining the array to be checked according to the timeout duration, the recording duration of the first target array, and the position of the second target array in the first queue” includes:

[0084] S301, determining a target quantity according to a ratio of a timeout duration to a recording duration.

[0085] In an embodiment of the present application, the array to be checked is the first array to time out, that is, the array to be checked is the array that first arrives at or has reached the timeout moment among all current arrays. If there is no timed-out read or write request in the first timed-out array, then there is no timed-out read or write request in the remaining arrays at the current moment. The recording duration of each array in the first queue is the same, and the ratio of the timeout duration to the recording duration is determined as the target number.

[0086] Exemplarily, if the timeout duration is 60 ms, the recording duration is 20 ms, and the ratio of the timeout duration to the recording duration is 3, then the target number is 3.

[0087] S302, determining the array to be checked according to the target quantity and the position of the second target array in the first queue.

[0088] In an embodiment of the present application, the difference between the position of the second target array in the first queue and the target number is determined, and the difference is the position of the array to be checked in the first queue; or, the position from the second target array in the first queue to the target number forward is determined as the array to be checked.

[0089] Exemplarily, as shown in FIG3 , if the second target array is array 3 and the target quantity is 3, the array to be checked is array 0; if the second target array is array 1 and the target quantity is 3, the array to be checked is array 3.

[0090] The request processing method provided in the embodiment of the present application determines the target number by the ratio of the timeout duration to the recording duration, and thus determines the array to be checked according to the target number and the position of the second array in the first queue. There is no need to record the timeout duration corresponding to each array, thus saving storage resources. The array to be checked can be determined only based on the array corresponding to the read and write request at the current moment and the recording duration, thereby ensuring the accuracy of the array to be checked and improving the read and write performance of the server.

[0091] In one embodiment, an implementation of the above S202 is provided, as shown in FIG6 , wherein the above “determining whether there is a timed read / write request according to the amount of basic information included in the array to be checked in the first queue” includes:

[0092] S401, determine the number of basic information contained in the array to be checked, if it is a first value, execute S402; if it is a second value, execute S403.

[0093] S402: Determine that there is no timed-out read or write request.

[0094] S403: Determine whether there is a timed-out read or write request.

[0095] In the embodiment of the present application, the amount of basic information contained in the array to be checked is determined. For example, each slot in the array to be checked can be traversed. If the slot is empty, the corresponding value can be 0, and if the slot is not empty, the corresponding value can be 1. The sum of the values ​​corresponding to each slot is determined, and the sum of the values ​​is the amount of basic information contained in the array to be checked. Further, if the amount of basic information contained in the array to be checked is the first value, it is determined that there is no timed read or write request; if the amount of basic information contained in the array to be checked is the second value, it is determined that there is a timed read or write request.

[0096] Exemplarily, the first value can be 0, and the second value can be any non-zero value. If the number of basic information contained in the array to be checked is 0, it is determined that there is no timed read or write request; if the number of basic information contained in the array to be checked is not 0, it is determined that there is a timed read or write request.

[0097] The request processing method provided in the embodiment of the present application determines whether there is a timed read or write request based on whether the number of basic information contained in the array to be checked is a first value or a second value. The judgment method is simple and error-prone and requires fewer processing resources, so that more resources in the server are used to process read and write requests, thereby improving the read and write performance of the server.

[0098] In one embodiment, as shown in FIG7 , the request processing method further includes:

[0099] S404: If it is determined that there is no timed read or write request, the timeout duration is updated according to the amount of basic information contained in the next array of the array to be checked.

[0100] In an embodiment of the present application, if there is no timed-out read or write request in the array to be checked, the number of basic information contained in the next array of the data to be checked is determined. If the number of basic information contained in the next array is the second value, the timeout duration is not updated; if the number of basic information contained in the next array is the first value, and the number of basic information contained in the next array of the next array is the second value, the sum of the timeout duration and the record duration is determined, and the sum of the timeout duration and the record duration is used as the new timeout duration of the first queue; if the number of basic information contained in the next array is the first value, and the number of basic information contained in the next array of the next array is the first value, the number of basic information contained in the next array continues to be determined until the number is the second value, and the timeout duration of the first queue is updated according to the difference between the number of arrays containing the first value of basic information and 1 and the record duration.

[0101] Exemplarily, the timeout duration can be 60ms, the recording duration can be 20ms, the first value can be 0, and the second value can be any non-zero value. As shown in Figure 3, if the array to be checked is array 0, the number of basic information contained in array 1 is 0, the number of basic information contained in array 2 is 0, and the number of basic information contained in array 3 is not 0, then the updated timeout duration is 60ms+20ms×2=100ms.

[0102] Optionally, as shown in FIG8 , the request processing method further includes:

[0103] S405: If it is determined that there is a timed read or write request, select any queue from the candidate queues as a new first queue.

[0104] In the embodiment of the present application, for each type of read / write request, the candidate queue includes multiple queues with the same structure as the first queue. If it is determined that there is a timed read / write request, the first queue stops recording the basic information of the read / write request, and any queue from the candidate queue is selected as the new first queue to continue recording the basic information of the read / write request. After the basic information corresponding to the timed-out request in the original first queue is released and all the read / write requests corresponding to the original first queue are processed, the original first queue is used as the candidate queue.

[0105] The request processing method provided in the embodiment of the present application updates the timeout period according to the number of basic information contained in the next array of the array to be checked, thereby increasing the timeout period of the first queue, reducing the frequency of determining whether there are timed-out read and write requests in the first queue, saving processing resources, and further improving the read and write performance of the server.

[0106] In one embodiment, as shown in FIG9 , the request processing method further includes:

[0107] S406, if it is determined that there is a timed read / write request, multiple areas are divided in the local storage space; the area is used to record basic information of the next read / write request and indicate whether there is a timed read / write request according to the new timeout policy.

[0108] In an embodiment of the present application, if it is determined that there is a timed read or write request, multiple areas are divided in the local storage space, each area includes multiple slots, and basic information of read or write requests with various timeout periods can be recorded in the multiple areas. When the server receives the next read or write request, the basic information of the read or write request is randomly recorded in the free slots in the multiple areas.

[0109] Optionally, the new timeout policy may preset a duration for each interval, traverse the slots in each area respectively, and determine whether the read and write requests corresponding to each area have timed out.

[0110] Optionally, as shown in FIG10 , the “determining whether there is a timed-out read or write request according to a new timeout policy” includes:

[0111] S501, when receiving a next read / write request, basic information of the next read / write request is recorded in idle target slots in multiple zones.

[0112] In the embodiment of the present application, when the next read / write request is received, any free slot in multiple areas is selected as the target slot, and basic information of the next read / write request is recorded in the target slot.

[0113] S502, when the timeout time corresponding to the target area where the target slot is located is reached, traverse the basic information in all the slots in the target area, and determine whether there is a timeout according to the read and write requests corresponding to the traversed basic information.

[0114] In an embodiment of the present application, the preset time lengths corresponding to each area may be different. For example, as shown in Figure 11, multiple areas may include area 1, area 2 and area 3. The preset time length corresponding to area 1 is preset time length 1, the preset time length corresponding to area 2 is preset time length 2, and the preset time length corresponding to area 3 is preset time length 3.

[0115] Optionally, the basic information may include the timeout of the read / write request, and for each region, the earliest timeout among the timeouts of all read / write requests contained in the region is used as the timeout of the region. Furthermore, the multiple regions may be multiple regions in the cache space, and when there are timed read / write requests in the read / write requests corresponding to a certain region, all read / write requests corresponding to the region are read from the storage space based on the basic information in the region, so that the timed read / write requests can be determined in the cache, thereby improving the efficiency of determining the timed read / write requests.

[0116] The request processing method provided in the embodiment of the present application divides the local storage space into multiple areas and records the basic information of a read or write request. That is, when the first queue is unavailable, the basic information of the read or write request is recorded through multiple areas, thereby improving the fault tolerance for timed read or write requests. While the out-of-order management saves storage space, processing resources are saved through partition management.

[0117] In one embodiment, an implementation of the above S203 is provided, as shown in FIG12 , wherein the above “determining whether there is a timed read / write request according to the amount of basic information included in the array to be checked in the first queue” includes:

[0118] S601, determining the amount of basic information contained in the array to be checked according to the count value of the counter corresponding to the first queue.

[0119] Optionally, each array in the first queue may share a counter, or each array in the first queue corresponds to a counter. Optionally, the counter may determine the amount of basic information contained in the array to be checked by counting the free slots in the array to be checked.

[0120] Optionally, as shown in FIG13 , the request processing method may further include:

[0121] S205 , after recording the basic information of the read / write request in the first target array in the first queue, start the counter to increase the preset value.

[0122] S206, after the read / write request corresponding to any basic information recorded in the first target array is processed, start the counter to reduce the preset value.

[0123] In an embodiment of the present application, the counter determines the amount of basic information contained in each array by writing and writing the basic information. Exemplarily, the preset value can be 1. When the basic information of the read / write request is recorded in the target array, the count value of the array in the counter increases by 1. When the read / write request is processed, the count value of the array corresponding to the read / write request decreases by 1.

[0124] S602: Determine whether there is a timed-out read or write request based on the amount of basic information.

[0125] Optionally, in an embodiment of the present application, if the number of basic information contained in the array to be checked is a first value, it is determined that there is no timed read or write request; if the number of basic information contained in the array to be checked is a second value, it is determined that there is a timed read or write request.

[0126] Exemplarily, the first value can be 0, and the second value can be any non-zero value. If the number of basic information contained in the array to be checked is 0, it is determined that there is no timed read or write request; if the number of basic information contained in the array to be checked is not 0, it is determined that there is a timed read or write request.

[0127] The request processing method provided in the embodiment of the present application determines the amount of basic information contained in the array to be checked through a counter. The counter has a faster working speed, and all triggers in the counter receive the same clock signal, which ensures the synchronization of state changes and improves the overall speed and efficiency.

[0128] In one embodiment, a complete request processing method is also provided, as shown in FIG14 , including:

[0129] S1, when a read / write request is received, basic information of the read / write request is recorded in a first target array in a first queue; the first target array corresponds to the writing time of the read / write request.

[0130] S2, after recording the basic information of the read / write request in the first target array in the first queue, start the counter to increase the preset value.

[0131] S3, after the read / write request corresponding to any basic information recorded in the first target array is processed, start the counter to reduce the preset value.

[0132] S4, recording basic information of the read / write request in a second target array in the first queue; the second target array corresponds to the write time of the read / write request.

[0133] S5, determining the target quantity according to the ratio of the timeout duration to the recording duration.

[0134] S6, determining the array to be checked according to the target quantity and the position of the second target array in the first queue.

[0135] S7, determining the amount of basic information contained in the array to be checked according to the count value of the counter corresponding to the first queue.

[0136] S8, if the amount of basic information contained in the array to be checked is a first value, execute S9-S10; if the amount of basic information contained in the array to be checked is a second value, execute S10-S15.

[0137] S9, determine that there is no timed-out read or write request.

[0138] S10, updating the timeout duration according to the amount of basic information contained in the next array of the array to be checked.

[0139] S11, determining that there is a timed-out read or write request.

[0140] S12, select any one queue from the candidate queues as a new first queue.

[0141] S13, divide the local storage space into multiple areas; the areas are used to record basic information of the next read / write request.

[0142] S14, when receiving the next read / write request, recording basic information of the next read / write request in the idle target slots in the multiple zones.

[0143] S15, when the timeout time corresponding to the target area where the target slot is located is reached, traverse the basic information in all the slots in the target area, and determine whether there is a timeout according to the read and write requests corresponding to the traversed basic information.

[0144] In the above request processing method, when a read / write request is received, the basic information of the read / write request is recorded in the first target array in the first queue, and the first target array is an array corresponding to the write time of the read / write request. Furthermore, when the preset timeout period is reached, it is determined whether there is a timed read / write request based on the number of basic information contained in the array to be checked in the first queue. An ordered queue for recording the basic information of the read / write request is formed in the form of an array, so that it is determined whether there is a timed read / write request based on the number of basic information in the array to be checked, without traversing all the basic information, reducing the processing resources required to determine whether there is a timed read / write request, improving the read / write performance of the server, and determining whether there is a timed read / write request only when the preset timeout period is reached, reducing the frequency of determining whether there is a timed read / write request, further reducing the processing resources required to determine whether there is a timed read / write request, and improving the read / write performance of the server.

[0145] It should be understood that, although the various steps in the flowcharts involved in the above-mentioned embodiments are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps does not have a strict order restriction, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above-mentioned embodiments can include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.

[0146] Based on the same inventive concept, the embodiment of the present application also provides a request processing device for implementing the request processing method involved above. The implementation solution provided by the device to solve the problem is similar to the implementation solution recorded in the above method, so the specific limitations in one or more request processing device embodiments provided below can refer to the limitations on the request processing method above, and will not be repeated here.

[0147] In one embodiment, as shown in FIG15 , a request processing device is provided, including: a receiving module 10 and a first determining module 11, wherein:

[0148] The receiving module 10 is used to record basic information of the read / write request in a first target array in a first queue when receiving the read / write request; the first target array corresponds to the writing time of the read / write request.

[0149] The first determination module 11 is used to determine whether there is a timed-out read / write request according to the amount of basic information contained in the array to be checked in the first queue when a preset timeout duration is reached.

[0150] In one embodiment, the request processing device further includes: a recording module and a second determining module, wherein:

[0151] The recording module is used to record basic information of the read / write request in the second target array in the first queue; the second target array corresponds to the writing time of the read / write request.

[0152] The second determination module is used to determine the array to be checked according to the timeout duration, the recording duration of the first target array, and the position of the second target array in the first queue.

[0153] In one embodiment, the second determination module includes: a first determination unit and a second determination unit, wherein:

[0154] The first determining unit is used to determine the target quantity according to the ratio of the timeout duration to the recording duration.

[0155] The second determining unit is used to determine the array to be checked according to the target quantity and the position of the second target array in the first queue.

[0156] In one embodiment, the first determining module includes: a third determining unit and a fourth determining unit, wherein:

[0157] The third determining unit is configured to determine that there is no timed read or write request when the amount of basic information included in the array to be checked is a first value.

[0158] The fourth determining unit is used to determine whether there is a timed-out read or write request when the number of basic information included in the array to be checked is a second value.

[0159] In one embodiment, the first determination module further includes: an updating unit, which is used to update the timeout duration according to the amount of basic information contained in the next array of the array to be checked when it is determined that there is no timed read or write request.

[0160] In one embodiment, the first determination module further includes: a selection unit, configured to select any one of the candidate queues as a new first queue when it is determined that there is a timed read or write request.

[0161] In one embodiment, the above-mentioned first determination module also includes: a fifth determination unit, which is used to divide the local storage space into multiple areas when it is determined that there is a timed read or write request; the area is used to record the basic information of the next read or write request, and indicate whether there is a timed read or write request based on the new timeout policy.

[0162] In one embodiment, the fifth determination unit is specifically used to record the basic information of the next read / write request in the idle target slots in multiple areas when the next read / write request is received; when the timeout time corresponding to the target area where the target slot is located is reached, traverse the basic information in all the slots in the target area, and determine whether there is a timeout based on the read / write request corresponding to the traversed basic information.

[0163] In one embodiment, the first determining module includes: a sixth determining unit and a seventh determining unit, wherein:

[0164] The sixth determining unit is used to determine the amount of basic information contained in the array to be checked according to the count value of the counter corresponding to the first queue.

[0165] The seventh determination unit is used to determine whether there is a timed read or write request according to the amount of basic information.

[0166] In one embodiment, the request processing device further includes: a first startup module and a second startup module, wherein:

[0167] The first starting module is used to start the counter to increase a preset value after recording basic information of the read and write request in the first target array in the first queue.

[0168] The second starting module is used to start the counter to reduce a preset value after the read and write request corresponding to any basic information recorded in the first target array is processed.

[0169] Each module in the above request processing device can be implemented in whole or in part by software, hardware or a combination thereof. Each module can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute operations corresponding to each module.

[0170] In one embodiment, a computer device is provided, which may be a server, and its internal structure diagram may be shown in FIG16. The computer device includes a processor, a memory, an input / output interface (Input / Output, referred to as I / O) and a communication interface. The processor, the memory and the input / output interface are connected via a system bus, and the communication interface is connected to the system bus via the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store request processing data. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal via a network connection. When the computer program is executed by the processor, a request processing method is implemented.

[0171] Those skilled in the art will understand that the structure shown in FIG. 16 is merely a block diagram of a partial structure related to the scheme of the present application, and does not constitute a limitation on the computer device to which the scheme of the present application is applied. The specific computer device may include more or fewer components than shown in the figure, or combine certain components, or have a different arrangement of components.

[0172] In one embodiment, a computer device is provided, including a memory and a processor, wherein a computer program is stored in the memory, and when the processor executes the computer program, the following steps are implemented:

[0173] When a read / write request is received, basic information of the read / write request is recorded in a first target array in a first queue; the first target array corresponds to the writing time of the read / write request;

[0174] When the preset timeout period is reached, it is determined whether there is a timed-out read / write request according to the amount of basic information contained in the array to be checked in the first queue.

[0175] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0176] Recording basic information of the read / write request in a second target array in the first queue; the second target array corresponds to the write time of the read / write request;

[0177] The array to be checked is determined according to the timeout duration, the recording duration of the first target array, and the position of the second target array in the first queue.

[0178] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0179] Determine the target quantity based on the ratio of the overtime duration to the recorded duration;

[0180] The array to be checked is determined according to the target quantity and the position of the second target array in the first queue.

[0181] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0182] If the amount of basic information included in the array to be checked is the first value, it is determined that there is no timed read or write request;

[0183] If the amount of basic information contained in the array to be checked is a second value, it is determined that there is a timed-out read / write request.

[0184] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0185] If it is determined that there is no timed read or write request, the timeout duration is updated according to the amount of basic information contained in the next array of the array to be checked.

[0186] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0187] If it is determined that there is a timed-out read or write request, then one queue is selected from the candidate queues as a new first queue.

[0188] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0189] If it is determined that there is a timed read or write request, multiple areas are divided in the local storage space; the area is used to record basic information of the next read or write request and indicate whether there is a timed read or write request according to the new timeout policy.

[0190] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0191] When receiving the next read / write request, basic information of the next read / write request is recorded in the free target slots in the multiple zones;

[0192] When the timeout time corresponding to the target area where the target slot is located is reached, the basic information in all the slots in the target area is traversed, and it is determined whether there is a timeout according to the read and write requests corresponding to the traversed basic information.

[0193] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0194] Determine the amount of basic information contained in the array to be checked according to the count value of the counter corresponding to the first queue;

[0195] Based on the amount of basic information, determine whether there is a timed-out read or write request.

[0196] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0197] After recording the basic information of the read / write request in the first target array in the first queue, starting the counter to increase the preset value;

[0198] After the read / write request corresponding to any basic information recorded in the first target array is processed, the counter is started to decrease the preset value.

[0199] In one embodiment, a computer readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the following steps are implemented:

[0200] When a read / write request is received, basic information of the read / write request is recorded in a first target array in a first queue; the first target array corresponds to the writing time of the read / write request;

[0201] When the preset timeout period is reached, it is determined whether there is a timed-out read / write request according to the amount of basic information contained in the array to be checked in the first queue.

[0202] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0203] Recording basic information of the read / write request in a second target array in the first queue; the second target array corresponds to the write time of the read / write request;

[0204] The array to be checked is determined according to the timeout duration, the recording duration of the first target array, and the position of the second target array in the first queue.

[0205] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0206] Determine the target quantity based on the ratio of the overtime duration to the recorded duration;

[0207] The array to be checked is determined according to the target quantity and the position of the second target array in the first queue.

[0208] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0209] If the amount of basic information included in the array to be checked is the first value, it is determined that there is no timed read or write request;

[0210] If the amount of basic information contained in the array to be checked is a second value, it is determined that there is a timed-out read / write request.

[0211] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0212] If it is determined that there is no timed read or write request, the timeout duration is updated according to the amount of basic information contained in the next array of the array to be checked.

[0213] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0214] If it is determined that there is a timed-out read or write request, then one queue is selected from the candidate queues as a new first queue.

[0215] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0216] If it is determined that there is a timed read or write request, multiple areas are divided in the local storage space; the area is used to record basic information of the next read or write request and indicate whether there is a timed read or write request according to the new timeout policy.

[0217] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0218] When receiving the next read / write request, basic information of the next read / write request is recorded in the free target slots in the multiple zones;

[0219] When the timeout time corresponding to the target area where the target slot is located is reached, the basic information in all the slots in the target area is traversed, and it is determined whether there is a timeout according to the read and write requests corresponding to the traversed basic information.

[0220] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0221] Determine the amount of basic information contained in the array to be checked according to the count value of the counter corresponding to the first queue;

[0222] Based on the amount of basic information, determine whether there is a timed-out read or write request.

[0223] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0224] After recording the basic information of the read / write request in the first target array in the first queue, starting the counter to increase the preset value;

[0225] After the read / write request corresponding to any basic information recorded in the first target array is processed, the counter is started to decrease the preset value.

[0226] In one embodiment, a computer program product is provided, comprising a computer program, which, when executed by a processor, implements the following steps:

[0227] When a read / write request is received, basic information of the read / write request is recorded in a first target array in a first queue; the first target array corresponds to the writing time of the read / write request;

[0228] When the preset timeout period is reached, it is determined whether there is a timed-out read / write request according to the amount of basic information contained in the array to be checked in the first queue.

[0229] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0230] Recording basic information of the read / write request in a second target array in the first queue; the second target array corresponds to the write time of the read / write request;

[0231] The array to be checked is determined according to the timeout duration, the recording duration of the first target array, and the position of the second target array in the first queue.

[0232] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0233] Determine the target quantity based on the ratio of the overtime duration to the recorded duration;

[0234] The array to be checked is determined according to the target quantity and the position of the second target array in the first queue.

[0235] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0236] If the amount of basic information included in the array to be checked is the first value, it is determined that there is no timed read or write request;

[0237] If the amount of basic information contained in the array to be checked is a second value, it is determined that there is a timed-out read / write request.

[0238] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0239] If it is determined that there is no timed read or write request, the timeout duration is updated according to the amount of basic information contained in the next array of the array to be checked.

[0240] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0241] If it is determined that there is a timed-out read or write request, then one queue is selected from the candidate queues as a new first queue.

[0242] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0243] If it is determined that there is a timed read or write request, multiple areas are divided in the local storage space; the area is used to record basic information of the next read or write request and indicate whether there is a timed read or write request according to the new timeout policy.

[0244] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0245] When receiving the next read / write request, basic information of the next read / write request is recorded in the free target slots in the multiple zones;

[0246] When the timeout time corresponding to the target area where the target slot is located is reached, the basic information in all the slots in the target area is traversed, and it is determined whether there is a timeout according to the read and write requests corresponding to the traversed basic information.

[0247] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0248] Determine the amount of basic information contained in the array to be checked according to the count value of the counter corresponding to the first queue;

[0249] Based on the amount of basic information, determine whether there is a timed-out read or write request.

[0250] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0251] After recording the basic information of the read / write request in the first target array in the first queue, starting the counter to increase the preset value;

[0252] After the read / write request corresponding to any basic information recorded in the first target array is processed, the counter is started to decrease the preset value.

[0253] A person of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment method can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, an artificial intelligence (AI) processor, etc., but are not limited to this.

[0254] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.

[0255] The above-described embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present application. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.

Claims

1. A request processing method, characterized in that: The method comprises: When a read / write request is received, basic information of the read / write request is recorded in a first target array in a first queue; the first target array corresponds to a write time of the read / write request; When the preset timeout period is reached, it is determined whether there is a timed-out read or write request based on the number of basic information contained in the array to be checked in the first queue.

2. The method according to claim 1, characterized in that When the preset timeout period is reached, the method further includes: Recording basic information of the read / write request in a second target array in the first queue; the second target array corresponds to the write time of the read / write request; The array to be checked is determined according to the timeout duration, the recording duration of the first target array, and the position of the second target array in the first queue.

3. The method according to claim 2, characterized in that The determining the array to be checked according to the timeout duration, the recording duration of the first target array, and the position of the second target array in the first queue includes: Determining a target quantity according to a ratio of the timeout duration to the recording duration; The array to be checked is determined according to the target quantity and the position of the second target array in the first queue.

4. The method according to any one of claims 1 to 3, characterized in that: The determining whether there is a timed read / write request according to the number of the basic information contained in the array to be checked in the first queue includes: If the number of the basic information included in the array to be checked is a first value, determining that there is no timed read or write request; If the number of the basic information included in the array to be checked is a second value, it is determined that there is a timed-out read / write request.

5. The method according to claim 4, characterized in that The method further comprises: If it is determined that there is no timed read or write request, the timeout duration is updated according to the amount of basic information contained in the next array of the array to be checked.

6. The method according to claim 4, characterized in that The method further comprises: If it is determined that there is a timed-out read or write request, then one queue is selected from the candidate queues as a new first queue.

7. The method according to claim 4, characterized in that The method further comprises: If it is determined that there is a timed read or write request, multiple areas are divided in the local storage space; the areas are used to record basic information of the next read or write request and indicate whether there is a timed read or write request according to the new timeout policy.

8. The method according to claim 7, characterized in that Determining whether there is a timed read or write request according to the new timeout policy includes: When receiving the next read / write request, recording basic information of the next read / write request in the idle target slots in the multiple areas; When the timeout time corresponding to the target area where the target slot is located is reached, the basic information in all the slots in the target area is traversed, and it is determined whether there is a timeout according to the read and write requests corresponding to the traversed basic information.

9. The method according to claim 1, characterized in that: Determining whether there is a timed read or write request according to the number of basic information contained in the array to be checked in the first queue includes: Determine the amount of the basic information contained in the array to be checked according to the count value of the counter corresponding to the first queue; It is determined whether there is a timed-out read or write request according to the amount of the basic information.

10. The method according to claim 1, characterized in that The method further comprises: After recording the basic information of the read / write request in the first target array in the first queue, starting the counter to increase the preset value; After the read / write request corresponding to any basic information recorded in the first target array is processed, the counter is started to decrease the preset value.

11. A request processing device, characterized in that: The device comprises: A receiving module, configured to record basic information of a read / write request in a first target array in a first queue upon receiving the read / write request; the first target array corresponds to a writing time of the read / write request; The first determination module is used to determine whether there is a timed-out read or write request according to the number of basic information contained in the array to be checked in the first queue when a preset timeout period is reached.

12. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 10 are implemented.

13. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 10 are implemented.

14. A computer program product comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 10 are implemented.

Images