Queue single-cycle scheduling method and device

A scheduling method and a single-period technology, applied in the field of queue scheduling, can solve problems such as the failure to meet the expected packet forwarding rate requirements, and achieve the effects of improving the team-out capability, increasing the team-out bandwidth, and simplifying development and maintenance

Active Publication Date: 2017-10-10
SANECHIPS TECH CO LTD
View PDF6 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] The embodiment of the present invention provides a queue single-cycle scheduling method and device to overcome the problem that the prior art cannot meet the expected requirements of the packet forwarding rate

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 more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Queue single-cycle scheduling method and device
  • Queue single-cycle scheduling method and device
  • Queue single-cycle scheduling method and device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0035] In order to make the purpose, technical solution and advantages of the present invention more clear, the embodiments of the present invention will be described in detail below in conjunction with the accompanying drawings. It should be noted that, in the case of no conflict, the embodiments in the present application and the features in the embodiments can be combined arbitrarily with each other.

[0036] The embodiment of the present invention implements single-cycle dequeuing through the first-level scheduling of the queue number and the second-level scheduling of the descriptor through the linked list, which ensures that packets are sent out every clock cycle, and that the dequeue is polled according to different purpose IDs. Dequeue, queues with the same destination ID are dequeued according to strict priority according to different priorities, and queues with the same priority are dequeued according to fair polling. The present invention adds a level of scheduling ...

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

No PUM Login to view more

Abstract

The invention provides a single queue cycle dispatching method and device. The method includes the steps: dispatching a pre-dequeued queue number according to a dispatching rule, reading first package descriptor information of a corresponding queue by taking the queue number as an address, and temporarily storing the read first package descriptor information of the corresponding queue; selecting a dequeued temporarily stored queue according to a dequeuing rule, and continuously dequeuing all sections of a temporarily stored queue package until the queue is switched by taking a clock cycle as a unit according to the first package descriptor information of the temporarily stored queue and acquired package section node information of the temporarily stored queue. By the aid of queue number dispatching of the comprehensive queue and second-level package descriptor dispatching of the queue, single-cycle dequeuing dispatching is achieved, dequeuing capacity and dequeuing bandwidth are furthest improved, high dequeuing bandwidth is achieved under small system clock frequency, power consumption of a chip is greatly reduced, and dequeuing performance is improved.

Description

technical field [0001] The invention relates to queue scheduling technology, in particular to a queue single-cycle scheduling method and device. Background technique [0002] Queue scheduling, that is, the queue passes certain trigger checks (such as receiving authorization triggers, etc.), arbitrates the queue exit conditions, and schedules the queue to exit the queue in an orderly manner according to certain rules. Commonly used scheduling algorithms mainly include round robin (RR, RoundRobin) scheduling algorithm and strict priority (SP, Strict Priority) scheduling algorithm. [0003] The implementation principle of the round-robin scheduling algorithm is to poll the queue one by one and circularly to dequeue in a certain order. Schedule a queue to be dequeued every clock cycle, and then poll the next queue for dequeuing on the next clock cycle. The strict priority scheduling algorithm is to set different priorities for the queues, and each time the queue with the highe...

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
no application Login to view more
Patent Type & Authority Patents(China)
IPC IPC(8): H04L12/863
CPCY02D30/50
Inventor 廖庆磊
Owner SANECHIPS TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products