Abstract: A request processing method, includes: acquiring, from a local first input first output (FIFO) queue, an address of a current request to be processed, and based on the address of the current request to be processed, acquiring the current request to be processed from a preset request buffer area; parsing the current request to be processed, and based on a parsing result, acquiring corresponding current source data to be processed and a serial address item for recording an address of a next request to be processed; processing the current source data to be processed to obtain currently processed target data, and writing the currently processed target data into a preset data buffer area; and notifying a host to read all processed target data from the preset data buffer area when the serial address item is empty.

Abstract: A request processing method, includes: acquiring, from a local first input first output (FIFO) queue, an address of a current request to be processed, and based on the address of the current request to be processed, acquiring the current request to be processed from a preset request buffer area; parsing the current request to be processed, and based on a parsing result, acquiring corresponding current source data to be processed and a serial address item for recording an address of a next request to be processed; processing the current source data to be processed to obtain currently processed target data, and writing the currently processed target data into a preset data buffer area; and notifying a host to read all processed target data from the preset data buffer area when the serial address item is empty.

Abstract: A link-speed self-adapting method includes: creating multiple pairs of a measured-value recording table and a measured-value sequence table at each of nodes; by using a sending node, receiving data frames sent by a receiving node through a reverse link, calculating signal-to-noise ratios of the received data frames, and recording the signal-to-noise ratios and measurement moments into the measured-value recording tables of the sending node; in response to data frames sent by a same sending node and received by the receiving node satisfying a predetermined condition, acquiring the signal-to-noise ratios and the measurement moments corresponding to the data frames that satisfy the predetermined condition, and sending to the sending node by using a message; recording the signal-to-noise ratios and the measurement moments carried in the message into the measured-value sequence table; and according to the measured-value sequence tables, adjusting a speed at which the sending node sends the data frames.

Abstract: A task processing method includes: acquiring a plurality of to-be-processed tasks; the plurality of to-be-processed tasks corresponding to a plurality of buffer management request sets; creating different storage queues for storing information of different processing stages for each of the plurality of buffer management request sets to obtain a plurality of storage queue sets corresponding to the plurality of buffer management request sets; processing the plurality of to-be-processed tasks in parallel by hardware, processing different buffer management requests in the buffer management request sets in a pipeline parallel mode, and storing information of corresponding processing stages by utilizing different storage queues in the plurality of storage queue sets. By means of the aforesaid method, tasks are collaboratively processed by software and hardware, so that the performance of a buffer management algorithm is improved, and the speed of task processing is further increased.