Abstract: According to an example, a lock may be requested by a first redundancy controller from a parity media controller to perform a first sequence that accesses multiple memory modules in a stripe. The lock may be acquired for the stripe so that the first sequence may be performed on the stripe. The lock may then be released from the stripe.

Abstract: A system includes a central processing unit (CPU) to process data with respect to a virtual address generated by the CPU. A first memory management unit (MMU) translates the virtual address to a physical address of a memory with respect to the data processed by the CPU. A supervisory MMU translates the physical address of the first MMU to a storage address for storage and retrieval of the data in the memory. The supervisory MMU controls access to the memory via the storage address generated by the first MMU.

Abstract: A blockage is detected at a first link based on a delay and/or stoppage of transmission of a data message along the first link between first and second nodes of a plurality of nodes of a fabric. A snapshot message is sent along at least a second link between the first and second nodes in response to the blockage being detected. The second node may capture a fabric state at the second node in response to receiving the snapshot message, before a corrective action occurs.

Abstract: A completion packet may be returned before a data packet is written to a memory, if a field of the data packet indicates the data packet was sent due to a cache capacity eviction. The completion packet is returned after the data packet is written to the memory, if the field indicates the data packet was sent due to a flush operation.

Abstract: In one aspect, techniques are provided for adding a packet to a queue. A packet may be received. A determination may be made if the packet is encumbered or unencumbered. The packet may be added to a posted queue, to an encumbered queue, or a unencumbered queue based on the determination. In another aspect, techniques are provided for de-queuing a packet in a posted queue. A posted packet may be de-queued and encumbered queues associated with the packet may be added to unencumbered queues.

Abstract: In one aspect a memory module storing a plurality of packets is provided. A self organizing heap contains elements associated with each of the packets. The self organizing heap reorders the packets based on packet passing rules. In another aspect, a plurality of elements associated with packets is provided. Each element includes a state machine. The state machine operates in accordance with packet passing rules. The state machine reorders the packets by selective swapping of adjacent elements.

Abstract: Feed-forward arbitration is disclosed. An example method of feed-forward arbitration includes determining an aggregated measure of urgency of packets waiting in a queue.

Abstract: In one aspect a memory module storing a plurality of packets is provided. A self organizing heap contains elements associated with each of the packets. The self organizing heap reorders the packets based on packet passing rules. In another aspect, a plurality of elements associated with packets is provided. Each element includes a state machine. The state machine operates in accordance with packet passing rules. The state machine reorders the packets by selective swapping of adjacent elements.

Abstract: In one example, a controller for managing a set of resources. A first structure has a first entry statically associated with one of the resources. A second structure has a second entry dynamically associative with one of the resources. A resource sharing mechanism borrows for the second structure an idle resource associated with the first structure.

Abstract: In one aspect, techniques are provided for adding a packet to a queue. A packet may he received. A determination may be made if the packet is encumbered or unencumbered. The packet may be added to a posted queue, to an encumbered queue, or a unencumbered queue based on the determination. In another aspect, techniques are provided for de-queuing a packet in a posted queue. A posted packet may be de-queued and encumbered queues associated with the packet may be added to unencumbered queues.

Abstract: Systems, methodologies, media, and other embodiments associated with data recovery are described. One exemplary system embodiment includes a sampling logic configured to sample data from a data line using a timing reference that is selectable from a plurality of timing reference signals. The system may also include a symbol history logic configured to track a symbol history of the data sampled by the sampling logic and a timing selection logic configured to select the timing reference used to sample the data based on the symbol history of the data to compensate for inter-symbol interference.