H04L49/102

Automatic multi-stage fabric generation for FPGAs
10536399 · 2020-01-14 · ·

Systems and methods to automatically or manually generate various multi-stage pyramid network based fabrics, either partially connected or fully connected, are disclosed by changing different parameters of multi-stage pyramid network including such as number of slices, number of rings, number of stages, number of switches, number of multiplexers, the size of the multiplexers in any switch, connections between stages of rings either between the same numbered stages (same level stages) or different numbered stages, single or multi-drop hop wires, hop wires of different hop lengths, hop wires outgoing to different directions, hop wires incoming from different directions, number of hop wires based on the number and type of inlet and outlet links of large scale sub-integrated circuit blocks. One or more parameters are changed in each iteration so that optimized fabrics are generated, at the end of iterations, to route a given set of benchmarks or designs having a specific connection requirements.

NETWORKED MOTION CONTROL
20200007254 · 2020-01-02 ·

The presently disclosed technology relates to networked control of machine tools. An example system can use messages as means for transmitting intention and status in a networked control system. Illustratively, requests for actions or requests for measurements and status are passed across the network as messages rather than discrete signals. This can greatly ease machine expansionnew functions may be implemented by adding new messages on the network and adding new distributed controls to handle the new function hardware.

Network entities on ring networks

Examples described herein relate to a network entity on a ring network. In an example, a method includes receiving a first packet by a first network entity via a ring network. It is determined from the first packet that the ring network has a plurality of management entities each claiming a respective network entity. Based on the ring network having the plurality of management entities each claiming the respective network entity, the first network entity is transitioned from an unclaimed state to a dummyclaim state, and the first network entity is isolated from a portion of the ring network.

External exchange connectivity

A processing device has a plurality of interfaces and a plurality of processors. During different phases of execution of a computer program, different processors are associated with different interfaces, such that the connectivity between processors and interfaces for the sending of egress data and the receiving of ingress data may change during execution of that computer program. The change in this connectivity is directed by the compiled code running on the processors. The compiled code selects which buses associated with which interfaces, given processors are to connect to for receipt of ingress data. Furthermore, the compiled code causes control messages to be sent to circuitry associated with the interfaces, so as to control which buses associated with which processors, given interfaces are to connect to.

Autonomously routing data using relay nodes pre-selected from a group of distributed computer nodes based on measured one-way latencies

A method is disclosed for autonomously routing data using relay nodes pre-selected from a group of distributed computer nodes based on measured one-way latencies. One-way latencies between a plurality of nodes in a pulse group are automatically measured. A sending bucket of nodes are automatically selected from the pulse group based on the one-way latencies. A receiving bucket of nodes are automatically selected from the pulse group based on the one-way latencies. In response to a command to transfer data from the first node to the second node, a relay node that is both in the first sending bucket and in the first receiving bucket is automatically selected, wherein data is automatically routed from the first node to the second node via the relay node.

Autonomously routing data using relay nodes pre-selected from a group of distributed computer nodes based on measured one-way latencies

A method is disclosed for autonomously routing data using relay nodes pre-selected from a group of distributed computer nodes based on measured one-way latencies. One-way latencies between a plurality of nodes in a pulse group are automatically measured. A sending bucket of nodes are automatically selected from the pulse group based on the one-way latencies. A receiving bucket of nodes are automatically selected from the pulse group based on the one-way latencies. In response to a command to transfer data from the first node to the second node, a relay node that is both in the first sending bucket and in the first receiving bucket is automatically selected, wherein data is automatically routed from the first node to the second node via the relay node.

DETECTING EGRESSES OF A POINT-TO-MULTIPOINT LABEL SWITCHED PATH IN A RING NETWORK
20190363978 · 2019-11-28 ·

Techniques are described for detecting egress network devices of a point-to-multipoint (P2MP) label switched path (LSP). For example, a network device may include one or more processors configured to identify a P2MP LSP for receiving multicast traffic from a multicast source for a specific multicast group for which the network device has an interested receiver, wherein the network device is to be an egress network device of the P2MP LSP; and send, to an ingress network device of the P2MP LSP, a P2MP egress identification message to add the network device as an egress network device of the P2MP LSP, wherein the one or more processors are further configured to output the P2MP egress identification message into a multipoint-to-point (MP2P) ring LSP for which the ingress network device of the P2MP LSP is a sole egress network device of the MP2P ring LSP.

SWITCH DEVICE AND COMMUNICATION CONTROL METHOD

This switch device is mounted on a vehicle, and comprises: a switch unit for relaying communication data communicated between a plurality of communication devices; a buffer for holding the communication data to be relayed; and a control unit for transmitting stop request to at least one communication device of the plurality of communication devices if communication data to be transmitted to a communication device in which abnormality has been detected is held in the buffer, the stop request which requests for stopping transmission of communication data to the switch device and for holding of communication data to be transmitted to the switch device.

SHARED RESOURCES FOR MULTIPLE COMMUNICATION TRAFFICS
20190356611 · 2019-11-21 ·

Systems, methods, and computer-readable media are disclosed for an apparatus coupled to a communication bus, where the apparatus includes a queue and a controller to manage operations of the queue. The queue includes a first space to store a first information for a first traffic type, with a first flow class, and for a first virtual channel of communication between a first communicating entity and a second communicating entity. The queue further includes a second space to store a second information for a second traffic type, with a second flow class, and for a second virtual channel of communication between a third communicating entity and a fourth communicating entity. The first traffic type is different from the second traffic type, the first flow class is different from the second flow class, or the first virtual channel is different from the second virtual channel. Other embodiments may be described and/or claimed.

Virtual Channel Balancing In Ring-Based Topologies
20240137308 · 2024-04-25 ·

Systems and method for routing data packets in ring network. A data packet being transmitted to a destination node may be received by a first structure at a first node. The first node may determine a number of hops the data packet will traverse as it is transmitted from the first node to the destination node and compare the determined number of hops to a threshold hop value to determine whether the number of hops is equal to or less than the threshold hop value. If the number of hops is greater than the threshold, the data packet may be transmitted to a dimension queuing structure for a first virtual channel within a second node, otherwise, the data packet may be transmitted to a dimension queuing structure for a second virtual channel or a turn queuing structure within the second node.