Queue cache management method and system, storage medium, computer equipment and application

Abstract

The invention belongs to the technical field of data exchange, and discloses a queue cache management method and system, a storage medium, computer equipment and an application. The method includes framing on data frames subjected to flow classification and grouping processing before the data frames enter a queue cache management module, and framing the lengthened Ethernet data frames into fixed-length frames with fixed bytes; using peripheral control to an on-chip Block RAM, so that a configurable multi-channel FIFO queue is formed and used for storing fixed-length frames. According to the invention, the fixed-length frames of different queues are stored in the whole Block RAM, the storage area is selected in a configurable mode to be presented outwards to form the whole RAM or a plurality of FIFO queues, a proper storage scheme is selected according to the storage area, the utilization rate of storage resources is increased, and the processing and forwarding efficiency of data framesis improved. According to the invention, internal fragments can be avoided as much as possible, the overall rate of the system is improved, and the utilization rate of storage resources is greatly improved.

Description

technical field [0001] The invention belongs to the technical field of data exchange, and in particular relates to a queue buffer management method, system, storage medium, computer equipment and application. Background technique [0002] At present: In order to increase the exchange rate of data frames, on-chip storage resources are usually used to store data frames, but on-chip resources are very precious. Due to the large number of queues to be managed in the queue management module of the switching system, in order to avoid the data of different queues Frames will not be stored together out of order, which requires data frames of different queues (even different priorities) to be stored in different RAM areas, while on-chip storage resources are limited, and on-chip Block RAM has fixed specifications (36K , 18k), the internal storage fragmentation of instantiating multiple RAMs will be very large. A better method is to divide Block RAM resources into a relatively fixed ...

AI Technical Summary

Problems solved by technology

[0002] At present: In order to increase the exchange rate of data frames, on-chip storage resources are usually used to store data frames, but on-chip resources are very precious. Due to the large number of queues to be managed in the queue management module of the switching system, in order to avoid the data of different queues Frames will not be stored together out of order, which requires data frames of different queues (even different priorities) to be stored in different RAM areas, while on-chip storage resources are limited, and on-chip Block RAM has fixed specifications (36K , 18k), the internal storage fragmentation of instantiated multiple RAMs will be very large

A better method is to divide Block RAM resources into a relatively fixed area, such as 64 bytes (the shortest frame length of an Ethernet frame). The specific idea is that when a data frame applies for cache allocation, the queue management module will allocate it Divide into several 64-byte fragments for storage. When the length of the final fragment is less than 64 bytes, it will also occupy a complete fragment. That is, in the limit case, the unit stored in a data frame will have 63 The internal fragmentation of bytes, but if the fragmentation is divided into smaller storage areas in order to reduce internal fragmentation, this will not only increase the linked list overhead for managing these storage areas, but also make the steps of enqueuing to apply for cache areas longer, reducing The overall speed of the system

[0004] The difficulty in solving the above problems and defects is: if a queue management scheme based on fragmentation with random frame length is adopted, not only the fixed-length fragments of the entire storage area need to be connected in the form of a linked list, but additional management of these storage areas is required. The overhead of the area linked list, and the total number of fixed-length fragments occupied by the storage of a random frame is unpredictable, which leads to the need for multiple cache applications for a random frame that is about to enter the queue, which limits the exchange rate of the entire system. It requires not only complex queue management mechanism, but also complex cache management and cache query work to achieve the correct forwarding of data frames, which greatly increases the difficulty of the overall design

Images