System and method for receive queue provisioning
First Claim
Patent Images
1. A communications system, comprising:
- a first queue pair (QP) associated with a first connection, the first QP comprising a first send queue (SQ);
a second QP associated with a second connection, the second QP comprising a second SQ; and
a general pool comprising a shared receive queue (SRQ), the SRQ being shared by the first QP and the second QP,wherein the first QP comprises a first limit queue (LQ) that limits an amount of resources of the SRQ that the first QP can access,wherein the second QP comprises a second limit queue (LQ) that limits an amount of resources of the SRQ that the second QP can access, andwherein at least one of the first LQ and the second LQ comprises a maximum value relating to a size of a hole in a transport protocol sequence space.
4 Assignments
0 Petitions
Accused Products
Abstract
Systems and methods that provide receive queue provisioning are provided. In one embodiment, a communications system may include, for example, a first queue pair (QP), a second QP and a general pool. The first QP may be associated with a first connection and may include, for example, a first send queue (SQ). The second QP may be associated with a second connection and may include, for example, a second SQ. The general pool may include, for example, a shared receive queue (SRQ) that may be shared, for example, by the first QP and the second QP.
-
Citations
41 Claims
-
1. A communications system, comprising:
-
a first queue pair (QP) associated with a first connection, the first QP comprising a first send queue (SQ); a second QP associated with a second connection, the second QP comprising a second SQ; and a general pool comprising a shared receive queue (SRQ), the SRQ being shared by the first QP and the second QP, wherein the first QP comprises a first limit queue (LQ) that limits an amount of resources of the SRQ that the first QP can access, wherein the second QP comprises a second limit queue (LQ) that limits an amount of resources of the SRQ that the second QP can access, and wherein at least one of the first LQ and the second LQ comprises a maximum value relating to a size of a hole in a transport protocol sequence space. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22)
-
-
23. A communications system, comprising:
-
a network interface card interface (NI) comprising a network interface card (NIC) and a NIC driver, the NIC being coupled to the NIC driver; and a consumer coupled to the NI, wherein the NIC comprises a first queue pair (QP), a second QP and a shared receive queue (SRQ), and wherein the first QP and the second QP share the SRQ, wherein the first QP comprises a first limit queue (LQ) that limits an amount of resources of the SRQ that the first QP can access, wherein the second QP comprises a second limit queue (LQ) that limits an amount of resources of the SRQ that the second QP can access, and wherein the first LQ or the second LQ comprises a limit that relates to at least one of an in-order message, an out-of-order message, a segment of the in-order message and a segment of the out-of-order message. - View Dependent Claims (24, 25, 26, 27, 28, 29, 30, 31)
-
-
32. A method for communicating, comprising:
-
establishing a first connection associated with a first queue pair (QP), the first QP comprising a first limit queue (LQ) that limits an amount of resources of the SRQ that the first QP can access; establishing a second connection associated with a second QP, the second QP comprising a second limit queue (LQ) that limits an amount of resources of the SRQ that the second QP can access, at least one of the first LQ and the second LQ comprising a maximum value relating to a size of a hole in a transport protocol sequence space; concurrently sharing a single receive queue (RQ) between the first QP and the second QP; and provisioning the single RQ using statistical information. - View Dependent Claims (33, 34, 35, 36, 37, 38)
-
-
39. A communications system, comprising:
-
a first queue pair (QP) associated with a first connection, the first QP comprising a first send queue (SQ); a second QP associated with a second connection, the second QP comprising a second SQ; and a general pool comprising a shared receive queue (SRQ), the SRQ being shared by the first QP and the second QP, wherein the first QP comprises a first limit queue (LQ) that limits an amount of resources of the SRQ that the first QP can access, wherein the second QP comprises a second limit queue (LQ) that limits an amount of resources of the SRQ that the second QP can access, wherein the first LQ or the second LQ comprises a limit that relates to at least one of an in-order message, an out-of-order message, a segment of the in-order message and a segment of the out-of-order message.
-
-
40. A communications system, comprising:
-
a network interface card interface (NI) comprising a network interface card (NIC) and a NIC driver, the NIC being coupled to the NIC driver; and a consumer coupled to the NI, wherein the NIC comprises a first queue pair (QP), a second QP and a shared receive queue (SRQ), and wherein the first QP and the second QP share the SRQ, wherein the first QP comprises a first limit queue (LQ) that limits an amount of resources of the SRQ that the first QP can access, wherein the second QP comprises a second limit queue (LQ) that limits an amount of resources of the SRQ that the second QP can access, and wherein at least one of the first LQ and the second LQ comprises a maximum value relating to a size of a hole in a transport protocol sequence space.
-
-
41. A method for communicating, comprising:
-
establishing a first connection associated with a first queue pair (QP), the first QP comprising a first limit queue (LQ) that limits an amount of resources of the SRQ that the first QP can access; establishing a second connection associated with a second QP, the second QP comprising a second limit queue (LQ) that limits an amount of resources of the SRQ that the second QP can access, the first LQ or the second LQ comprising a limit that relates to at least one of an in-order message, an out-of-order message, a segment of the in-order message and a segment of the out-of-order message; concurrently sharing a single receive queue (RQ) between the first QP and the second QP; and provisioning the single RQ using statistical information.
-
Specification