Abstract: The present invention, in various embodiments, provides techniques for managing data in a queue. In one embodiment, two write pointers control writing into a memory queue and one read pointer control reading from the queue. Individual entries written into the queue may complete out-of-order and depend on various conditions such as whether the pointer associated with the entries is active or passive, whether the other pointer is tracking a transaction, whether the active pointer is lower, equal to, or higher than the inactive pointer, whether the data is the last piece of data in a transaction, etc. Data read from the queue is in the order of the transaction headers written into the queue. The data may bypass the queue, i.e., the data is not written into the queue, but is loaded directly to an output register.

Abstract: The present invention, in various embodiments, provides techniques for managing data in a queue. In one embodiment, two write pointers control writing into a memory queue and one read pointer control reading from the queue. Individual entries written into the queue may complete out-of-order and depend on various conditions such as whether the pointer associated with the entries is active or passive, whether the other pointer is tracking a transaction, whether the active pointer is lower, equal to, or higher than the inactive pointer, whether the data is the last piece of data in a transaction, etc. Data read from the queue is in the order of the transaction headers written into the queue. The data may bypass the queue, i.e., the data is not written into the queue, but is loaded directly to an output register.

Abstract: The present invention, in various embodiments, provides techniques for using an in-progress data transaction to send additional information. In one illustrative embodiment, two asynchronous nodes are sending data to each other. In one transaction involving the first node sending data to the second node, the second node while receiving part of the data recognizes that the rest of the data being sent is invalid, e.g., due to various kinds of errors. The second node then immediately requests the first node to resend the to-be-received, now erroneous, data. In one embodiment, the second node inserts the request in a data stream being in transit from the second node to the first node. The second node does not need to wait until the boundary of a data transaction, and, in one embodiment, the request is embedded in a “drop packet.