CN109547362A - A kind of array dispatching method, system and electronic equipment and storage medium - Google Patents
A kind of array dispatching method, system and electronic equipment and storage medium Download PDFInfo
- Publication number
- CN109547362A CN109547362A CN201910041078.0A CN201910041078A CN109547362A CN 109547362 A CN109547362 A CN 109547362A CN 201910041078 A CN201910041078 A CN 201910041078A CN 109547362 A CN109547362 A CN 109547362A
- Authority
- CN
- China
- Prior art keywords
- bandwidth
- queue
- packet loss
- adjusting parameter
- scheduling
- 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.)
- Withdrawn
Links
- 238000000034 method Methods 0.000 title claims abstract description 42
- 238000003860 storage Methods 0.000 title claims abstract description 15
- 238000004590 computer program Methods 0.000 claims description 11
- 230000005484 gravity Effects 0.000 claims description 11
- 238000005516 engineering process Methods 0.000 description 8
- 238000004891 communication Methods 0.000 description 6
- 230000008569 process Effects 0.000 description 6
- 238000012545 processing Methods 0.000 description 4
- 241000208340 Araliaceae Species 0.000 description 3
- 235000005035 Panax pseudoginseng ssp. pseudoginseng Nutrition 0.000 description 3
- 235000003140 Panax quinquefolius Nutrition 0.000 description 3
- 235000008434 ginseng Nutrition 0.000 description 3
- 241001522296 Erithacus rubecula Species 0.000 description 2
- 230000006735 deficit Effects 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 239000004973 liquid crystal related substance Substances 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000033228 biological regulation Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000005611 electricity Effects 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
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/50—Queue scheduling
- H04L47/52—Queue scheduling by attributing bandwidth to queues
- H04L47/522—Dynamic queue service slot or variable bandwidth allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0823—Errors, e.g. transmission errors
- H04L43/0829—Packet loss
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0876—Network utilisation, e.g. volume of load or congestion level
- H04L43/0894—Packet rate
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Environmental & Geological Engineering (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
This application discloses a kind of array dispatching method, system and a kind of electronic equipment and computer readable storage mediums, this method comprises: obtaining the bandwidth and packet loss of data packet in queue output end preset period of time；Based on the bandwidth and the packet loss, the adjusting parameter of queue bandwidth is determined；It determines the scheduling weight of each object queue according to the adjusting parameter, and the weight of the object queue is refreshed as the scheduling weight, to be scheduled using the scheduling weight to the object queue.The application adjusts the weight of each queue by the adjusting parameter dynamic determined using bandwidth and packet loss, to control the time interval and queue length of each round queue scheduling, achievees the purpose that delay of control is shaken, and improve resource utilization.
Description
Technical field
This application involves field of computer technology, more specifically to a kind of array dispatching method, system and a kind of electricity
Sub- equipment and a kind of computer readable storage medium.
Background technique
In the computer network for supporting a variety of service types, the distribution and scheduling of Internet resources are if having challenge
Topic, various dispatching algorithms all make great efforts to obtain balance between complexity, fairness, validity and resource utilization.Queue scheduling
Algorithm include first in first out (first in first out, FIFO), Weighted Fair Queuing (weighted fair queuing,
WFQ), which kind of algorithm deficit weighted round robin queue (deficit weighted round robin, WDRR) etc., take require
The fair allocat of bandwidth is realized as far as possible, meets the QOS demand of different flow.
WDRR queue scheduling algorithm is since simple with algorithm, computation complexity is low, is easy to set in hardware in the prior art
It the advantages that standby upper realization, is widely used.However, lacking unified mechanism to team for various types of data flow
Column are scheduled, and anti-delay variation is poor.
Therefore, how to solve the above problems is that those skilled in the art need to pay close attention to.
Summary of the invention
The application be designed to provide a kind of array dispatching method, system and a kind of electronic equipment and a kind of computer can
Storage medium is read, realizes delay of control shake.
To achieve the above object, this application provides a kind of array dispatching methods, comprising:
Obtain the bandwidth and packet loss of data packet in queue output end preset period of time；
Based on the bandwidth and the packet loss, the adjusting parameter of queue bandwidth is determined；
The scheduling weight of each object queue is determined according to the adjusting parameter, and the weight of the object queue is refreshed
For the scheduling weight, to be scheduled using the scheduling weight to the object queue.
Optionally, described to be based on the bandwidth and the packet loss, determine the adjusting parameter of queue bandwidth, comprising:
Judge whether the bandwidth is less than default minimum bandwidth；
If the bandwidth is less than the default minimum bandwidth, judge whether the packet loss is less than default minimum packet loss
Rate；
If it is, the inverse of bandwidth gain is determined as the adjusting parameter；Wherein, the bandwidth gain is practical point
The difference of the bandwidth and effective bandwidth matched accounts for the percentage of the effective bandwidth.
It is optionally, described to judge whether the bandwidth is less than after default minimum bandwidth, further includes:
If the band is wider than default minimum bandwidth, judge whether the bandwidth is greater than default maximum bandwidth；
If the band is wider than the default maximum bandwidth, judge whether the packet loss is greater than default maximum packet loss
Rate；
If it is, the bandwidth gain is determined as the adjusting parameter.
Optionally, the scheduling weight that each object queue is determined according to the adjusting parameter, comprising:
The bandwidth allocation value of each object queue is determined according to the adjusting parameter, and is calculated using the bandwidth allocation value
The bandwidth allocation value summation of all queues；
Determine that the bandwidth allocation value of the object queue accounts for the rate of specific gravity of the bandwidth allocation value summation, by the ratio
Scheduling weight of the weight values as the object queue.
To achieve the above object, this application provides a kind of queue scheduling systems, comprising:
Module is obtained, for obtaining the bandwidth and packet loss of data packet in queue output end preset period of time；
Determining module determines the adjusting parameter of queue bandwidth for being based on the bandwidth and the packet loss；
Refresh module, for determining the scheduling weight of each object queue according to the adjusting parameter, and by the target
It is the scheduling weight that the weight of queue, which refreshes, to be scheduled using the scheduling weight to the object queue.
Optionally, the determining module includes:
First judging unit, for judging whether the bandwidth is less than default minimum bandwidth；
Whether second judgment unit judges the packet loss if being less than the default minimum bandwidth for the bandwidth
Less than default minimum packet loss；
First determination unit, if being less than default minimum packet loss for the packet loss, by the inverse of bandwidth gain
It is determined as the adjusting parameter；Wherein, the bandwidth gain is that the difference of the bandwidth and effective bandwidth actually distributed accounts for and described has
Imitate the percentage of bandwidth.
Optionally, the determining module further include:
Third judging unit, after judging whether the bandwidth is less than default minimum bandwidth, if the band is wider than
Default minimum bandwidth, then judge whether the bandwidth is greater than default maximum bandwidth；
Whether 4th judging unit judges the packet loss if being wider than the default maximum bandwidth for the band
Greater than default maximum packet loss；
Second determination unit, it is if being greater than default maximum packet loss for the packet loss, the bandwidth gain is true
It is set to the adjusting parameter.
Optionally, the refresh module, comprising:
Third determination unit for determining the bandwidth allocation value of each object queue according to the adjusting parameter, and utilizes
The bandwidth allocation value calculates the bandwidth allocation value summation of all queues；
4th determination unit, for determining that the bandwidth allocation value of the object queue accounts for the bandwidth allocation value summation
Rate of specific gravity, using the rate of specific gravity as the scheduling weight of the object queue.
To achieve the above object, this application provides a kind of electronic equipment, comprising:
Memory, for storing computer program；
Processor realizes the aforementioned disclosed any one array dispatching method when for executing the computer program
Step.
To achieve the above object, this application provides a kind of computer readable storage medium, the computer-readable storages
Computer program is stored on medium, the computer program realizes the aforementioned disclosed any one team when being executed by processor
The step of column dispatching method.
By above scheme it is found that a kind of array dispatching method provided by the present application, comprising: it is default to obtain queue output end
The bandwidth and packet loss of data packet in time cycle；Based on the bandwidth and the packet loss, the adjustment ginseng of queue bandwidth is determined
Number；The scheduling weight of each object queue is determined according to the adjusting parameter, and the weight of the object queue is refreshed as institute
Scheduling weight is stated, to be scheduled using the scheduling weight to the object queue.The application is by utilizing bandwidth and packet loss
The adjusting parameter dynamic that rate determines adjusts the weight of each queue, to control time interval and the team of each round queue scheduling
Column length achievees the purpose that delay of control is shaken, and improves resource utilization.
Disclosed herein as well is a kind of queue scheduling system and a kind of electronic equipment and a kind of computer readable storage medium,
Equally it is able to achieve above-mentioned technical effect.
Detailed description of the invention
In order to illustrate the technical solutions in the embodiments of the present application or in the prior art more clearly, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of application for those of ordinary skill in the art without creative efforts, can be with
It obtains other drawings based on these drawings.
Fig. 1 is a kind of flow chart of array dispatching method disclosed in the embodiment of the present application；
Fig. 2 is the flow chart of another kind array dispatching method disclosed in the embodiment of the present application；
Fig. 3 is the flow chart of another array dispatching method disclosed in the embodiment of the present application；
Fig. 4 is a kind of structure chart of queue scheduling system disclosed in the embodiment of the present application；
Fig. 5 is the structure chart of a kind of electronic equipment disclosed in the embodiment of the present application；
Fig. 6 is the structure chart of another kind electronic equipment disclosed in the embodiment of the present application.
Specific embodiment
Below in conjunction with the attached drawing in the embodiment of the present application, technical solutions in the embodiments of the present application carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of embodiments of the present application, instead of all the embodiments.It is based on
Embodiment in the application, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall in the protection scope of this application.
In the prior art, WDRR queue scheduling algorithm is since simple with algorithm, computation complexity is low, is easy in hardware
The advantages that realizing in equipment is widely used.However, lacking unified mechanism pair for various types of data flow
Queue is scheduled, and anti-delay variation is poor.
Therefore, the embodiment of the present application discloses a kind of array dispatching method, realizes delay of control shake.
Referring to Fig. 1, a kind of flow chart of array dispatching method disclosed in the embodiment of the present application, as shown in Figure 1, comprising:
S101: the bandwidth and packet loss of data packet in queue output end preset period of time are obtained；
In this step, using the packet loss of the bandwidth of queue output end regular monitoring data packet, and by obtain it is default when
Between in the period bandwidth of data packet and packet loss feed back to queue input terminal.
S102: it is based on the bandwidth and the packet loss, determines the adjusting parameter of queue bandwidth；
Further, the bandwidth and packet loss based on data packet in preset period of time are to bandwidth resources needed for data flow
Pre-estimation is carried out, determines the adjusting parameter of queue bandwidth.
S103: determining the scheduling weight of each object queue according to the adjusting parameter, and by the power of the object queue
It is the scheduling weight that value, which refreshes, to be scheduled using the scheduling weight to the object queue.
In the present embodiment, based on the adjusting parameter of the queue bandwidth of above-mentioned determination, each queue for needing to dispatch is determined
Weight is dispatched, and refreshes the weight of each queue, object queue is scheduled according to updated weight, by for difference
The data flow of type carries out analysis and regulation, effectively measures the weight that different queue needs to distribute in the scheduling process of each round.
By above scheme it is found that a kind of array dispatching method provided by the present application, comprising: it is default to obtain queue output end
The bandwidth and packet loss of data packet in time cycle；Based on the bandwidth and the packet loss, the adjustment ginseng of queue bandwidth is determined
Number；The scheduling weight of each object queue is determined according to the adjusting parameter, and the weight of the object queue is refreshed as institute
Scheduling weight is stated, to be scheduled using the scheduling weight to the object queue.The application is by utilizing bandwidth and packet loss
The adjusting parameter dynamic that rate determines adjusts the weight of each queue, to control time interval and the team of each round queue scheduling
Column length achievees the purpose that delay of control is shaken, and improves resource utilization.
The embodiment of the present application discloses another array dispatching method, and relative to a upper embodiment, the present embodiment is to upper one
Determine that the process of the adjusting parameter of queue bandwidth has made further instruction and optimization in embodiment.It is specific:
Referring to fig. 2, the flow chart of another array dispatching method provided by the embodiments of the present application, as shown in Figure 2, comprising:
S201: the bandwidth and packet loss of data packet in queue output end preset period of time are obtained；
S202: judge whether the bandwidth is less than default minimum bandwidth；
S203: if the bandwidth is less than the default minimum bandwidth, judge whether the packet loss is less than default minimum
Packet loss；
S204: if it is, the inverse of bandwidth gain is determined as the adjusting parameter；Wherein, the bandwidth gain is
The difference of the bandwidth and effective bandwidth actually distributed accounts for the percentage of the effective bandwidth；
S205: if the band is wider than default minimum bandwidth, judge whether the bandwidth is greater than default maximum bandwidth；
S206: if the band is wider than the default maximum bandwidth, judge whether the packet loss is greater than default maximum
Packet loss；
S207: if it is, the bandwidth gain is determined as the adjusting parameter；
In the present embodiment, gets in preset period of time after the bandwidth of data packet and packet loss, whether judge bandwidth
Less than default minimum bandwidth, if it is, further judging whether packet loss is less than default minimum packet loss, if bandwidth is less than in advance
If minimum bandwidth, and packet loss is less than default minimum packet loss, then the inverse of bandwidth gain is determined as to the adjusting parameter of bandwidth；
If band is wider than default minimum bandwidth, further judge whether packet loss is greater than default maximum packet loss, if packet loss
Greater than default maximum packet loss, then bandwidth gain is determined as adjusting parameter.Wherein, bandwidth gain be the bandwidth actually distributed with
The difference of effective bandwidth accounts for the percentage of effective bandwidth.
In addition, and packet loss is lost between default maximum if bandwidth is between default maximum bandwidth and default minimum bandwidth
Between packet rate and default minimum packet loss, then the adjusting parameter for being determined as queue for 1 remains unchanged.
S208: determining the scheduling weight of each object queue according to the adjusting parameter, and by the power of the object queue
It is the scheduling weight that value, which refreshes, to be scheduled using the scheduling weight to the object queue.
Further, for determining that the process of the scheduling weight of each object queue is illustrated according to adjusting parameter.
Fig. 3 is the flow chart of another array dispatching method provided by the embodiments of the present application, as shown in figure 3, queue scheduling
Method includes:
S301: the bandwidth and packet loss of data packet in queue output end preset period of time are obtained；
S302: it is based on the bandwidth and the packet loss, determines the adjusting parameter of queue bandwidth；
S303: the bandwidth allocation value of each object queue is determined according to the adjusting parameter, and utilizes the bandwidth allocation
Value calculates the bandwidth allocation value summation of all queues；
S304: determining that the bandwidth allocation value of the object queue accounts for the rate of specific gravity of the bandwidth allocation value summation, will
Scheduling weight of the rate of specific gravity as the object queue, and the weight of the object queue is refreshed as scheduling power
Value, to be scheduled using the scheduling weight to the object queue.
It is understood that the present embodiment determines the bandwidth allocation value of each object queue according to adjusting parameter, and calculate
The bandwidth allocation value summation of all object queues.Further, it is determined that the bandwidth allocation value of each object queue accounts for bandwidth allocation
It is worth the rate of specific gravity of summation, obtains the scheduling weight of each object queue, and refresh the weight of each object queue, thus based on brush
Weight is scheduled object queue after new.
A kind of queue scheduling system provided by the embodiments of the present application is introduced below, a kind of queue tune described below
Degree system can be cross-referenced with a kind of above-described array dispatching method.
Referring to fig. 4, the structure chart of a kind of queue scheduling system provided by the embodiments of the present application, as shown in Figure 4, comprising:
Module 100 is obtained, for obtaining the bandwidth and packet loss of data packet in queue output end preset period of time；
Determining module 200 determines the adjusting parameter of queue bandwidth for being based on the bandwidth and the packet loss；
Refresh module 300, for determining the scheduling weight of each object queue according to the adjusting parameter, and by the mesh
It is the scheduling weight that the weight for marking queue, which refreshes, to be scheduled using the scheduling weight to the object queue.
Further, in queue scheduling system provided by the embodiments of the present application, the determining module includes:
First judging unit, for judging whether the bandwidth is less than default minimum bandwidth；
Whether second judgment unit judges the packet loss if being less than the default minimum bandwidth for the bandwidth
Less than default minimum packet loss；
First determination unit, if being less than default minimum packet loss for the packet loss, by the inverse of bandwidth gain
It is determined as the adjusting parameter；Wherein, the bandwidth gain is that the difference of the bandwidth and effective bandwidth actually distributed accounts for and described has
Imitate the percentage of bandwidth.
Further, in queue scheduling system provided by the embodiments of the present application, the determining module further include:
Third judging unit, after judging whether the bandwidth is less than default minimum bandwidth, if the band is wider than
Default minimum bandwidth, then judge whether the bandwidth is greater than default maximum bandwidth；
Whether 4th judging unit judges the packet loss if being wider than the default maximum bandwidth for the band
Greater than default maximum packet loss；
Second determination unit, it is if being greater than default maximum packet loss for the packet loss, the bandwidth gain is true
It is set to the adjusting parameter.
Further, in queue scheduling system provided by the embodiments of the present application, the refresh module, comprising:
Third determination unit for determining the bandwidth allocation value of each object queue according to the adjusting parameter, and utilizes
The bandwidth allocation value calculates the bandwidth allocation value summation of all queues；
4th determination unit, for determining that the bandwidth allocation value of the object queue accounts for the bandwidth allocation value summation
Rate of specific gravity, using the rate of specific gravity as the scheduling weight of the object queue.
Present invention also provides a kind of electronic equipment, referring to Fig. 5, the knot of a kind of electronic equipment provided by the embodiments of the present application
Composition, as shown in Figure 5, comprising:
Memory 11, for storing computer program；
Step provided by above-described embodiment may be implemented in processor 12 when for executing the computer program.
Specifically, memory 11 includes non-volatile memory medium, built-in storage.The non-volatile memory medium is stored with
Operating system and computer-readable instruction, the built-in storage are the operating system and computer-readable in non-volatile memory medium
The operation of instruction provides environment.Processor 12 can be a central processing unit (Central in some embodiments
Processing Unit, CPU), controller, microcontroller, microprocessor or other data processing chips, mentioned for electronic equipment
For calculating and control ability.
On the basis of the above embodiments, preferably, referring to Fig. 6, the electronic equipment further include:
Input interface 13 is connected with processor 12, for obtaining computer program, parameter and the instruction of external importing, warp
The control of processor 12 is saved into memory 11.The input interface 13 can be connected with input unit, receive user and be manually entered
Parameter or instruction.The input unit can be the touch layer covered on display screen, be also possible to be arranged in terminal enclosure by
Key, trace ball or Trackpad are also possible to keyboard, Trackpad or mouse etc..
Display unit 14 is connected with processor 12, for the data of the processing of video-stream processor 12 and for showing visually
The user interface of change.The display unit 14 can be light-emitting diode display, liquid crystal display, touch-control liquid crystal display and OLED
(Organic Light-Emitting Diode, Organic Light Emitting Diode) touches device etc..
The network port 15 is connected with processor 12, for being communicatively coupled with external each terminal device.The communication connection
The used communication technology can be cable communicating technology or wireless communication technique, such as mobile high definition chained technology (MHL), general
Universal serial bus (USB), high-definition media interface (HDMI), adopting wireless fidelity technology (WiFi), Bluetooth Communication Technology, low-power consumption bluetooth
The communication technology, communication technology based on IEEE802.11s etc..
Fig. 6 illustrates only the electronic equipment with component 11-15, it will be appreciated by persons skilled in the art that Fig. 6 is shown
Structure do not constitute the restriction to electronic equipment, may include more certain than illustrating less perhaps more components or combination
Component or different component layouts.
Present invention also provides a kind of computer readable storage medium, the storage medium may include: USB flash disk, mobile hard disk,
Read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic
The various media that can store program code such as dish or CD.Computer program, the calculating are stored on the storage medium
Machine program realizes aforementioned disclosed any one array dispatching method when being executed by processor.
By above scheme it is found that a kind of array dispatching method provided by the present application, comprising: it is default to obtain queue output end
The bandwidth and packet loss of data packet in time cycle；Based on the bandwidth and the packet loss, the adjustment ginseng of queue bandwidth is determined
Number；The scheduling weight of each object queue is determined according to the adjusting parameter, and the weight of the object queue is refreshed as institute
Scheduling weight is stated, to be scheduled using the scheduling weight to the object queue.The application is by utilizing bandwidth and packet loss
The adjusting parameter dynamic that rate determines adjusts the weight of each queue, to control time interval and the team of each round queue scheduling
Column length achievees the purpose that delay of control is shaken, and improves resource utilization.
Each embodiment is described in a progressive manner in specification, the highlights of each of the examples are with other realities
The difference of example is applied, the same or similar parts in each embodiment may refer to each other.For system disclosed in embodiment
Speech, since it is corresponded to the methods disclosed in the examples, so being described relatively simple, related place is referring to method part illustration
?.It should be pointed out that for those skilled in the art, under the premise of not departing from the application principle, also
Can to the application, some improvement and modification can also be carried out, these improvement and modification also fall into the protection scope of the claim of this application
It is interior.
It should also be noted that, in the present specification, relational terms such as first and second and the like be used merely to by
One entity or operation are distinguished with another entity or operation, without necessarily requiring or implying these entities or operation
Between there are any actual relationship or orders.Moreover, the terms "include", "comprise" or its any other variant meaning
Covering non-exclusive inclusion, so that the process, method, article or equipment for including a series of elements not only includes that
A little elements, but also including other elements that are not explicitly listed, or further include for this process, method, article or
The intrinsic element of equipment.In the absence of more restrictions, the element limited by sentence "including a ...", is not arranged
Except there is also other identical elements in the process, method, article or apparatus that includes the element.
Claims (10)
1. a kind of array dispatching method characterized by comprising
Obtain the bandwidth and packet loss of data packet in queue output end preset period of time；
Based on the bandwidth and the packet loss, the adjusting parameter of queue bandwidth is determined；
The scheduling weight of each object queue is determined according to the adjusting parameter, and the weight of the object queue is refreshed as institute
Scheduling weight is stated, to be scheduled using the scheduling weight to the object queue.
2. array dispatching method according to claim 1, which is characterized in that described to be based on the bandwidth and the packet loss
Rate determines the adjusting parameter of queue bandwidth, comprising:
Judge whether the bandwidth is less than default minimum bandwidth；
If the bandwidth is less than the default minimum bandwidth, judge whether the packet loss is less than default minimum packet loss；
If it is, the inverse of bandwidth gain is determined as the adjusting parameter；Wherein, the bandwidth gain is practical distributes
The difference of bandwidth and effective bandwidth accounts for the percentage of the effective bandwidth.
3. array dispatching method according to claim 2, which is characterized in that described to judge whether the bandwidth is less than default
After minimum bandwidth, further includes:
If the band is wider than default minimum bandwidth, judge whether the bandwidth is greater than default maximum bandwidth；
If the band is wider than the default maximum bandwidth, judge whether the packet loss is greater than default maximum packet loss；
If it is, the bandwidth gain is determined as the adjusting parameter.
4. array dispatching method according to any one of claims 1 to 3, which is characterized in that described to be joined according to the adjustment
Number determines the scheduling weight of each object queue, comprising:
The bandwidth allocation value of each object queue is determined according to the adjusting parameter, and is calculated and owned using the bandwidth allocation value
The bandwidth allocation value summation of queue；
Determine that the bandwidth allocation value of the object queue accounts for the rate of specific gravity of the bandwidth allocation value summation, by the rate of specific gravity
Scheduling weight as the object queue.
5. a kind of queue scheduling system characterized by comprising
Module is obtained, for obtaining the bandwidth and packet loss of data packet in queue output end preset period of time；
Determining module determines the adjusting parameter of queue bandwidth for being based on the bandwidth and the packet loss；
Refresh module, for determining the scheduling weight of each object queue according to the adjusting parameter, and by the object queue
Weight refresh be the scheduling weight, to be scheduled using the scheduling weight to the object queue.
6. queue scheduling system according to claim 5, which is characterized in that the determining module includes:
First judging unit, for judging whether the bandwidth is less than default minimum bandwidth；
Second judgment unit judges whether the packet loss is less than if being less than the default minimum bandwidth for the bandwidth
Default minimum packet loss；
First determination unit determines the inverse of bandwidth gain if being less than default minimum packet loss for the packet loss
For the adjusting parameter；Wherein, the bandwidth gain is that the difference of the bandwidth and effective bandwidth actually distributed accounts for effective band
Wide percentage.
7. queue scheduling system according to claim 6, which is characterized in that the determining module further include:
Third judging unit, after judging whether the bandwidth is less than default minimum bandwidth, if the band be wider than it is default
Minimum bandwidth, then judge whether the bandwidth is greater than default maximum bandwidth；
4th judging unit judges whether the packet loss is greater than if being wider than the default maximum bandwidth for the band
Default maximum packet loss；
The bandwidth gain is determined as by the second determination unit if being greater than default maximum packet loss for the packet loss
The adjusting parameter.
8. according to the described in any item queue scheduling systems of claim 5 to 7, which is characterized in that the refresh module, comprising:
Third determination unit, for determining the bandwidth allocation value of each object queue according to the adjusting parameter, and described in utilization
Bandwidth allocation value calculates the bandwidth allocation value summation of all queues；
4th determination unit, for determining that the bandwidth allocation value of the object queue accounts for the ratio of the bandwidth allocation value summation
Weight values, using the rate of specific gravity as the scheduling weight of the object queue.
9. a kind of electronic equipment characterized by comprising
Memory, for storing computer program；
Processor, realizing the array dispatching method as described in any one of Claims 1-4 when for executing the computer program
Step.
10. a kind of computer readable storage medium, which is characterized in that be stored with computer on the computer readable storage medium
Program realizes the step of the array dispatching method as described in any one of Claims 1-4 when the computer program is executed by processor
Suddenly.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910041078.0A CN109547362A (en) | 2019-01-16 | 2019-01-16 | A kind of array dispatching method, system and electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910041078.0A CN109547362A (en) | 2019-01-16 | 2019-01-16 | A kind of array dispatching method, system and electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109547362A true CN109547362A (en) | 2019-03-29 |
Family
ID=65835662
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910041078.0A Withdrawn CN109547362A (en) | 2019-01-16 | 2019-01-16 | A kind of array dispatching method, system and electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109547362A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110389833A (en) * | 2019-06-28 | 2019-10-29 | 北京大学深圳研究生院 | A kind of performance scheduling method and system of processor |
| CN113162790A (en) * | 2020-01-22 | 2021-07-23 | 华为技术有限公司 | Method, device, equipment and storage medium for adjusting service level |
| CN116155817A (en) * | 2023-02-24 | 2023-05-23 | 云南电网有限责任公司电力科学研究院 | Data polling scheduling method and device, equipment and storage medium |
-
2019
- 2019-01-16 CN CN201910041078.0A patent/CN109547362A/en not_active Withdrawn
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110389833A (en) * | 2019-06-28 | 2019-10-29 | 北京大学深圳研究生院 | A kind of performance scheduling method and system of processor |
| CN110389833B (en) * | 2019-06-28 | 2023-06-16 | 北京大学深圳研究生院 | Performance scheduling method and system for processor |
| CN113162790A (en) * | 2020-01-22 | 2021-07-23 | 华为技术有限公司 | Method, device, equipment and storage medium for adjusting service level |
| CN113162790B (en) * | 2020-01-22 | 2023-10-03 | 华为技术有限公司 | Method, device, equipment and storage medium for adjusting service level |
| CN116155817A (en) * | 2023-02-24 | 2023-05-23 | 云南电网有限责任公司电力科学研究院 | Data polling scheduling method and device, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Khemka et al. | Utility maximizing dynamic resource management in an oversubscribed energy-constrained heterogeneous computing system | |
| CN109547362A (en) | A kind of array dispatching method, system and electronic equipment and storage medium | |
| CN109032801A (en) | A kind of request scheduling method, system and electronic equipment and storage medium | |
| US9614782B2 (en) | Continuous resource pool balancing | |
| Adnan et al. | Energy efficient geographical load balancing via dynamic deferral of workload | |
| US20160358305A1 (en) | Starvation free scheduling of prioritized workloads on the gpu | |
| CN103324525B (en) | Method for scheduling task under a kind of cloud computing environment | |
| US8547840B1 (en) | Bandwidth allocation of bursty signals | |
| De Assuncao et al. | Impact of user patience on auto-scaling resource capacity for cloud services | |
| KR20080041047A (en) | Apparatus and method for load balancing in multi core processor system | |
| CN104268018B (en) | Job scheduling method and job scheduler in a kind of Hadoop clusters | |
| US9304814B2 (en) | Determine variable wait time in an asynchronous call-back system based on calculated average sub-queue wait time | |
| Xu et al. | Geographic trough filling for internet datacenters | |
| CN103229125A (en) | Dynamic power balancing among blade servers in chassis | |
| JP2015127955A (en) | Dynamic thermal budget allocation for memory array | |
| CN109634915A (en) | File dispositions method, Cloud Server, system and storage medium | |
| WO2018085167A1 (en) | Thread importance based processor core partitioning | |
| CN109327540A (en) | Electronic device, server load balancing method and storage medium | |
| CN112801331B (en) | Shaping of computational loads with virtual capacity and preferred location real-time scheduling | |
| CN111178581B (en) | Power demand response distribution method and device | |
| CN109684080A (en) | Centralized method for scheduling task, system and storage medium | |
| CN109710330A (en) | Method for determining operation parameters, device, terminal and the storage medium of application program | |
| US9342136B2 (en) | Dynamic thermal budget allocation for multi-processor systems | |
| CN104679444A (en) | Dynamic adjustment method and device for virtualized storage resources | |
| CN107872405A (en) | Distributed bandwidth allocation and regulation |
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 | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20190329 |
|
| WW01 | Invention patent application withdrawn after publication |