Abstract: An apparatus and method are provided for scheduling transmit network events in a multiprocessing environment. Each processing node handles its own linked list of transmit object queues and linked list of transport queues. Therefore efficient handling of the transmit network events is enabled. Queues may be added, made inactive, or removed depending on the status of a specific transmit event the queue handles. By maintaining queues in memory, the apparatus is easily scalable, in linear relationship with the size of the memory made available.

Abstract: A network interface card comprising an upper layer protocol (ULP) handler, a TCP handler capable of interfacing with said ULP handler and, a link handler. The network interface card is adapted to take over and perform at least one session layer function of a host computer connected to a network.

Abstract: A method for accelerating storage access in a network. The method comprises receiving a data record having a plurality of data segments. The data segments are stored in a local memory of a network controller (NC). A virtual write buffer (VWB) entry is assigned for the incoming data record in the NC local memory. The data segments of said data record are reassemble using the VWB. The data record is sent from the network controller directly to an I/O controller of a storage device.

Abstract: A network interface card comprising an upper layer protocol (ULP) handler, a TCP handler capable of interfacing with said ULP handler and, a link handler. The network interface card is adapted to take over and perform at least one session layer function of a host computer connected to a network.

Abstract: An apparatus and method are provided for termination of received network events (i.e., a packet received from the network) in a multiprocessing environment. Each processing node may handle one or more receive object queues, which may be linked in a linked list fashion, as well as a linked list of application stream queues to enable efficient termination of the received network events. Queues may be added, made inactive, or removed, depending on the status of a specific receive event the queue handles. By maintaining queues in memory the apparatus is easily scalable, linearly with the size of the memory made available.

Abstract: An apparatus and method are provided for termination of received network events (i.e., a packet received from the network) in a multiprocessing environment. Each processing node may handle one or more receive object queues, which may be linked in a linked list fashion, as well as a linked list of application stream queues to enable efficient termination of the received network events. Queues may be added, made inactive, or removed, depending on the status of a specific receive event the queue handles. By maintaining queues in memory the apparatus is easily scalable, linearly with the size of the memory made available.

Abstract: An apparatus and method are provided for scheduling transmit network events in a multiprocessing environment. Each processing node handles its own linked list of transmit object queues and linked list of transport queues. Therefore efficient handling of the transmit network events is enabled. Queues may be added, made inactive, or removed depending on the status of a specific transmit event the queue handles. By maintaining queues in memory, the apparatus is easily scalable, in linear relationship with the size of the memory made available.

Abstract: A networked system comprising a host computer. A data streamer is connected to the host computer. The data streamer is capable of transferring data between the host and networked resources using a memory location without moving the data within the memory location. A communication link connects the data streamer and networked resources.