Weighted fair queueing based scheduling implementation method and device
A weighted fairness and queuing technology, which is applied in the field of data communication, can solve the problems of large-scale combinatorial logic and magnified overhead, and achieve the effects of bit width insensitivity, simplified implementation steps, and optimized counter accumulation algorithm
Active Publication Date: 2014-01-29
SANECHIPS TECH CO LTD
View PDF3 Cites 2 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
However, this algorithm needs to perform addition, subtraction and geometric comparison operations, and the combination logic scale is relatively large, and as the bit width of the counter increases, the overhead will be magnified
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View moreImage
Smart Image Click on the blue labels to locate them in the text.
Smart ImageViewing Examples
Examples
Experimental program
Comparison scheme
Effect test
Embodiment Construction
[0075] In the currently applied WFQ scheduling algorithm, it often only pays attention to its input and output, and selects the scheduling queue corresponding to the chain head according to its output. During the implementation of the algorithm, it is necessary to carefully consider the calculation efficiency of the flow movement during the calculation process, the algorithm selection of the counter accumulation, and other issues. For the implementation of the WFQ algorithm on the software platform, it is possible to use the step-by-step accumulation of 1, and there is almost no need to consider the selection of the accumulator; however, for the hardware implementation of the algorithm, the cost and efficiency of the implementation need to be considered. Especially for the selection of the counter accumulation algorithm, it is necessary to adopt an algorithm that can obtain the result under the number of beats with a fixed delay, so as to ensure the timing of the front and rear...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More PUM
Login to View More Abstract
The invention discloses a weighted fair queueing based scheduling implementation method and device. The method includes after an activity linked list of a scheduling queue is serviced, performing counter accumulation according to a following mode, and selecting a next scheduling queue according to a new counter value; using a bitmap empty for representing a state of each scheduling queue linked list, and solving a bit index power Qn of a lowest nonzero digit of 2 according to a bit index x of a lowest nonzero digit of the empty; solving the lowest nonzero digit of the empty and a bit index mask with all left bits of 1; acquiring a tth intermediate result acct according to a sum of a current counter count value counter and QnX2<(t-1)>; verifying a first intermediate result acc1, and selecting an acc1 and mask bitwise and operation result as a new counter value if acc1 verification passes; otherwise, selecting a second intermediate result acc2 and mask bitwise and operation result as a new counter value, or selecting a bitwise and operation result of a minimum value of the acc2 and acc1 and the mask to be used as a new counter value. By the method, operation steps of counter accumulation are simplified.
Description
technical field [0001] The present invention relates to the technical field of data communication, in particular to a scheduling implementation method and device based on weighted fair queues. Background technique [0002] The WFQ (Weighted Fair Queuing, Weighted Fair Queuing) scheduling algorithm is widely used in scheduling algorithm design in traffic management because of its characteristic of fairly distributing dequeuing opportunities according to weight. Scheduling based on WFQ is an important mechanism to ensure QoS. The WFQ scheduling algorithm can allocate bandwidth according to predetermined rules, and distribute the chance of leaving the queue to each queue fairly. [0003] Next, we briefly analyze the WFQ scheduling algorithm. For a 1:4K WFQ scheduler, the minimum weight that can be set is 1 / 4096, and the number of bits required is 12 bits. According to the weight from high to low, each bit corresponds to 1 / 2, 1 / 4, 1 / 8...1 / 4096, set a scheduling queue for each ...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More Application Information
Patent Timeline
Login to View More Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/867H04L47/629
Inventor 高继伟徐健
Owner SANECHIPS TECH CO LTD