Abstract: A method and system for detecting and managing an error detected in an iSCSI (Internet Small Computer System Interface) PDU (Protocol Data Unit) by using a RDMA (Remote Direct Memory Access) dedicated receive error queue for error recovery.

Abstract: A method and system for providing a datamover interface that interfaces with an iSCSI (Internet Small Computer System Interface) driver and with an iSER (iSCSI Extensions for RDMA (Remote Direct Memory Access)) datamover and an iSCSI datamover.

Abstract: A method and system including implementing an iSCSI (Internet Small Computer System Interface) offload target function with RNIC (Remote-direct-memory-access-enabled Network Interface Controller) mechanisms used for RDMA (Remote Direct Memory Access) functions.

Abstract: A method and system for directly accessing a SCSI buffer by a RDMA ATP (Address Translation and Protection) mechanism used in at least one of an iSCSI initiator function and an iSCSI target function. A preregistered SCSI buffer may be identified by means of an ITT (initiator task tag) or TTT (target transfer tag) used as a Stag (steering tag).

Abstract: A method and system for registering a SCSI (Small Computer System Interface) buffer memory by RDMA (Remote Direct Memory Access) ATP (Address Translation and Protection) Fast Memory Registration.

Abstract: A method and system including implementing an iSCSI (Internet Small Computer System Interface) offload initiator function with RNIC (Remote-direct-memory-access-enabled Network Interface Controller) mechanisms used for RDMA (Remote Direct Memory Access) functions.

Abstract: A system for managing descriptor lists, the system including a plurality of descriptor lists, and a descriptor list manager operative to chain any of the descriptor lists by configuring at least one entry in at least a first one of the descriptor lists to indicate the location of a second one of the descriptor lists, and manage the chain of descriptor lists as a single continuous descriptor list.

Abstract: A method of offloading, from a host data processing unit (205), the generation of data corruption-detection digests for iSCSI PDUs to be transmitted as TCP segments over respective TCP connections. An iSCSI layer processing software (310) executed by the host data processing unit provides a command descriptor list (320) containing command descriptors adapted to identify portions of at least one iSCSI PDU to be transmitted, and data corruption-detection digest descriptors (CRC DESC(PDUa); CRC DESC(PDUb)), each one associated with a respective PDU data corruption-detection digest. An iSCSI processing offload engine (223) transmits the iSCSI PDU over the respective TCP connection, based on the descriptors in the command descriptor list; during the transmission, the iSCSI PDU data corruption-detection digest are calculated, and the calculated data corruption-detection digest is saved in the corresponding data corruption-detection digest descriptor in the command descriptor list.

Abstract: A method of offloading, from a host data processing unit (205), iSCSI TCP/IP processing of data streams coming through at least one TCP/IP connection (3071,3072,3073), and a related iSCSI TCP/IP Offload Engine (TOE). The method including: providing a Protocol Data Unit (PDU) header queue (311) adapted to store headers (HDR11, . . . , HDR32) of iSCSI PDUs received through the at least one TCP/IP connection; monitoring the at least one TCP/IP connection for an incoming iSCSI PDU to be processed; when at least a iSCSI PDU header is received through the at least one TCP/IP connection, extracting the iSCSI PDU header from the received PDU, and placing the extracted iSCSI PDU header into the PDU header queue; looking at the PDU header queue for ascertaining the presence of iSCSI PDUs to be processed, and processing the incoming iSCSI PDU based on information in the extracted iSCSU PDU header retrieved from the PDU header queue.

Abstract: A method for performing Remote Direct Memory Access (RDMA), the method including creating Direct Data Placement (DDP) segments of data using a Maximum Segment Size (MSS), called the original MSS, using the DDP segments as a payload for TCP (Transport Control Protocol) segments, TCP transmitting data including the TCP segments, and if the original MSS has changed to a new MSS, temporarily halting DDP segmentation until outstanding data has been acknowledged.

Abstract: A method and system for controlling access to computer resources by multiple software components is described. A locker manager is provided, which is adapted to manage access to shared computer resources by independent software components. If a particular hardware resource is not currently being used and is available, the locker manager grants a particular software component access to the particular computer resource and locks access thereto, wherein none of the other software components can access the particular computer resource until the particular software component has finished accessing the particular computer resource.

Abstract: A method for controlling access to computer memory, the method including communicating work queue elements with an application layer and with a verb layer, and indicating completion of the work queue elements, wherein both the application layer and the verb layer are capable of checking if at least one of the work queue elements is completed, independently of each other.

Abstract: A method and system for dynamic management of Transmission Control Protocol (TCP) reassembly buffers in hardware (e.g., in a TCP/IP offload engine (TOE)). The method comprises: providing a plurality of data blocks and an indirect list; pointing, via entries in the indirect list, to allocated data blocks in the plurality of data blocks that currently store incoming data; if a free data block in the plurality of data blocks is required for the storage of incoming data, allocating the free data block for storing incoming data; and, if an allocated data block in the plurality of data blocks is no longer needed for storing incoming data, deallocating the allocated data block such that the deallocated data block becomes a free data block.

Abstract: An RNIC implementation that performs direct data placement to memory where all segments of a particular connection are aligned, or moves data through reassembly buffers where all segments of a particular connection are non-aligned. The type of connection that cuts-through without accessing the reassembly buffers is referred to as a “Fast” connection because it is highly likely to be aligned, while the other type is referred to as a “Slow” connection. When a consumer establishes a connection, it specifies a connection type. The connection type can change from Fast to Slow and back. The invention reduces memory bandwidth, latency, error recovery using TCP retransmit and provides for a “graceful recovery” from an empty receive queue. The implementation also may conduct CRC validation for a majority of inbound DDP segments in the Fast connection before sending a TCP acknowledgement (Ack) confirming segment reception.

Abstract: A method and system for completion coalescing by a Transmission Control Protocol (TCP) receiver (e.g., in a TCP/IP offload engine (TOE)). The method comprises: processing inbound TCP segments; and performing completion processing of received TCP ACKS and/or RDMA Read Requests independently of the processing of the inbound TCP segments.

Abstract: An RNIC implementation that performs direct data placement to memory where all segments of a particular connection are aligned, or moves data through reassembly buffers where all segments of a particular connection are non-aligned. The type of connection that cuts-through without accessing the reassembly buffers is referred to as a “Fast” connection because it is highly likely to be aligned, while the other type is referred to as a “Slow” connection. When a consumer establishes a connection, it specifies a connection type. The connection type can change from Fast to Slow and back. The invention reduces memory bandwidth, latency, error recovery using TCP retransmit and provides for a “graceful recovery” from an empty receive queue. The implementation also may conduct CRC validation for a majority of inbound DDP segments in the Fast connection before sending a TCP acknowledgement (Ack) confirming segment reception.

Abstract: An RNIC implementation that performs direct data placement to memory where all segments of a particular connection are aligned, or moves data through reassembly buffers where all segments of a particular connection are non-aligned. The type of connection that cuts-through without accessing the reassembly buffers is referred to as a “Fast” connection because it is highly likely to be aligned, while the other type is referred to as a “Slow” connection. When a consumer establishes a connection, it specifies a connection type. The connection type can change from Fast to Slow and back. The invention reduces memory bandwidth, latency, error recovery using TCP retransmit and provides for a “graceful recovery” from an empty receive queue. The implementation also may conduct CRC validation for a majority of inbound DDP segments in the Fast connection before sending a TCP acknowledgement (Ack) confirming segment reception.

Abstract: An RNIC implementation that performs direct data placement to memory where all segments of a particular connection are aligned, or moves data through reassembly buffers where all segments of a particular connection are non-aligned. The type of connection that cuts-through without accessing the reassembly buffers is referred to as a “Fast” connection because it is highly likely to be aligned, while the other type is referred to as a “Slow” connection. When a consumer establishes a connection, it specifies a connection type. The connection type can change from Fast to Slow and back. The invention reduces memory bandwidth, latency, error recovery using TCP retransmit and provides for a “graceful recovery” from an empty receive queue. The implementation also may conduct CRC validation for a majority of inbound DDP segments in the Fast connection before sending a TCP acknowledgement (Ack) confirming segment reception.

Abstract: An RNIC implementation that performs direct data placement to memory where all segments of a particular connection are aligned, or moves data through reassembly buffers where all segments of a particular connection are non-aligned. The type of connection that cuts-through without accessing the reassembly buffers is referred to as a “Fast” connection because it is highly likely to be aligned, while the other type is referred to as a “Slow” connection. When a consumer establishes a connection, it specifies a connection type. The connection type can change from Fast to Slow and back. The invention reduces memory bandwidth, latency, error recovery using TCP retransmit and provides for a “graceful recovery” from an empty receive queue. The implementation also may conduct CRC validation for a majority of inbound DDP segments in the Fast connection before sending a TCP acknowledgement (Ack) confirming segment reception.

Abstract: An RNIC implementation that performs direct data placement to memory where all segments of a particular connection are aligned, or moves data through reassembly buffers where all segments of a particular connection are non-aligned. The type of connection that cuts-through without accessing the reassembly buffers is referred to as a “Fast” connection because it is highly likely to be aligned, while the other type is referred to as a “Slow” connection. When a consumer establishes a connection, it specifies a connection type. The connection type can change from Fast to Slow and back. The invention reduces memory bandwidth, latency, error recovery using TCP retransmit and provides for a “graceful recovery” from an empty receive queue. The implementation also may conduct CRC validation for a majority of inbound DDP segments in the Fast connection before sending a TCP acknowledgement (Ack) confirming segment reception.