Abstract: An example hierarchical switching device may include sub-switches that form a fully interconnected all-to-all network, wherein the sub-switches comprise external output ports, internal input ports and internal output ports to exchange packets with other sub-switches within the fully interconnected all-to-all network. The switching device may further include a deadlockable storage, a storage partition and a switch controller. The deadlockable storage space is exclusively assigned to an internal input port of the internal input ports of the sub-switch including the deadlockable storage. The storage partition is exclusively assigned to an external output port of the external output ports and exclusively assigned to the internal input port. The switch controller is to route a packet destined for an external output port of a sub-switch through the internal input port of the sub-switch to the deadlockable storage or if the packet corresponds to the external output port, to the storage partition.

Abstract: Examples relate to hierarchical switching devices comprising a plurality of sub-switches forming a fully interconnected all-to-all network. The sub-switches comprise internal input ports and internal output ports to exchange packets with other sub-switches within the fully interconnected all-to-all network. The internal input ports of the sub-switches have exclusive access to a queue partition for each external output port of the respective sub-switch. A switch controller receives a packet at a first sub-switch of the plurality of sub-switches that is to be routed to a particular external output port of a second sub-switch of the plurality of sub-switches. The switch controller routes the packet directly from the first sub-switch to the second sub-switch using an internal output port of the first sub-switch and a queue partition of the second sub-switch that is for the particular external output port of the second sub-switch.

Abstract: Example implementations relate to hybrid arbitration of requests for access to a shared pool of resources. An example implementation includes receiving a set of requests for access to the shared pool of resources. The requests may each be from any number of traffic classes. A traffic class may be selected according to turn-based arbitration logic. Additionally, a request from each traffic class of a subset of received requests may be selected. A request selected by the age-based arbitration logic and of the selected traffic class may be granted access to the shared pool of resources.

Abstract: An example hierarchical switching device may include sub-switches that form a fully interconnected all-to-all network, wherein the sub-switches comprise external output ports, internal input ports and internal output ports to exchange packets with other sub-switches within the fully interconnected all-to-all network. The switching device may further include a deadlockable storage, a storage partition and a switch controller. The deadlockable storage space is exclusively assigned to an internal input port of the internal input ports of the sub-switch including the deadlockable storage. The storage partition is exclusively assigned to an external output port of the external output ports and exclusively assigned to the internal input port. The switch controller is to route a packet destined for an external output port of a sub-switch through the internal input port of the sub-switch to the deadlockable storage or if the packet corresponds to the external output port, to the storage partition.

Abstract: Examples relate to virtual channel routing in networks considering VC actions to be performed by the packets while routed through the network. A packet is received at an input port of a network device of a network and an output port and a VC action is determined from a routing table associated to the input port based on a packet's destination network device. A VC mask is determined from a Virtual Channel Action Table (VCAT), associated to the routing table, based on a packet's ingress VC and the VC action. A particular VC among the set of VCs defined in the VC mask is selected and the packet is routed to the destination network device using the output port and the particular VC.

Abstract: Examples relate to hierarchical switching devices comprising a plurality of sub-switches forming a fully interconnected all-to-all network. The sub-switches comprise internal input ports and internal output ports to exchange packets with other sub-switches within the fully interconnected all-to-all network. The internal input ports of the sub-switches have exclusive access to a queue partition for each external output port of the respective sub-switch. A switch controller receives a packet at a first sub-switch of the plurality of sub-switches that is to be routed to a particular external output port of a second sub-switch of the plurality of sub-switches. The switch controller routes the packet directly from the first sub-switch to the second sub-switch using an internal output port of the first sub-switch and a queue partition of the second sub-switch that is for the particular external output port of the second sub-switch.

Abstract: Example implementations relate to hybrid arbitration of requests for access to a shared pool of resources. An example implementation includes receiving a set of requests for access to the shared pool of resources. The requests may each be from any number of traffic classes. A traffic class may be selected according to turn-based arbitration logic. Additionally, a request from each traffic class of a subset of received requests may be selected. A request selected by the age-based arbitration logic and of the selected traffic class may be granted access to the shared pool of resources.

Abstract: Example implementations relate to calculating a time to live (TTL). An example implementation includes receiving a transaction request containing a first time to live (TTL) from a requester. A second TTL for a transaction response may be computed, and a transaction response containing the second TTL may be transmitted.

Abstract: Example implementations relate to calculating a time to live (TTL). An example implementation includes receiving a transaction request containing a first time to live (TTL) from a requester. A second TTL for a transaction response may be computed, and a transaction response containing the second TTL may be transmitted.

Abstract: Examples relate to virtual channel routing in networks considering VC actions to be performed by the packets while routed through the network. A packet is received at an input port of a network device of a network and an output port and a VC action is determined from a routing table associated to the input port based on a packet's destination network device. A VC mask is determined from a Virtual Channel Action Table (VCAT), associated to the routing table, based on a packet's ingress VC and the VC action. A particular VC among the set of VCs defined in the VC mask is selected and the packet is routed to the destination network device using the output port and the particular VC.

Abstract: A detection circuit is provided for a particular group of memory cells in a memory device, where the detection circuit is to be updated in response to at least one access of data and at least one neighboring group of memory cells. The particular group of memory cells is refreshed in response to an indication from the detection circuit, where the indication indicates presence of potential disturbance of the particular group of memory cells.

Abstract: An access of data in a memory device is sampled. In response to the sampled access of data, a refresh operation is performed in the memory device.

Abstract: A system for pushing data, the system includes a source node that stores a coherent copy of a block of data. The system also includes a push engine configured to determine a next consumer of the block of data. The determination being made in the absence of the push engine detecting a request for the block of data from the next consumer. The push engine causes the source node to push the block of data to a memory associated with the next consumer to reduce latency of the next consumer accessing the block of data.

Abstract: A system and method communicate information from a single-threaded application over multiple I/O busses to a computing subsystem for processing. In accordance with one embodiment, a method is provided that partitions state-sequenced information for communication to a computer subsystem, communicates the partitioned information to the subsystem over a plurality of input/output busses, and separately processes the information received over each of the plurality of input/output busses, without first se-sequencing the information.

Abstract: A fully mirrored memory system includes at least one split memory bus, with each portion of the split memory bus having active memory and mirror memory. Each portion of the memory bus transfers a portion of the data for a memory transaction. If a memory unit is determined to be defective, one portion of the memory bus may be inactivated for hot swapping of memory, and the system can continue to operate using an active portion of the memory bus.

Abstract: A method for allocating buffer capacity includes determining at least one characteristic of a first input/output (I/O) device that is coupled to a memory device interface, the memory device interface being configured to enable data transfers between the I/O device and a memory device, and buffering data corresponding to the first I/O device in a first portion of a buffer of the memory device interface, a size of the first portion being responsive to the at least one characteristic of the first I/O device.

Abstract: A system for pushing data, the system includes a source node that stores a coherent copy of a block of data. The system also includes a push engine configured to determine a next consumer of the block of data. The determination being made in the absence oft he push engine detecting a request for the block of data from the next consumer. The push engine causes the source node to push the block of data to a memory associated with the next consumer to reduce latency of the next consumer accessing the block of data.

Abstract: An error correction code method comprises examining a validator of one of a plurality of data in a data stream at a first processing stage and directing the one of the plurality of data through at least one subsequent processing stage to a corrected output if the validator indicates an error. The method also includes directing the one of the plurality of data to the corrected output if the validator does not indicate an error.

Abstract: A system and method are provided for directing the flow of data and instructions into at least one functional unit. In one embodiment of a system of components defining a plurality of nodes, a queue network manager (QNM) forming a part of each node, is provided. In this embodiment, the QNM comprises an interface to a network that supports intercommunication among the plurality of nodes, an interface configured to pass messages with a functional unit within the node, a random access memory (RAM) configured to store at least one of a message and a programmable instruction, and logic configured to control an operational aspect of a functional unit based on contents of the programmable instruction.

Abstract: A system is described that is broadly directed to a system of integrated circuit components. The system comprises a plurality of nodes that are interconnected by communication links. A random access memory (RAM) is connected to each node. At least one functional unit is integrated into each node, and each functional unit is configured to carry out a predetermined processing function. Finally, each RAM includes a coherency mechanism configured to permit only read access to the RAM by other nodes, the coherency mechanism further configured to permit write access to the RAM only by functional units that are local to the node.