Abstract:
Disclosed are a data processing method, a processor, and a data processing device. The method comprises: an arbiter sends data D(a,1) to a first processing circuit; the first processing circuit processes the data D(a,1) to obtain data D(1,2), the first processing circuit being a processing circuit among m processing circuits; the first processing circuit sends the data D(1,2) to a second processing circuit; the second processing circuit to an mth processing circuit separately process the received data; and the arbiter receives data D(m,a) sent by the mth processing circuit. The processor further comprises an (m+1)th processing circuit. Each processing circuit in the first processing circuit to the (m+1)th processing circuit can receive first data to be processed sent by the arbiter, and process the first data to be processed. The scheme is helpful to improve efficiency of data processing.
Abstract:
A partial packet context builder can determine a partial packet context associated with a data packet based upon packet context associated with the data packet, the partial packet context including a plurality of partial packet context fields, where a network packet processor including an action unit, the action unit including the partial packet context builder, a systolic array of arithmetic-logical units (ALUs), and a packet context builder, the packet context including a plurality of packet context fields. The systolic array of ALUs can process the partial packet context to provide a processed partial packet context, the processed partial packet context including a plurality of processed partial packet context fields. The packet context builder can merge the processed partial packet context with the packet context to provide a processed packet context.
Abstract:
According to a load sharing method and a network device, traffic distribution ratios are correspondingly preset for different paths. For example, an equivalent resistance method is used as a load sharing algorithm provided in embodiments of this application, to calculate a corresponding traffic distribution ratio for each possible path. The traffic distribution ratio and the corresponding path are preset for a corresponding node. In this way, traffic entering a network device is distributed to each path in the network device based on the preset ratio, without causing excessive bandwidth pressure on a shortest path, to implement relatively optimal load balancing. For the network device with either a ring network structure or a stereoscopic network structure, a requirement for a link bandwidth between the nodes in the network device can be reduced.
Abstract:
A method for determining instruction sequences, a related device, and a system. A method for determining instruction sequences may include: acquiring a function identifier; and determining M1 instruction sequences used to implement a function identified by the function identifier, where each instruction sequence in the M1 instruction sequences includes a unique entry instruction, and each instruction sequence in the M1 instruction sequences includes a unique exit instruction, where M1 is a positive integer, and the M1 instruction sequences are instruction sequences for creating a network packet processing program used to process a network packet. Solutions of embodiments of the present disclosure are advantageous for improving an extent of matching between a packet forwarding device and an instruction sequence that is executed by the packet forwarding device and used to process a network packet, and reducing an amount of invalid code run by the packet forwarding device.
Abstract:
A method for allocating a resource for storing visualization information, an apparatus, and a system are provided. The method includes: a first network device determines a first queue based on a constraint condition, where the first queue is a queue that needs to be visualized. Then, the first network device allocates a first storage resource to the first queue, where the first storage resource is used to store visualization information of the first queue, and the visualization information is information used to visualize the first queue. Therefore, occupation of storage resources in the first network device is reduced.
Abstract:
A method is applied to a ring link, where the ring link includes a first node, a second node, a third node, and a fourth node in sequence. According to the method, the first node receives first traffic, where the first node is a source node that sends the first traffic on the ring link; and the first node sends the first traffic to the third node, where two reachable paths with equal hop counts are included from the first node to the third node, the first node sends the first traffic to the third node on a preset first transmission path, the first transmission path passes through the second node, and the first transmission path is one of the two reachable paths with equal hop counts. This method can reduce computing load of nodes while implementing non-blocking switching of traffic between the nodes.