CN101860472A - Data scheduling method, switch and network system - Google Patents
Data scheduling method, switch and network system Download PDFInfo
- Publication number
- CN101860472A CN101860472A CN200910131211A CN200910131211A CN101860472A CN 101860472 A CN101860472 A CN 101860472A CN 200910131211 A CN200910131211 A CN 200910131211A CN 200910131211 A CN200910131211 A CN 200910131211A CN 101860472 A CN101860472 A CN 101860472A
- Authority
- CN
- China
- Prior art keywords
- connection
- weight
- scheduled
- public
- data 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.)
- Granted
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the invention discloses a data scheduling method, a switchboard and a network system, which relates to the data scheduling field and solves the problem of low data-scheduling efficiency. The data scheduling method comprises the following steps: parallelly acquiring the connecting weight of each connection to be scheduled; parallelly comparing the connecting weight of each connection to be scheduled with a preset public weight; according to the comparison result, selecting connections to be scheduled conforming to preset conditions as valid connections; finally selecting one from the valid connections as a target connection; and finally carrying out data scheduling on the target connection. The technical scheme provided by the invention is applicable to multi-connection data scheduling.
Description
Technical field
The present invention relates to field of data transmission, relate in particular to a kind of data dispatching method, switch and network system.
Background technology
In Ethernet, because resource-constrained must solve a plurality of connections and compete the problem of using resource transmission message simultaneously, adopts data dispatch to solve usually, be engraved in when being a certain in a plurality of connections that are linked in the switch and select one and dispatch, send the data in this connection.
Repeating query class algorithm is a widely used class data dispatch algorithm in switch at present, as WRR (Weighted Round Robin, weighted round ring) algorithm, RR (Round Robin, repeating query algorithm) etc.WRR is a kind of repeating query class algorithm that is widely used in the data dispatch, adopts the mode of circulation to send the data that each connects.The WRR algorithm is provided with corresponding weight for each connection, when each data dispatch starts, the position of scheduling is searched connection in order one by one since the last time, up to finding first weight non-0 and connections to be sent such as data being arranged, with the result of this connection as this data dispatch, send the data in this connection, and will connect corresponding weight and subtract 1; When the weight of all connections be 0 or all data that connect all send when finishing, the weight of each connection is reverted to initial value.
The process that switch use WRR algorithm is finished data dispatch is as follows: when switch starts, adopt the WRR algorithm for each connection corresponding weight to be set, weight at this moment is an initial value; Generally speaking when each data dispatch starts, the position of scheduling is searched connection in order one by one since the last time, up to finding first weight non-0 and connections to be sent such as data being arranged, with the result of this connection as this data dispatch, send the data in this connection, and will connect corresponding weight and subtract 1; When the weight of all connections be 0 or all data that connect all send when finishing, the weight of each connection is reverted to initial value.
Because when searching at every turn, all might run into weight and be 0 or do not wait the connection of data to be sent, though these connections are not for further processing, but still consumed portion of time, when a plurality of continuous this connection, to waste of time is clearly, has directly caused the reduction of data dispatch efficient.
In realizing process of the present invention, the inventor finds that there are the following problems at least in the prior art:
Use the mode of repeating query to carry out data dispatch, as use WRR to carry out data dispatch, need search many connects and could obtain a weight non-0 and connection to be sent such as data is arranged, it is longer to search required time, especially work as number of connection more for a long time, this phenomenon is particularly serious, causes data dispatch efficient low.
Summary of the invention
Embodiments of the invention provide a kind of data dispatching method, switch and network system, have improved data dispatch efficient.
Embodiments of the invention provide a kind of data dispatching method, comprising:
The parallel connection weight of every connection to be scheduled that obtains;
The connection weight of parallel more every connection to be scheduled and the public weight that sets in advance;
According to comparative result, choose and meet pre-conditioned connection to be scheduled as effectively connecting;
Choosing a target from described effective connection connects;
Data dispatch is carried out in described target connection.
Embodiments of the invention also provide a kind of switch, comprising:
The weight acquisition module that walks abreast is used for the parallel connection weight of every connection to be scheduled that obtains;
The weight comparison module that walks abreast is used for the connection weight of parallel more every connection to be scheduled and the public weight that sets in advance;
Effectively connect and choose module, be used to choose described connection weight greater than and/or the connection that equals the pending data dispatch of described public weight as effectively connecting;
Target connects chooses module, is used for according to comparative result, chooses to meet pre-conditioned connection to be scheduled as effectively connecting;
Scheduler module is used for data dispatch is carried out in described target connection.
Embodiments of the invention also provide a kind of network system, comprise above-mentioned switch, and described switch receives the data of many connections, data dispatch is carried out in connection after, transmit the data of many connections according to the result of data dispatch.
The data dispatching method that embodiments of the invention provide, switch and network system, obtain the connection weight of every connection to be scheduled and the connection weight and the public weight that sets in advance of more every connection to be scheduled by the mode of parallel processing, and then determine effectively to connect, choosing target again from effective connection connects, data dispatch is carried out in connection to target, no matter how many numbers of connection of pending data dispatch has, can determine fast that target connects, finish data dispatch, dispatching office takes time irrelevant with number of connection, reduced and searched the required time of effective connection, improved the efficient of data dispatch.
Description of drawings
In order to be illustrated more clearly in the embodiment of the invention or technical scheme of the prior art, the accompanying drawing of required use is done to introduce simply in will describing embodiment below, apparently, accompanying drawing in describing below only is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
The flow chart of a kind of data dispatching method that Fig. 1 provides for the embodiment of the invention one;
The flow chart of a kind of data dispatching method that Fig. 2 provides for the embodiment of the invention two;
The hardware logic electric circuit figure that Fig. 3 uses for embodiments of the invention;
The flow chart of a kind of data dispatching method that Fig. 4 provides for the embodiment of the invention three;
Fig. 5 is the schematic diagram of secondary structure in the embodiment of the invention three;
The structural representation of a kind of switch that Fig. 6 provides for embodiments of the invention;
The structural representation of a kind of switch that Fig. 7 provides for another embodiment of the present invention;
The structural representation of a kind of switch that Fig. 8 provides for another embodiment of the present invention;
Fig. 9 connects the internal structure schematic diagram of choosing module 604 for target among Fig. 6.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the invention, the technical scheme in the embodiment of the invention is clearly and completely described, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills belong to the scope of protection of the invention not making the every other embodiment that is obtained under the creative work prerequisite.
In order to address the above problem, the embodiment of the invention one provides a kind of data dispatching method, uses process that this method finishes data dispatch as shown in Figure 1, comprising:
The connection weight of step 102, parallel more every connection to be scheduled and the public weight that sets in advance;
The data dispatching method that embodiments of the invention provide, obtain the connection weight of every connection to be scheduled and the connection weight and the public weight that sets in advance of more every connection to be scheduled by the mode of parallel processing, and then determine effectively to connect, choosing target again from effective connection connects, data dispatch is carried out in connection to target, no matter how many numbers of connection of pending data dispatch has, can determine fast that target connects, finish data dispatch, dispatching office takes time irrelevant with number of connection, reduced and searched the required time of effective connection, improved the efficient of data dispatch.
Except the above-mentioned reason that influences data dispatch efficient, when using the WRR algorithm to carry out data dispatch, for each connection assigns weight, when scheduling connects, the weight that connects is made amendment, the weight that needs each connection of configure hardware memory device stores, and this device frequently read and write, also can influence data dispatch efficient.
In order to solve the inefficient problem of data dispatch, the embodiment of the invention two provides a kind of data dispatching method, below in conjunction with accompanying drawing, the embodiment of the invention two is described in detail.
In the embodiment of the invention, use process that described data dispatching method carries out data dispatch as shown in Figure 2, comprising:
Step 201, the initial value of public weight is set;
In order to simplify the renewal of connection weight, the embodiment of the invention has been set up a public weight, and described public weight is used for judging whether connection is effective.Generally speaking, the initial value of described public weight can be set to an enough little number, the initial value that public weight for example is set be 0 or initial value that public weight is set be an integer all littler than all connection weights, at this moment, think that all connect all qualified transmission data; Each is taken turns data dispatch and finishes the public weight in back and add 1, less than and/or the connection weight that equals public weight think and use up, when all connection weights are all used up, public weight is reverted to initial value.Certainly, the initial value of public weight also can be set to an enough big integer, a for example all big integer than all connection weights, each is taken turns the public weight in data dispatch end back and subtracts 1, at this moment, think connection weight less than and/or the connection that equals public weight be effective connection, can be provided with needs the more connection of scheduling times to have less connection weight, for example 1 or 0.In the present embodiment, in order to discuss conveniently, exemplary hypothesis needs the more connection of scheduling times to have bigger connection weight, needs the less connection of scheduling times to have less connection weight, and the initial value of public weight is 0; Be understandable that the initial value that adopts other mode that connection weight, public weight are set is realized within the scope of also open in the present invention and the protection of technical scheme of the present invention.
Step 202, obtain current public weight;
Step 203, the parallel connection weight of whole connections and every connection that obtains;
The embodiment of the invention is provided with connection weight for each connection, and the value of connection weight can specifically be determined according to the real network situation by the network operation person.
In this step, for convenience of description, with every connection of label sign, present embodiment is connected to example with total n bar, and the label that this n bar connects is respectively 0 to n-1.
Step 204, the connection weight that is connected with every by the more current public weight of the mode of parallel processing are determined effectively to connect according to comparative result;
By hardware logic electric circuit, in the same clock cycle parallel processing is carried out in many connections, be specially and judge that whether connection is the weight empty and that relatively connect and the size of public weight, like this, just can disposablely obtain all effectively connection.This hardware logic electric circuit comprises comparator 301 as shown in Figure 3, with door 302, public weight is upgraded control circuit 303, weight comparative result output circuit 304, fixed priority scheduling input circuit 305, fixed priority scheduling output circuit 306, scheduling result output circuit 307.Comparator 301 upgrades control circuit 303 by public weight and obtains public weighted value and since every connection all corresponding comparator 301 and one and door 302, so can a clock cycle to many connection parallel processings.
In this step, use above-mentioned hardware logic electric circuit, by the mode of parallel processing, obtain effective connection, this effectively connects the connection that refers to qualified transmission data.Described effective connection need be satisfied two conditions: at first, connection can not be sky, and data to be sent are promptly arranged on connecting etc.; Secondly, the connection weight of connection is greater than and/or equals public weight.
As shown in Figure 3, when connecting when be empty, just to this connection correspondence send a request signal with door 302, this request signal is specially " 1 ", otherwise, send the request signal that a content is " 0 ".When the connection weight that connects during greater than described public weight, then should the corresponding comparator 301 of connections understand to this connection correspondence send a comparative result with door 302, the value of this comparative result is " 1 "; If the connection weight of described connection is less than described public weight, then the value of comparative result is " 0 ".Afterwards, with door 302 with the comparative result of comparator 301 output and request signal with, thereby determine final effective connection.For example, as shown in Figure 3, the connection weight and the public weight that connect n-1 compare by comparator 301, the output comparative result to door 302, the request signal that connects n-1 is 0, this request signal 0 is input comparator 301 also, therefore regardless of the comparative result of comparator 301, because request signal is 0 (it is empty promptly to connect n-1), the result who exports with door 302 is 0, is not effective connection so connect n-1; In like manner, when a result with door 302 outputs who connects correspondence was 1, then this connection was effective connection; Wherein, each connect with the comparative result of own connection weight and public weight and own request signal with, be that 1 this connection is effective connection as if exporting the result, as if being output as 0 otherwise be not effective connection.Certainly, here 0,1 be a kind of expression, also can represent with other number, do not do here and give unnecessary details.
In the present embodiment, for each scheduling position of connect adding 1bit, be used to write down judged result, the setting principle of scheduling position is: if connect effectively, be 1 with the deployment position of this connection; If it is invalid to connect, be 0 with the deployment position of this connection.Through each being connected the setting of scheduling place value, judged result further can be simplified to the form of binary number, each bar connects all should binary number one, has improved subsequent treatment efficient.In the present embodiment, the first time after supposing the system starts, the corresponding label that connects of the lowest order of initialization binary number was 0 during data dispatch, and the corresponding label that connects of the highest order of binary number is n-1.
Step 205, from described effective connection, select a connection to dispatch;
Owing to each data dispatch can only be dispatched a connection,, be used for selecting effective a connection to dispatch so after having obtained all effectively connection, also need to formulate a selection strategy.
Connection of selection is dispatched and can is from described effective connection: for each connection is provided with priority, select the highest the connecting effective a connection as target of priority, data dispatch is carried out in described target connection.
In this step, from the numerical digit of repeating query pointed, first " 1 " the pairing connection that obtains along the repeating query direction is target and connects, and this target is connected carry out data dispatch, this target is connected etc. data to be sent send.
In this step, for each connection is provided with priority, be specially, repeating query pointer and repeating query direction are set, the priority of the connection of repeating query pointed is set to the highest, and according to the repeating query direction, each priority that connects reduces successively.For example, if this data dispatch is the data dispatch first time after the system start-up, then the priority of the connection of the lowest order correspondence of the binary number of step 204 acquisition is set to the highest, described repeating query pointed should be connected, with binary number by low level to the direction of a high position as the repeating query direction, the priority of the connection of high-order more correspondence is low more; If carried out data dispatch before this data dispatch, then the connection with last data dispatch connects as limit priority along connection adjacent on the repeating query direction, the repeating query pointed should be connected, with binary number (opposite direction of poll direction) cyclic shift to the right, till the corresponding lowest order of the connection of repeating query pointed, with binary number by low level to the direction of a high position as the repeating query direction.For example, if the connection label of last scheduling is 2, then this is 3 the connection connection as limit priority to connect label, and right shift, and the bit position that to label is 3 connection correspondence is till the lowest order.
Step 206, output scheduling result;
In this step, need the output scheduling result, be specially the label that output is scheduled and connects.In step 204, the numerical digit of the binary number that connection is corresponding is corresponding with the initial label of connection, because shifting function is arranged in step 205, causing the position that is connected when being scheduled that is scheduled not is initial position, so after finishing data dispatch, need carry out the shift reverse of same figure place according to the result of step 205 displacement, be about to the state before each order recovery that connects arrives scheduling, like this, the connection that is scheduled just can be got back on the initial position, and the initial position of exporting this connection is as scheduling result.The scheduling result here can be used as the foundation of determining the repeating query pointer position when next time dispatching in the step 205.
In the embodiment of the invention, data dispatch of every startup, the execution in step that will circulate 204 is to step 206.When scheduling starts, be according to finishing scheduling to the order that connects n-1, so think and just finished one and take turns scheduling when the repeating query pointer points to when connecting 0 (be invalid connection if connect 0, then be process connection 0 o'clock) once more from connecting 0.
Step 207, finish one take turns the scheduling that all effectively connect after, revise public weight;
In this step, if, revise the value of public weight, the value of described public weight is increased or reduces a step value.
Because present embodiment has bigger connection weight to need the more connection of scheduling times, need the less connection of scheduling times to have less connection weight, the initial value of public weight is that 0 situation is that example describes, so finish one take turns scheduling after, described public weight is increased a step value.Described step value is an arbitrary integer, as long as meet the setting of the connection weight that public weight is connected with each, if the value of public weight and connection weight is bigger, then bigger step value can be set; If the value of public weight and connection weight is less, then the smaller step size value can be set.
The embodiment of the invention is made as 1 with step value, the value of public weight is added 1 after taking turns the scheduling that all effectively connect finishing one.Conspicuous, described step value also can wait other integers for 2 or 3, and the present invention illustrates no longer one by one.
Step 208, judge whether to exist effective connection;
In this step, revise the new public weight that obtains, judge whether to exist effective connection, be specially and judge whether to exist the connection of connection weight greater than described public weight newly according to step 207.
Connect if exist effectively, think and to continue to carry out data dispatch, at this moment, enter step 202.If can not, then needing to restPose, concrete steps are as follows.
Step 209, if there is no effectively connection revert to initial value with public weight; Can return the data dispatch that step 202 is carried out next round afterwards.
The data dispatching method that embodiments of the invention provide, obtain the connection weight of every connection to be scheduled and the connection weight and the public weight that sets in advance of more every connection to be scheduled by the mode of parallel processing, and then determine effectively to connect, choosing target again from effective connection connects, data dispatch is carried out in connection to target, no matter how many numbers of connection of pending data dispatch has, can determine fast that target connects, finish data dispatch, dispatching office takes time irrelevant with number of connection, reduced and searched the required time of effective connection, improved the efficient of data dispatch.Connect current scheduling situation with each bar of binary number representation, make follow-up processing simpler, further improved the efficient of data dispatch.Use public weight, only need carry out read-write operation, simplified the troublesome operation of respectively each connection weight being operated respectively in the prior art, do not need a large amount of hardware supports, reduced hardware cost public weight.
Below in conjunction with accompanying drawing, the embodiment of the invention three is described.
Connecting number more for a long time, in order to improve the performance of whole dispatching patcher, usually adopt hierarchical structure, the embodiment of the invention provides a kind of data dispatching method, can finish data dispatch under hierarchical structure, and concrete steps comprise as shown in Figure 4:
The embodiment of the invention is that example describes with the secondary structure, with reference to Fig. 5, a plurality of FPDP 501 is arranged in this structure, comprises at least one under each FPDP and connects 502.The data dispatching method that the embodiment of the invention provides also is applicable to multilevel hierarchy, and it realizes that principle is identical with secondary structure.
In this step, for each port is provided with the port weight, and the public weight of port is set, obtain the connection that comprises pending data dispatch and weight greater than the port of the public weight of port as effective port, from described effective port, choose a port as target port, data dispatch is carried out in the connection under the target port.Choose step 205 in the principle of target port and the embodiment of the invention two to the description of step 207 and be as good as, just operand is a port, so no longer describe in detail at this.
After step 402 was confirmed target port, this step need be dispatched a connection under this port.Step 202 to the description of step 207 of selecting a connection to finish in the data dispatch process and the embodiment of the invention two in this step is as good as, and repeats no more.
Optionally, also can carry out taking turns scheduling, reselect target port afterwards again and carry out data dispatch whole connections of target port.
The scheduling result of data dispatch is carried out in step 404, output to this port;
This step is specially the label that the port label of the connection corresponding port of output scheduling is connected with this;
Wherein, after the step 404, exported a connection of this port carried out the scheduling result of data dispatch after, can return step 402 and reselect port, also can return next bar that step 403 continues to select this port and connect and takes turns data dispatch up to the connection of this port is finished one.
In this step,, revise the value of the public weight of port, be specially public weighted value is added 1 if after finishing a scheduling of taking turns whole effectively ports.
In this step, revise the public weight of new port obtain, judge whether to exist effective port, be specially and judge whether to exist the port of port weight greater than the described new public weight of port according to step 405.
If there is effective port, think and can continue to carry out data dispatch, at this moment, enter step 402.If there is no effective port then needs to restPose execution in step 407.
The data dispatching method that embodiments of the invention provide more for a long time, carries out classification with connection at number of connection, finishes data dispatch step by step.Be specially by the mode of parallel processing and obtain effective port, select target port from described effective port is dispatched the effective connection under this target port.No matter how many numbers of connection of pending data dispatch has, and can determine fast that target connects, and finishes data dispatch, dispatching office take time and number of connection irrelevant, reduced and searched the required time of effective connection, improved the efficient of data dispatch.
Embodiments of the invention also provide a kind of switch, and the structure of this switch comprises as shown in Figure 6:
The weight acquisition module 601 that walks abreast is used for the parallel connection weight of every connection to be scheduled that obtains;
The weight comparison module 602 that walks abreast is used for the connection weight of parallel more every connection to be scheduled and the public weight that sets in advance;
Effectively module 603 is chosen in connection, is used for according to comparative result, chooses to meet pre-conditioned connection to be scheduled as effectively connecting;
Target connects chooses module 604, is used for choosing effective connection that module 603 chooses from described effective connection and chooses a target and connect;
Further, above-mentioned switch also comprises as shown in Figure 7:
Public weight is provided with module 606, is used to be provided with the initial value of public weight; Or,
Described effective connection choose module 603 chosen effectively connect after, revise described public weight, the value of described public weight is increased or reduces a step value; Or,
If all connections to be scheduled all do not meet pre-conditioned or all to meet pre-conditioned connection to be scheduled all be empty, be the initial value that sets in advance with public weight modification.
Further, above-mentioned switch also comprises as shown in Figure 8:
Further, described target connect choose module 604 internal structure as shown in Figure 9, comprising:
Target connects determining unit 6042, is used for the definite result according to described priority determining unit 6041, selects the highest the connecting as target effective a connection of priority.
When using above-mentioned switch to finish data dispatch, at first, the parallel acquisition module 601 of weight obtains the connection weight that each waits to dispatch connection, connection weight and the public weight that sets in advance by parallel comparison module 602 more every the connections to be scheduled of weight, choose module 603 according to comparative result by effective connection, choose and meet pre-conditioned connection to be scheduled as effectively connecting, be specially choose described connection weight greater than and/or the connection that equals the pending data dispatch of described public weight as effectively connecting, referring to the step 204 among Fig. 2; The target connection is chosen module 604 and is chosen a target connection, referring to the step 205 among Fig. 2; 605 pairs of these targets of debugging module connect carries out data dispatch.
After finishing data dispatch, also exist effectively according to whether to connect, call public weight module 606 is set, finishing data dispatch after, revise public weight, with the value increase of described public weight or reduce by a step value; If all connections to be scheduled all do not meet pre-conditioned or all to meet pre-conditioned connection to be scheduled all be empty, be the initial value that sets in advance with public weight modification.
Embodiments of the invention also provide a kind of network system, and this network system comprises above-mentioned switch, and described switch receives the data of many connections, data dispatch is carried out in connection after, transmit the data of many connections according to the result of data dispatch.Described switch is chosen effective connection from the connection a plurality of to be scheduled that is connected to this switch, choose a target by the parallel processing mode from described effective connection and connect, and dispatches the data to be sent that this target connects.Idiographic flow is referring to Fig. 2.
Switch that embodiments of the invention provide and network system, can combine with a kind of data dispatching method that embodiments of the invention provide, public weight is set, obtain the connection weight of every connection to be scheduled and the connection weight and the public weight that sets in advance of more every connection to be scheduled by the mode of parallel processing, and then determine effectively to connect, choosing target again from effective connection connects, data dispatch is carried out in connection to target, no matter how many numbers of connection of pending data dispatch has, can determine fast that target connects, finish data dispatch, dispatching office takes time irrelevant with number of connection, reduced and searched the required time of effective connection, improved the efficient of data dispatch.
One of ordinary skill in the art will appreciate that and realize that all or part of step that the foregoing description method is carried is to instruct relevant hardware to finish by program, described program can be stored in a kind of computer-readable recording medium, this program comprises one of step or its combination of method embodiment when carrying out.
In addition, each functional unit in each embodiment of the present invention can be integrated in the processing module, also can be that the independent physics in each unit exists, and also can be integrated in the module two or more unit.Above-mentioned integrated module both can adopt the form of hardware to realize, also can adopt the form of software function module to realize.If described integrated module realizes with the form of software function module and during as independently production marketing or use, also can be stored in the computer read/write memory medium.
The above-mentioned storage medium of mentioning can be a read-only memory, disk or CD etc.
The above; only be the specific embodiment of the present invention, but protection scope of the present invention is not limited thereto, anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; can expect easily changing or replacing, all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of described claim.
Claims (11)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009101312118A CN101860472B (en) | 2009-04-09 | 2009-04-09 | Data scheduling method, switchboard and network system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009101312118A CN101860472B (en) | 2009-04-09 | 2009-04-09 | Data scheduling method, switchboard and network system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101860472A true CN101860472A (en) | 2010-10-13 |
| CN101860472B CN101860472B (en) | 2012-08-22 |
Family
ID=42946141
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009101312118A Active CN101860472B (en) | 2009-04-09 | 2009-04-09 | Data scheduling method, switchboard and network system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101860472B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105122704A (en) * | 2013-04-18 | 2015-12-02 | Lg电子株式会社 | Methods and devices for transmitting scheduling request in wireless access system |
| CN106453142A (en) * | 2016-09-20 | 2017-02-22 | 盛科网络（苏州）有限公司 | Method and system for reducing WRR scheduling period jitter |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1314234C (en) * | 2002-07-05 | 2007-05-02 | 中兴通讯股份有限公司 | Multi-channel weiighted polling method and device |
| CN100550825C (en) * | 2004-12-29 | 2009-10-14 | 中兴通讯股份有限公司 | A kind of quick Weight Round Robin method and quick Weight Round Robin device |
| CN100456744C (en) * | 2006-07-13 | 2009-01-28 | 华为技术有限公司 | A data scheduling method and system |
-
2009
- 2009-04-09 CN CN2009101312118A patent/CN101860472B/en active Active
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105122704A (en) * | 2013-04-18 | 2015-12-02 | Lg电子株式会社 | Methods and devices for transmitting scheduling request in wireless access system |
| US9801164B2 (en) | 2013-04-18 | 2017-10-24 | Lg Electronics Inc. | Methods and devices for transmitting scheduling request in wireless access system |
| CN105122704B (en) * | 2013-04-18 | 2018-02-23 | Lg 电子株式会社 | The method and apparatus that dispatch request is sent in wireless access system |
| CN106453142A (en) * | 2016-09-20 | 2017-02-22 | 盛科网络（苏州）有限公司 | Method and system for reducing WRR scheduling period jitter |
| CN106453142B (en) * | 2016-09-20 | 2019-06-11 | 盛科网络（苏州）有限公司 | Reduce the method and system shaken WRR dispatching cycle |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101860472B (en) | 2012-08-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101685388B (en) | Method and device for executing comparison operation | |
| US8661207B2 (en) | Method and apparatus for assigning a memory to multi-processing unit | |
| EP2668576A2 (en) | State grouping for element utilization | |
| CN102870089A (en) | System and method for storing data in virtualized high speed memory system | |
| CN102609311A (en) | Processor selection for an interrupt identifying a processor cluster | |
| CN101051280A (en) | Intelligent card embedded operation system and its control method | |
| CN102103497A (en) | Finite state machine actuating device and method, and method for establishing and using finite state machine | |
| CN103678187B (en) | A kind of micro-control unit and control method thereof | |
| CN111142938A (en) | A task processing method, task processing device and electronic device for heterogeneous chips | |
| CN105183698A (en) | Control processing system and method based on multi-kernel DSP | |
| WO2013112282A1 (en) | Method and apparatus for register spill minimization | |
| KR100532416B1 (en) | Assigning method of multi sources to multi channel and system thereof | |
| CN101432691B (en) | Method and system for controlling timing in a processor | |
| CN101860472A (en) | Data scheduling method, switch and network system | |
| EP4035016A1 (en) | Processor and interrupt controller therein | |
| CN101421705A (en) | Multi media card with high storage capacity | |
| CN101741722A (en) | Data interactive method and device | |
| US20120159114A1 (en) | Register file and computing device using the same | |
| WO2005001689A1 (en) | Electronic computer, semiconductor integrated circuit, control method, program generation method, and program | |
| CN108989117B (en) | Configuration method of communication protocol, wireless communication device and household appliance | |
| CN1366248A (en) | Method for controlling access of asynchronous clock devices to shared storage device | |
| CN100456229C (en) | Virtual hardware system and instruction executing method based on virtual hardware system | |
| CN101504613A (en) | Distributed dynamic binary translation method used for limited system | |
| CN112579518B (en) | Network topology structure construction method, access method and device | |
| JP4817834B2 (en) | Interrupt control device and interrupt control method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |