CN114785739A - Method, device, equipment and medium for controlling service quality of logical volume - Google Patents

Method, device, equipment and medium for controlling service quality of logical volume Download PDF

Info

Publication number
CN114785739A
CN114785739A CN202210430473.XA CN202210430473A CN114785739A CN 114785739 A CN114785739 A CN 114785739A CN 202210430473 A CN202210430473 A CN 202210430473A CN 114785739 A CN114785739 A CN 114785739A
Authority
CN
China
Prior art keywords
logical volume
service request
target logical
preset
token
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202210430473.XA
Other languages
Chinese (zh)
Inventor
韩勇
刘立黎
康撼宇
吴瑞强
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tianjin Zhongke Shuguang Storage Technology Co ltd
Original Assignee
Tianjin Zhongke Shuguang Storage Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Tianjin Zhongke Shuguang Storage Technology Co ltd filed Critical Tianjin Zhongke Shuguang Storage Technology Co ltd
Priority to CN202210430473.XA priority Critical patent/CN114785739A/en
Publication of CN114785739A publication Critical patent/CN114785739A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/215—Flow control; Congestion control using token-bucket
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/22—Traffic shaping
    • H04L47/225—Determination of shaping rate, e.g. using a moving window
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/6215—Individual queue per QOS, rate or priority
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/78—Architectures of resource allocation
    • H04L47/783—Distributed allocation of resources, e.g. bandwidth brokers

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a method, a device, equipment and a medium for controlling the service quality of a logical volume, wherein the method comprises the following steps: when a current service request for a target logical volume is received, if the target logical volume is determined to have no unprocessed historical service request, acquiring the number of processed service requests of a sliding window corresponding to the target logical volume in a current sliding period; then when the processed service request quantity is determined to meet the preset service request quantity detection condition, sending a token acquisition request to a token bucket corresponding to the target logical volume; and when the token is detected to be successfully acquired, executing the current service request based on a plurality of storage nodes corresponding to the target logical volume. According to the technical scheme of the embodiment, by combining the sliding window and the token bucket, the tolerance capability to the burst service flow can be improved while the current limiting and the current stabilizing are realized, so that the service quality of the distributed storage system can be improved.

Description

Method, device, equipment and medium for controlling service quality of logical volume
Technical Field
The embodiment of the invention relates to the technical field of computers, in particular to a method, a device, equipment and a medium for controlling the service quality of a logical volume.
Background
QoS (Quality of Service) refers to the ability of a network to provide better Service capabilities for a given network communication using various underlying technologies. In the storage field, QoS means that input/output data streams can be assigned according to weights according to storage system configuration, so as to improve the service quality of the storage system to meet application needs.
Currently, for QoS control of distributed storage, different QoS policies are usually set for different logical volumes on a logical volume basis, so as to implement quality of service management on storage resources. The existing QoS control method mainly comprises a token bucket method and a leaky bucket method; however, for the token bucket method, the current limiting effect for the burst traffic is poor, and for the leaky bucket method, because the traffic processing speed is constant, there are a lot of traffic request processing failures when facing the burst traffic. Therefore, it is difficult to improve the service quality of the distributed storage system based on the prior art.
Disclosure of Invention
Embodiments of the present invention provide a method, an apparatus, a device, and a medium for controlling service quality of a logical volume, which can improve tolerance to burst traffic while implementing current limiting and current stabilizing, so as to improve service quality of a distributed storage system.
In a first aspect, an embodiment of the present invention provides a method for controlling quality of service of a logical volume, including:
when a current service request for a target logical volume is received, if it is determined that the target logical volume does not have unprocessed historical service requests, acquiring the number of processed service requests of a sliding window corresponding to the target logical volume in a current sliding period;
judging whether the number of the processed service requests of the sliding window corresponding to the target logical volume in the current sliding period meets a preset service request number detection condition, if so, sending a token acquisition request to a token bucket corresponding to the target logical volume;
and when the token is successfully acquired, executing the current service request based on at least one storage node corresponding to the target logical volume.
Optionally, before executing the current service request based on the at least one storage node corresponding to the target logical volume, the method further includes:
and adding the current service request to a service request cache queue corresponding to a preset leaky bucket, and processing each service request in the service request cache queue corresponding to the preset leaky bucket according to a preset service request processing speed.
By adopting the technical scheme, the situation that the service processing pressure exceeds the bearable range of the storage pool due to the fact that the service requests corresponding to the logic volumes are directly sent to the storage pool can be avoided, so that the probability of service request failure processing can be reduced, and the service quality of the distributed storage system can be improved.
Optionally, before processing each service request in the service request buffer queue corresponding to the preset leaky bucket according to the processing speed of the preset service request, the method further includes:
acquiring service request processing performance matched with the storage pool corresponding to the preset leaky bucket, and setting the processing speed of the preset service request corresponding to the preset leaky bucket according to the service request processing performance;
the preset leaky buckets are in one-to-one correspondence with the storage pool, and the storage pool comprises at least one storage node.
By adopting the technical scheme, the setting accuracy of the processing speed of the preset service request can be improved, the probability of failure processing of the service request can be further reduced, and the stability of the distributed storage system can be improved.
Optionally, the technical solution of the embodiment of the present invention further includes:
judging whether the number of tokens in a token bucket corresponding to the target logical volume is greater than or equal to a preset token number threshold value or not every preset time interval;
if not, adding tokens with a preset quantity into the token bucket corresponding to the target logical volume.
By adopting the technical scheme, the token in the token bucket can be supplemented in real time, so that the processing efficiency of the service request can be ensured, the condition of failed processing of the service request caused by lack of the token can be avoided, and the successful processing probability of the service request can be improved.
Optionally, the obtaining the number of processed service requests of the sliding window corresponding to the target logical volume in the current sliding period includes:
acquiring at least one sub-window of a sliding window corresponding to the target logical volume in a current sliding period according to the length of a preset sub-window;
acquiring the number of processed service requests corresponding to each sub-window through a preset request counter corresponding to each sub-window;
and acquiring the number of the processed service requests of the sliding window corresponding to the target logical volume in the current sliding period according to the number of the processed service requests corresponding to each sub-window.
By adopting the technical scheme, the processed service request number corresponding to each sub-window in the sliding window can be accurately obtained, the tolerance capacity to the fluctuation of the service request number can be improved, and the control accuracy to the service request processing can be improved.
Optionally, after receiving the current service request for the target logical volume, the method further includes:
if the target logical volume is determined to have unprocessed historical service requests, adding the current service request to a service request cache queue corresponding to the target logical volume, and waiting for all the historical service requests in the service request cache queue corresponding to the target logical volume to be processed.
By adopting the scheme, the probability of service request failure processing can be further reduced, the tolerance capacity to a large number of burst service requests can be improved, the stability of the distributed storage system can be further improved, and the service quality of the distributed storage system can be further improved.
Optionally, after sending the token obtaining request to the token bucket corresponding to the target logical volume, the method further includes:
if the token is not successfully acquired, when the sliding window corresponding to the target logical volume is detected to start sliding towards the preset direction, the token acquisition request is sent to the token bucket corresponding to the target logical volume again until the token issued by the token bucket corresponding to the target logical volume is successfully acquired; and sliding a sliding window corresponding to the target logical volume to a preset direction at preset time intervals by a preset step length.
By adopting the scheme, the sending times of the invalid token obtaining request can be reduced, and the probability of successfully obtaining the token can be improved.
In a second aspect, an embodiment of the present invention further provides a device for controlling quality of service of a logical volume, including:
the device comprises a processed service request quantity obtaining module, a service processing module and a service processing module, wherein the processed service request quantity obtaining module is used for obtaining the processed service request quantity of a sliding window corresponding to a target logical volume in a current sliding period if the target logical volume is determined to have no unprocessed historical service request when receiving a current service request aiming at the target logical volume;
a token obtaining request sending module, configured to determine whether a number of processed service requests of a sliding window corresponding to the target logical volume in a current sliding period meets a preset service request number detection condition, and if so, send a token obtaining request to a token bucket corresponding to the target logical volume;
and the request execution module is used for executing the current service request based on at least one storage node corresponding to the target logical volume when the token is detected to be successfully acquired.
In a third aspect, an embodiment of the present invention further provides an electronic device, including:
one or more processors;
a memory for storing one or more programs,
when the one or more programs are executed by the one or more processors, the one or more processors implement the method for controlling the service quality of the logical volume according to any embodiment of the present invention.
In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements a method for controlling a quality of service of a logical volume according to any embodiment of the present invention.
According to the technical scheme provided by the embodiment of the invention, when a current service request for a target logical volume is received, if the target logical volume is determined to have no unprocessed historical service request, the processed service request number of a sliding window corresponding to the target logical volume in a current sliding period is obtained; then when the processed service request quantity is determined to meet the preset service request quantity detection condition, sending a token acquisition request to a token bucket corresponding to the target logical volume; when the token is successfully acquired, executing a current service request based on a plurality of storage nodes corresponding to the target logical volume; by combining the sliding window and the token bucket, the tolerance capacity to the burst service flow can be improved while the current limiting and the current stabilizing are realized, so that the service quality of the distributed storage system can be improved.
Drawings
Fig. 1A is a flowchart of a method for controlling a quality of service of a logical volume according to an embodiment of the present invention;
FIG. 1B is a schematic diagram of a sliding window provided in an embodiment of the present invention;
FIG. 1C is a schematic diagram of a process of token issuance for a token bucket according to an embodiment of the present invention;
fig. 2A is a flowchart of a method for controlling a quality of service of a logical volume according to a second embodiment of the present invention;
fig. 2B is a schematic flowchart of service processing of a preset leaky bucket according to a second embodiment of the present invention;
fig. 3A is a flowchart of a method for controlling a quality of service of a logical volume according to a third embodiment of the present invention;
FIG. 3B is a flowchart illustrating sliding of a sliding window and consumption and replenishment of tokens according to a third embodiment of the present invention;
fig. 3C is a schematic flowchart of a method for controlling a quality of service of a logical volume according to a third embodiment of the present invention;
fig. 4 is a block diagram of a control apparatus for controlling the quality of service of a logical volume according to a fourth embodiment of the present invention;
fig. 5 is a block diagram of an electronic device according to a fifth embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not to be construed as limiting the invention. It should be further noted that, for the convenience of description, only some of the structures related to the present invention are shown in the drawings, not all of the structures.
Example one
Fig. 1A is a flowchart of a method for controlling a service quality of a logical volume according to an embodiment of the present invention, where the embodiment of the present invention is applicable to a case of controlling the service quality of the logical volume; the method may be executed by a control apparatus for quality of service of a logical volume in an embodiment of the present invention, where the apparatus may be implemented by software and/or hardware, and is integrated on an electronic device, and typically may be integrated on a computer device or a server, where the method specifically includes the following steps:
s110, when a current service request aiming at a target logical volume is received, if it is determined that the target logical volume does not have unprocessed historical service requests, acquiring the number of processed service requests of a sliding window corresponding to the target logical volume in a current sliding period.
Wherein, the target Logical volume (LUN) is a Logical volume that needs to be accessed currently; the logical volume may be a virtual disk formed of logical disks, for example, in a computer device, the logical volume may be a partitioned disk partition. In this embodiment, the logical volume may be a virtual disk formed by repartitioning storage resources of a plurality of storage nodes. Because the logical volume is a storage service unit of the application layer, the logical volume needs to provide corresponding storage service according to the application requirements of the user, and certain storage service quality is guaranteed.
The current service request for the target logical volume may be an Input/Output (I/O) request of an application layer; typically, the operation request may be a read/write operation request for the target logical volume, for example, an addition, deletion, modification or search operation request in the target logical volume. In this embodiment, when a current service request to a target logical volume is detected, it may be first determined whether the target logical volume has an unprocessed historical service request. If it is determined that unprocessed historical service requests do not exist, it is indicated that all service requests before the current service request have successfully obtained tokens or have completed processing; at this time, the number of processed service requests of the sliding window corresponding to the target logical volume in the current sliding period may be obtained.
In this embodiment, for each logical volume, a corresponding sliding window is preset; the parameters of the sliding window may include information such as the length of the sliding window, the length of the sub-window, the sliding interval, and the sliding step length. In addition, each sliding window is preset with a corresponding service processing number counter so as to count the number of the processed service requests in each sliding period. Therefore, when the current service request is obtained, the current sliding period of the sliding window corresponding to the target logical volume can be determined according to the current local system time; and then the number of the processed service requests in the current sliding period can be obtained through a preset service processing number counter.
Wherein the sliding of the sliding window may be illustrated in fig. 1B. Specifically, one sliding window is composed of a plurality of small windows with equal parts, each small window corresponds to different time points, and an independent service processing number counter is arranged. And when the time point of the service request is greater than the maximum time point of the current sliding period of the sliding window, the sliding window is moved forwards by one small window, and the service request corresponds to the last small window.
It should be noted that, in each sliding period, the number of all processed service requests needs to be smaller than the preset number, so that smooth processing of the service requests can be ensured, and effective current limiting of a large number of burst service requests can be realized. The more the number of the divided sub-windows is, the better the current limiting effect on the service request is, and the smoother the processing on the service request is.
S120, judging whether the processed service request quantity of the sliding window corresponding to the target logical volume in the current sliding period meets a preset service request quantity detection condition, if so, sending a token acquisition request to a token bucket corresponding to the target logical volume.
The preset service request quantity detection condition may be a preset condition for judging whether the processed service request quantity in the sliding period exceeds the bearable range of the target logical volume; for example, the number of processed service requests in the sliding period may be smaller than a preset service request number threshold, that is, the number of service requests that can be processed in a period of time is kept constant.
In a specific example, if it is determined that the number of the processed service requests in the current sliding period is smaller than the preset service request number threshold, it indicates that the number of the service requests that can be processed in the current sliding period is not exceeded, and the current service request may be processed. The advantage of the above arrangement is that by setting the preset service request quantity detection condition, the quantity of the service requests processed within a certain time can be ensured to be kept constant, thereby realizing effective flow limitation of the service request flow.
It should be noted that, before processing the current service request, the current service request needs to acquire a corresponding Token (Token), and only the service request that successfully acquires the corresponding Token is processed. Therefore, after it is determined that the number of the processed service requests in the current sliding cycle satisfies the preset service request number detection condition, it is further required to send a token obtaining request to the token bucket corresponding to the target logical volume to request to obtain the token corresponding to the current service request.
In this embodiment, a corresponding token bucket is preset for each logical volume, and the token bucket may issue a corresponding token to each service request. The maximum quantity of the tokens stored in the token bucket is fixed, and the tokens in the token bucket can be supplemented according to a preset token supplementing speed.
In one specific example, the token issuance process for the token bucket may be as shown in FIG. 1C. Specifically, the system adds a token to the token bucket according to a specified policy (e.g., at a constant speed), and after receiving a service request, requests the token bucket to acquire the token first, and only the service request that successfully acquires the token performs subsequent processing. And for the service request which does not successfully acquire the token, the service request can be suspended (added to a preset buffer queue) or discarded. By controlling the rate of generation of tokens, effective control of the rate of processing of service requests can be achieved.
S130, when the token is successfully acquired, executing the current service request based on at least one storage node corresponding to the target logic volume.
Wherein, in the distributed storage system, the target logical volume may correspond to one or more storage nodes in the storage pool. In this embodiment, after the token is successfully obtained, the current service request may be executed based on the plurality of storage nodes corresponding to the target logical volume, so as to correspondingly modify the storage content of each storage node.
According to the technical scheme provided by the embodiment of the invention, when a current service request for a target logical volume is received, if the target logical volume is determined to have no unprocessed historical service request, the processed service request number of a sliding window corresponding to the target logical volume in a current sliding period is obtained; then when the processed service request quantity is determined to meet the preset service request quantity detection condition, sending a token acquisition request to a token bucket corresponding to the target logical volume; when the token is successfully acquired, executing a current service request based on a plurality of storage nodes corresponding to the target logical volume; by combining the sliding window and the token bucket, the tolerance capacity to the burst service flow can be improved while the current limiting and the current stabilizing are realized, so that the service quality of the distributed storage system can be improved.
In an optional implementation manner of this embodiment, the technical solution of this embodiment may further include: judging whether the number of tokens in a token bucket corresponding to the target logical volume is greater than or equal to a preset token number threshold value or not every preset time interval; if not, adding tokens with a preset quantity into the token bucket corresponding to the target logical volume.
The preset time may be a preset interval time for adding tokens to the token bucket, and may be equal to the sliding interval time of the sliding window. The preset token number threshold may be a quantity value obtained by subtracting the preset number from the maximum token number of the token bucket. The preset number is the number of tokens added to the token bucket for each preset time.
In this embodiment, when the number of tokens in the token bucket corresponding to the target logical volume is smaller than the preset token number threshold, a preset number of tokens is added to the token bucket, and the maximum token number of the token bucket is not exceeded. Therefore, every preset time interval, when the number of tokens in each token bucket is determined to be smaller than the preset token number threshold, a preset number of tokens are added into each token bucket.
The advantage of the above arrangement is that the real-time supplement of the tokens in the token bucket can be realized, so that the processing efficiency of each service request can be ensured, the condition of service request failure processing caused by token shortage can be avoided, and the successful processing probability of the service request can be improved.
In another optional implementation manner of this embodiment, after receiving the current service request for the target logical volume, the method may further include: if the unprocessed historical service requests exist in the target logical volume, adding the current service request to a service request cache queue corresponding to the target logical volume, and waiting for the completion of the processing of each historical service request in the service request cache queue corresponding to the target logical volume.
It should be noted that, limited by the maximum number of service processes in the sliding window or the number of tokens in the token bucket, the service request for the target logical volume may not be processed in real time, that is, there is a delay in processing the service request. In this embodiment, for a service request that cannot be processed in real time, the service request may be stored as a historical service request in a service request buffer queue corresponding to the target logical volume. Furthermore, the service requests in the service request buffer queue may be processed in sequence based on a first-in first-out rule.
In this embodiment, if it is determined that an unprocessed historical service request currently exists in the target logical volume, the current service request cannot be processed in real time, and may be first added to the service request cache queue corresponding to the target logical volume to queue up for processing. And when all historical service requests positioned before the current service request in the service request cache queue are processed, processing the current service request.
In addition, when the number of the processed service requests in the current sliding period is greater than or equal to the preset service request number threshold, or the token is not successfully acquired, the current service request may be suspended, that is, the current service request is added to the service request buffer queue corresponding to the target logical volume to wait for processing.
In this embodiment, by combining the sliding window and the token bucket, requests within a period of time can be smoothly dispersed to each moment, so that the service quality of the logical volume can be kept stable, and the stability of the service quality of the logical volume can be improved.
Example two
Fig. 2A is a flowchart of a method for controlling service quality of a logical volume according to a second embodiment of the present invention, which is embodied on the basis of the foregoing embodiment, in this embodiment, before a current service request is executed on the basis of multiple storage nodes corresponding to a target logical volume, the current service request is added to a service request cache queue corresponding to a preset leaky bucket, and each service request in the service request cache queue corresponding to the preset leaky bucket is processed according to a preset service request processing speed, where the method specifically includes:
s210, when receiving a current service request for a target logical volume, if determining that the target logical volume does not have unprocessed historical service requests, acquiring the number of processed service requests of a sliding window corresponding to the target logical volume in a current sliding period.
In an optional implementation manner of this embodiment, the obtaining the number of processed service requests of the sliding window corresponding to the target logical volume in the current sliding period may include: acquiring at least one sub-window of a sliding window corresponding to the target logical volume in a current sliding period according to the length of a preset sub-window; acquiring the number of processed service requests corresponding to each sub-window through a preset request counter corresponding to each sub-window; and acquiring the number of the processed service requests of the sliding window corresponding to the target logical volume in the current sliding period according to the number of the processed service requests corresponding to each sub-window.
In this embodiment, based on the preset length of the sub-window, the sliding window in one sliding period may be divided into a plurality of equally divided sub-windows, and an independent request counter may be configured for each sub-window. For example, if the length of the sliding window is 60 seconds and the preset sub-window length is 10 seconds, the sliding window may be divided into 6 sub-windows. Therefore, the number of the processed service requests in each sub-window can be respectively counted and obtained through the preset request counters corresponding to each sub-window, and then the number of the processed service requests in each sub-window can be added to obtain the total number of the processed service requests of the sliding window in the current sliding period.
It should be noted that there is allowed to exist a fluctuation of the number of service requests within the sliding window, that is, the number of the processed service requests within some sub-windows is allowed to be greater than or less than the average number, even zero, as long as it is ensured that the total number of the processed service requests within one sliding period satisfies the preset service request number detection condition.
S220, judging whether the processed service request quantity of the sliding window corresponding to the target logical volume in the current sliding period meets a preset service request quantity detection condition, if so, sending a token acquisition request to a token bucket corresponding to the target logical volume.
And S230, when the token is successfully acquired, adding the current service request to a service request cache queue corresponding to a preset leaky bucket, and processing each service request in the service request cache queue corresponding to the preset leaky bucket according to the processing speed of the preset service request.
The preset service request processing speed is the number of service requests processed in a preset unit time. In this embodiment, since the storage service quality of the storage pool is fixed, a preset leaky bucket is added before the storage pool, the service requests of different logical volumes are all added to the service request cache queue of the preset leaky bucket, and then each service request is processed according to the preset service request processing speed.
In one specific example, the business process flow of the preset leaky bucket can be as shown in fig. 2B. Specifically, the I/O service queue corresponding to the logical volume LUN 1 and the I/O service queue corresponding to the logical volume LUN 2 are both added to the service request cache queue of the preset leaky bucket. Then, the preset leaky bucket processes each service request in the service request buffer queue in turn according to a constant service request processing speed and a first-in first-out rule.
Notably, if no service request is added to the preset leaky bucket, the empty is processed; in addition, even if more service requests are accumulated in the preset leaky bucket, the processing speed of the service requests cannot be increased, so that the processing speed of the service requests is prevented from exceeding the bearable range of the storage node. In this embodiment, by setting the preset leaky bucket corresponding to the storage pool, a situation that a service request corresponding to each logical volume is directly sent to the storage pool, which results in that the service processing pressure exceeds the bearable range of the storage pool, can be avoided, so that the probability of failure processing of the service request can be reduced, and the service quality of the distributed storage system can be improved.
In another optional implementation manner of this embodiment, before processing, according to a preset service request processing speed, each service request in a service request buffer queue corresponding to the preset leaky bucket, the method may further include: acquiring service request processing performance matched with the storage pool corresponding to the preset leaky bucket, and setting the processing speed of the preset service request corresponding to the preset leaky bucket according to the service request processing performance; the preset leaky buckets are in one-to-one correspondence with the storage pool, and the storage pool comprises at least one storage node.
The storage pool may be composed of a plurality of storage nodes, and each storage node may be a storage device, such as a hard disk, a memory, and the like. It can be understood that the hardware resources of each storage node in the storage pool are fixed, that is, the number of service requests that can be received in the storage pool per unit time is fixed, that is, the storage service quality provided by the storage pool is fixed.
Therefore, the service request processing performance matched with the storage pool, that is, the number of service requests that can be received in unit time, can be obtained, and the preset service request processing speed is set according to the service request processing performance. Through the setting, the setting accuracy of the processing speed of the preset service request can be improved, the failure processing probability of the service request can be further reduced, and the stability of the distributed storage system can be further improved.
S240, executing the current service request based on at least one storage node corresponding to the target logical volume.
According to the technical scheme provided by the embodiment of the invention, the current service request is added to the service request cache queue corresponding to the preset leaky bucket before the current service request is executed based on the plurality of storage nodes corresponding to the target logical volume, and each service request in the service request cache queue corresponding to the preset leaky bucket is processed according to the processing speed of the preset service request, so that the condition that the service processing pressure exceeds the bearable range of the storage pool can be avoided, the probability of failure processing of the service request can be reduced, and the service quality of the distributed storage system can be improved.
In another optional implementation manner of this embodiment, after sending the token obtaining request to the token bucket corresponding to the target logical volume, the method may further include: if the token acquisition is not successfully detected, when the sliding window corresponding to the target logical volume starts to slide towards the preset direction is detected, the token acquisition request is sent to the token bucket corresponding to the target logical volume again until the token issued by the token bucket corresponding to the target logical volume is successfully acquired.
And sliding a sliding window corresponding to the target logical volume to a preset direction at preset time intervals for a preset step length. The preset time may be a preset sliding interval of the sliding window. The preset direction is a preset sliding direction of the sliding window, and in this embodiment, the preset direction may be a time increasing direction on the time axis. The preset step length may be a time length of each movement of the sliding window.
Optionally, the preset step length may be equal to the preset sub-window length; for example, if the window length of the sliding window is 60 seconds and the preset sub-window length is 10 seconds, the preset step size may also be 10 seconds, that is, the sliding window slides forward one sub-window every preset time.
In this embodiment, if the token is not successfully obtained, it indicates that all tokens in the token bucket corresponding to the target logical volume are exhausted, and at this time, the current service request may be first added to the service request cache queue corresponding to the target logical volume, so as to wait for the token to be supplemented and then process the token. Since the token bucket supplements tokens once every preset time interval, i.e. the token bucket supplements tokens once every time the sliding window moves. Therefore, when the sliding window is detected to start sliding, the token acquisition request can be sent to the token bucket corresponding to the target logical volume again to ensure that the token can be acquired successfully.
In this embodiment, when it is detected that the sliding window starts to slide, a token is requested again from the token bucket corresponding to the target logical volume, so that the number of times of sending an invalid token acquisition request can be reduced, and the probability of successfully acquiring the token can be improved.
EXAMPLE III
Fig. 3A is a flowchart of a method for controlling service quality of a logical volume according to a third embodiment of the present invention, which is embodied on the basis of the foregoing embodiments, in this embodiment, if it is detected that a token is successfully obtained, a current service request is added to a service request cache queue corresponding to a preset leaky bucket, and each service request in the service request cache queue corresponding to the preset leaky bucket is processed according to a preset service request processing speed; and if the token is not successfully acquired, re-sending a token acquisition request to the token bucket corresponding to the target logical volume when the sliding window corresponding to the target logical volume is detected to start sliding towards the preset direction until the token issued by the token bucket corresponding to the target logical volume is successfully acquired. The method specifically comprises the following steps:
s310, start, and execute S320.
S320, receiving the current service request aiming at the target logical volume, and executing S330.
S330, judging whether the target logic volume has unprocessed historical service requests.
If not, executing S340; if yes, go to S360. Specifically, when the target logical volume has an unprocessed historical service request, the current service request cannot be directly processed, and at this time, the current service request needs to be added to the service request cache queue corresponding to the target logical volume. When there are no historical service requests pending for the target logical volume, an attempt may be made to obtain a token and the current service request processed upon successful token acquisition.
S340, obtaining the processed service request quantity of the sliding window corresponding to the target logical volume in the current sliding period, and executing S350.
And S350, when it is determined that the processed service request quantity of the sliding window corresponding to the target logical volume in the current sliding period meets the preset service request quantity detection condition, sending a token acquisition request to a token bucket corresponding to the target logical volume, and executing S370.
In addition, if it is detected that the processed service request quantity of the sliding window corresponding to the target logical volume in the current sliding period does not satisfy the preset service request quantity detection condition, it indicates that the processed service request quantity in the current sliding period has exceeded the service processing pressure that the target logical volume can bear. At this time, the token cannot be requested to be obtained in real time, and the current service request may be processed again when it is detected that the sliding window starts to slide, that is, in the next sliding period.
In one specific example, the sliding of the sliding window and the consumption and replenishment of tokens may be as shown in FIG. 3B. Wherein, a sliding window includes 6 sliding sub-windows, the sliding window moves forward one sliding sub-window at a time, and the initial number of tokens in the token bucket is 6. During the first sliding period, 3 service requests are received and 3 tokens are consumed. When the sliding window slides to the second sliding period, 1 token is automatically added into the token bucket, no service request is received in the current sliding period, so that no token is consumed, and at the moment, 4 tokens remain in the token bucket. When the sliding window continues to slide to a third sliding period, 1 token is added to the token bucket, 5 service requests are received in the current sliding period, so that 5 tokens are consumed, and at the moment, 0 token remains in the token bucket. Further, the above process is repeated, and 1 token is added to the token bucket each time the sliding window starts to slide.
When the number of the service requests in one sliding period is larger than the number of the existing tokens in the token bucket, the service requests acquired later are added into a service request cache queue of the target logical volume so as to wait for the sliding window to slide until the token supplement exists in the next sliding period, and then the corresponding tokens are requested to be acquired.
S360, adding the current service request to the service request cache queue corresponding to the target logical volume, waiting for the completion of the processing of each historical service request in the service request cache queue corresponding to the target logical volume, and returning to execute S330.
And S370, judging whether the token is successfully acquired.
If the token is not successfully acquired, executing S380; if the token is successfully acquired, S390 is executed.
And S380, when detecting that the sliding window corresponding to the target logical volume starts to slide towards the preset direction, returning to execute S350.
And S390, adding the current service request to a service request cache queue corresponding to a preset leaky bucket, processing each service request in the service request cache queue corresponding to the preset leaky bucket according to a preset service request processing speed, and executing S3100.
S3100, when detecting that the current service request starts to be processed, executing the current service request based on at least one storage node corresponding to the target logical volume, and executing S3110.
And S3110, finishing.
The technical scheme provided by the embodiment of the invention receives the current service request aiming at the target logical volume, and obtains the number of the processed service requests of the sliding window corresponding to the target logical volume in the current sliding period when the target logical volume is determined to have no unprocessed historical service request; then, when determining that the processed service request quantity of a sliding window corresponding to the target logical volume in the current sliding period meets a preset service request quantity detection condition, sending a token acquisition request to a token bucket corresponding to the target logical volume; then, after the token is successfully acquired, adding the current service request to a service request cache queue corresponding to a preset leaky bucket, and processing each service request in the service request cache queue corresponding to the preset leaky bucket according to the preset service request processing speed; finally, when the current service request is detected to start to be processed, executing the current service request based on a plurality of storage nodes corresponding to the target logical volume; by setting the preset service request quantity detection condition and the token bucket, the stability of the service quality of the logical volume in the time of a sliding window can be ensured, and the successful response to a large number of burst service requests can be realized; in addition, the service quality of each logical volume can be controlled within the capacity range of the storage node by setting the preset leaky bucket; through the arrangement, the service quality of the logical volumes can be effectively controlled, and the stable and reliable service quality of each logical volume can be provided within the capability range of distributed storage.
In a specific implementation manner of this embodiment, a flow of the method for controlling the quality of service of the logical volume may be as shown in fig. 3C. Specifically, firstly, a plurality of hosts which are preset access service requests of different logical volumes, and map the service requests to the different logical volumes. It should be noted that, before sending the service request to the corresponding logical volume, the LUN Qos (logical volume quality of service) control method is used to process each service request. Specifically, whether unprocessed historical service requests exist in the target logical volume is judged, and if the unprocessed historical service requests do not exist, tokens are obtained from a token bucket corresponding to the target logical volume when the number of the processed service requests in the current sliding period meets a preset service request number detection condition.
Then, before executing the current service request based on a plurality of storage nodes corresponding to the target logical volume, the service request of each logical volume for successfully obtaining the token is processed by adopting a Node Qos (storage Node quality of service) control method. Specifically, each service request is added to a service request cache queue corresponding to a preset leaky bucket, and each service request in the service request cache queue corresponding to the preset leaky bucket is processed according to a preset service request processing speed.
In this embodiment, by combining the LUN Qos control method and the Node Qos control method, the quality of service of the logical volumes can be effectively controlled, and when there are a large number of sudden service requests for a plurality of logical volumes, the service processing pressure exceeds the tolerable range of the storage pool while the service fluctuation (the service fluctuation range is 1% -2%) is effectively reduced, so that the stability of the quality of service of the distributed storage system can be improved.
Example four
Fig. 4 is a block diagram of a structure of a control device for service quality of a logical volume according to a fourth embodiment of the present invention, where the control device specifically includes: a processed service request quantity obtaining module 410, a token obtaining request sending module 420 and a request executing module 430; wherein the content of the first and second substances,
a processed service request quantity obtaining module 410, configured to, when a current service request for a target logical volume is received, if it is determined that the target logical volume does not have an unprocessed historical service request, obtain a processed service request quantity of a sliding window corresponding to the target logical volume in a current sliding period;
a token obtaining request sending module 420, configured to determine whether a processed number of service requests of a sliding window corresponding to the target logical volume in a current sliding period meets a preset service request number detection condition, and if yes, send a token obtaining request to a token bucket corresponding to the target logical volume;
and a request executing module 430, configured to, when it is detected that the token is successfully obtained, execute the current service request based on at least one storage node corresponding to the target logical volume.
According to the technical scheme provided by the embodiment of the invention, when a current service request aiming at a target logical volume is received, if the target logical volume is determined to have no unprocessed historical service request, the processed service request number of a sliding window corresponding to the target logical volume in a current sliding period is obtained; then when determining that the number of the processed service requests meets the preset service request number detection condition, sending token acquisition requests to a token bucket corresponding to the target logical volume; when the token is successfully acquired, executing a current service request based on a plurality of storage nodes corresponding to the target logical volume; by combining the sliding window and the token bucket, the tolerance capability to the burst service flow can be improved while the current limiting and the current stabilizing are realized, so that the service quality of the distributed storage system can be improved.
Optionally, on the basis of the above technical solution, the apparatus for controlling quality of service of a logical volume further includes:
and the preset leaky bucket processing module is used for adding the current service request to a service request cache queue corresponding to a preset leaky bucket and processing each service request in the service request cache queue corresponding to the preset leaky bucket according to the preset service request processing speed.
Optionally, on the basis of the above technical solution, the apparatus for controlling quality of service of a logical volume further includes:
a preset service request processing speed setting module, configured to obtain service request processing performance matched with the storage pool corresponding to the preset leaky bucket, and set a preset service request processing speed corresponding to the preset leaky bucket according to the service request processing performance; the preset leaky buckets are in one-to-one correspondence with the storage pool, and the storage pool comprises at least one storage node.
Optionally, on the basis of the above technical solution, the apparatus for controlling quality of service of a logical volume further includes:
the token adding module is used for judging whether the number of tokens in a token bucket corresponding to the target logical volume is greater than or equal to a preset token number threshold value or not every preset time interval; if not, adding tokens with a preset quantity into the token bucket corresponding to the target logical volume.
Optionally, on the basis of the foregoing technical solution, the processed service request quantity obtaining module 410 includes:
a sub-window obtaining unit, configured to obtain, according to a preset sub-window length, at least one sub-window of a sliding window corresponding to the target logical volume in a current sliding period;
a sub-window processed service request quantity obtaining unit, configured to obtain, through a preset request counter corresponding to each sub-window, a processed service request quantity corresponding to each sub-window;
and the processed service request quantity acquiring unit is used for acquiring the processed service request quantity of the sliding window corresponding to the target logical volume in the current sliding period according to the processed service request quantity corresponding to each sub-window.
Optionally, on the basis of the above technical solution, the apparatus for controlling quality of service of a logical volume further includes:
and the waiting processing module is used for adding the current service request to the service request cache queue corresponding to the target logical volume and waiting for the completion of the processing of each historical service request in the service request cache queue corresponding to the target logical volume if the target logical volume is determined to have unprocessed historical service requests.
Optionally, on the basis of the above technical solution, the apparatus for controlling quality of service of a logical volume further includes:
the token re-request module is used for re-sending a token acquisition request to a token bucket corresponding to the target logical volume when detecting that a sliding window corresponding to the target logical volume starts to slide towards a preset direction if the token is not successfully acquired until a token issued by the token bucket corresponding to the target logical volume is successfully acquired; and sliding a sliding window corresponding to the target logical volume to a preset direction at preset time intervals by a preset step length.
The control device for the service quality of the logical volume provided by the embodiment of the invention can execute the control method for the service quality of the logical volume provided by any embodiment of the invention, and has corresponding functional modules and beneficial effects of the execution method.
EXAMPLE five
Fig. 5 is a schematic structural diagram of an electronic device according to a fifth embodiment of the present invention, as shown in fig. 5, the electronic device includes a processor 50, a memory 51, an input device 52, and an output device 53; the number of the processors 50 in the electronic device may be one or more, and one processor 50 is taken as an example in fig. 5; the processor 50, the memory 51, the input device 52 and the output device 53 in the electronic apparatus may be connected by a bus or other means, and the bus connection is exemplified in fig. 5.
The memory 51 is used as a computer-readable storage medium, and can be used for storing software programs, computer-executable programs, and modules, such as program instructions/modules corresponding to the method for controlling the quality of service of the logical volume in the embodiment of the present invention (for example, the processed service request quantity obtaining module 410, the token obtaining request sending module 420, and the request executing module 430 in the apparatus for controlling the quality of service of the logical volume). The processor 50 executes software programs, instructions and modules stored in the memory 51 to execute various functional applications and data processing of the electronic device, that is, to implement the above-described method for controlling the quality of service of the logical volume, that is, to:
when a current service request aiming at a target logical volume is received, if it is determined that the target logical volume does not have unprocessed historical service requests, acquiring the processed service request quantity of a sliding window corresponding to the target logical volume in a current sliding period;
judging whether the processed service request quantity of a sliding window corresponding to the target logical volume in the current sliding period meets a preset service request quantity detection condition, if so, sending a token acquisition request to a token bucket corresponding to the target logical volume;
and when the token is successfully acquired, executing the current service request based on at least one storage node corresponding to the target logic volume.
The memory 51 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to the use of the terminal, and the like. Further, the memory 51 may include high speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some examples, the memory 51 may further include memory located remotely from the processor 50, which may be connected to the electronic device through a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The input device 52 may be used to receive input numeric or character information and generate key signal inputs relating to user settings and function controls of the electronic equipment. The output device 53 may include a display device such as a display screen.
EXAMPLE six
The sixth embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program is executed by a processor to implement the method according to any embodiment of the present invention. Of course, a computer-readable storage medium provided in an embodiment of the present invention may perform operations related to a method for controlling quality of service of a logical volume according to any embodiment of the present invention. That is, the program when executed by the processor implements:
when a current service request aiming at a target logical volume is received, if it is determined that the target logical volume does not have unprocessed historical service requests, acquiring the processed service request quantity of a sliding window corresponding to the target logical volume in a current sliding period;
judging whether the processed service request quantity of a sliding window corresponding to the target logical volume in the current sliding period meets a preset service request quantity detection condition, if so, sending a token acquisition request to a token bucket corresponding to the target logical volume;
and when the token is successfully acquired, executing the current service request based on at least one storage node corresponding to the target logic volume.
From the above description of the embodiments, it is obvious for those skilled in the art that the present invention can be implemented by software and necessary general hardware, and certainly can be implemented by hardware, but the former is a better embodiment in many cases. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which can be stored in a computer-readable storage medium, such as a floppy disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a FLASH Memory (FLASH), a hard disk or an optical disk of a computer, and includes instructions for enabling an electronic device (which may be a personal computer, a server, or a network device) to execute the methods according to the embodiments of the present invention.
It should be noted that, in the embodiment of the control apparatus for qos of a logical volume, each unit and each module included in the embodiment are only divided according to functional logic, but are not limited to the above division, as long as the corresponding function can be implemented; in addition, the specific names of the functional units are only for the convenience of distinguishing from each other, and are not used for limiting the protection scope of the present invention.
It is to be noted that the foregoing is only illustrative of the preferred embodiments of the present invention and the technical principles employed. Those skilled in the art will appreciate that the present invention is not limited to the particular embodiments described herein, and that various obvious changes, rearrangements and substitutions will now be apparent to those skilled in the art without departing from the scope of the invention. Therefore, although the present invention has been described in greater detail by the above embodiments, the present invention is not limited to the above embodiments, and may include other equivalent embodiments without departing from the spirit of the present invention, and the scope of the present invention is determined by the scope of the appended claims.

Claims (10)

1. A method for controlling service quality of a logical volume, comprising:
when a current service request aiming at a target logical volume is received, if it is determined that the target logical volume does not have unprocessed historical service requests, acquiring the processed service request quantity of a sliding window corresponding to the target logical volume in a current sliding period;
judging whether the number of the processed service requests of the sliding window corresponding to the target logical volume in the current sliding period meets a preset service request number detection condition, if so, sending a token acquisition request to a token bucket corresponding to the target logical volume;
and when the token is successfully acquired, executing the current service request based on at least one storage node corresponding to the target logical volume.
2. The method according to claim 1, further comprising, before executing the current service request based on the at least one storage node corresponding to the target logical volume:
and adding the current service request to a service request cache queue corresponding to a preset leaky bucket, and processing each service request in the service request cache queue corresponding to the preset leaky bucket according to a preset service request processing speed.
3. The method of claim 2, wherein before processing each service request in the service request buffer queue corresponding to the preset leaky bucket according to a preset service request processing speed, the method further comprises:
acquiring service request processing performance matched with the storage pool corresponding to the preset leaky bucket, and setting a preset service request processing speed corresponding to the preset leaky bucket according to the service request processing performance;
the preset leaky buckets are in one-to-one correspondence with the storage pool, and the storage pool comprises at least one storage node.
4. The method of claim 1, further comprising:
judging whether the number of tokens in a token bucket corresponding to the target logical volume is greater than or equal to a preset token number threshold value or not every preset time interval;
and if not, adding a preset number of tokens to the token bucket corresponding to the target logical volume.
5. The method according to claim 1, wherein obtaining the number of the processed service requests of the sliding window corresponding to the target logical volume in the current sliding period comprises:
acquiring at least one sub-window of a sliding window corresponding to the target logical volume in a current sliding period according to the length of a preset sub-window;
acquiring the number of processed service requests corresponding to each sub-window through a preset request counter corresponding to each sub-window;
and acquiring the number of the processed service requests of the sliding window corresponding to the target logical volume in the current sliding period according to the number of the processed service requests corresponding to each sub-window.
6. The method of claim 1, further comprising, after receiving a current service request for the target logical volume:
if the target logical volume is determined to have unprocessed historical service requests, adding the current service request to a service request cache queue corresponding to the target logical volume, and waiting for all the historical service requests in the service request cache queue corresponding to the target logical volume to be processed.
7. The method of claim 1, further comprising, after sending a token obtaining request to the token bucket corresponding to the target logical volume:
if the token acquisition is not successfully detected, when the sliding window corresponding to the target logical volume starts to slide towards the preset direction, a token acquisition request is sent to the token bucket corresponding to the target logical volume again until the token issued by the token bucket corresponding to the target logical volume is successfully acquired;
and sliding a sliding window corresponding to the target logical volume to a preset direction at preset time intervals by a preset step length.
8. An apparatus for controlling a quality of service of a logical volume, comprising:
the processed service request quantity acquisition module is used for acquiring the processed service request quantity of a sliding window corresponding to a target logical volume in a current sliding period if the target logical volume is determined to have no unprocessed historical service request when receiving a current service request aiming at the target logical volume;
a token obtaining request sending module, configured to determine whether a number of processed service requests of a sliding window corresponding to the target logical volume in a current sliding period meets a preset service request number detection condition, and if yes, send a token obtaining request to a token bucket corresponding to the target logical volume;
and the request execution module is used for executing the current service request based on at least one storage node corresponding to the target logical volume when the token is detected to be successfully acquired.
9. An electronic device, characterized in that the electronic device comprises:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the method for controlling quality of service for a logical volume of any of claims 1-7.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, implements the method for controlling quality of service of a logical volume according to any one of claims 1 to 7.
CN202210430473.XA 2022-04-22 2022-04-22 Method, device, equipment and medium for controlling service quality of logical volume Pending CN114785739A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210430473.XA CN114785739A (en) 2022-04-22 2022-04-22 Method, device, equipment and medium for controlling service quality of logical volume

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210430473.XA CN114785739A (en) 2022-04-22 2022-04-22 Method, device, equipment and medium for controlling service quality of logical volume

Publications (1)

Publication Number Publication Date
CN114785739A true CN114785739A (en) 2022-07-22

Family

ID=82431262

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210430473.XA Pending CN114785739A (en) 2022-04-22 2022-04-22 Method, device, equipment and medium for controlling service quality of logical volume

Country Status (1)

Country Link
CN (1) CN114785739A (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110166376A (en) * 2019-06-06 2019-08-23 北京百度网讯科技有限公司 Flow control methods and device, system, server, computer-readable medium
CN112463066A (en) * 2020-12-11 2021-03-09 苏州浪潮智能科技有限公司 Method and equipment for controlling burst service quality of distributed block storage logical volume
CN113645150A (en) * 2021-06-11 2021-11-12 中国电信股份有限公司 Transmission rate control method, device, electronic equipment and readable storage medium
CN114095444A (en) * 2020-07-15 2022-02-25 中移物联网有限公司 Current limiting method and device and electronic equipment

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110166376A (en) * 2019-06-06 2019-08-23 北京百度网讯科技有限公司 Flow control methods and device, system, server, computer-readable medium
CN114095444A (en) * 2020-07-15 2022-02-25 中移物联网有限公司 Current limiting method and device and electronic equipment
CN112463066A (en) * 2020-12-11 2021-03-09 苏州浪潮智能科技有限公司 Method and equipment for controlling burst service quality of distributed block storage logical volume
CN113645150A (en) * 2021-06-11 2021-11-12 中国电信股份有限公司 Transmission rate control method, device, electronic equipment and readable storage medium

Similar Documents

Publication Publication Date Title
US10534542B2 (en) Dynamic core allocation for consistent performance in a non-preemptive scheduling environment
CN111190745B (en) Data processing method, device and computer readable storage medium
CN110196770B (en) Cloud system memory data processing method, device, equipment and storage medium
JP6480642B2 (en) Stochastic bandwidth adjustment
US9342245B2 (en) Method and system for allocating a resource of a storage device to a storage optimization operation
US10394606B2 (en) Dynamic weight accumulation for fair allocation of resources in a scheduler hierarchy
US9807014B2 (en) Reactive throttling of heterogeneous migration sessions in a virtualized cloud environment
WO2013029487A1 (en) Resource allocation method and resource management platform
WO2023103516A1 (en) Low-priority blocking method and apparatus based on processor virtualization environment
KR102563165B1 (en) Memory access request scheduling method, device, apparatus, and storage medium
US20230283578A1 (en) Method for forwarding data packet, electronic device, and storage medium for the same
CN111338785A (en) Resource scheduling method and device, electronic equipment and storage medium
US20200272526A1 (en) Methods and systems for automated scaling of computing clusters
CN111857992B (en) Method and device for allocating linear resources in Radosgw module
WO2015090044A1 (en) Data scanning method and device
CN112615795A (en) Flow control method and device, electronic equipment, storage medium and product
CN116633879A (en) Data packet receiving method, device, equipment and storage medium
CN114785739A (en) Method, device, equipment and medium for controlling service quality of logical volume
US10846094B2 (en) Method and system for managing data access in storage system
CN116303132A (en) Data caching method, device, equipment and storage medium
CN114020209A (en) Client service speed limiting method, device, equipment and storage medium
US10951537B1 (en) Adjustable receive queue for processing packets in a network device
CN114860334B (en) Processing method, device, equipment and medium for virtual machine starting storm
CN115442432B (en) Control method, device, equipment and storage medium
CN111831397B (en) Method, device, equipment and storage medium for processing IO request

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination