OBTAIN BUFFERS FOR AN INPUT/OUTPUT DRIVER
    1.
    发明申请
    OBTAIN BUFFERS FOR AN INPUT/OUTPUT DRIVER 审中-公开
    用于输入/输出驱动器的获取缓冲器

    公开(公告)号:US20100153974A1

    公开(公告)日:2010-06-17

    申请号:US12335612

    申请日:2008-12-16

    IPC分类号: G06F9/44

    CPC分类号: G06F9/544 G06F9/545

    摘要: Disclosed is a computer implemented method, computer program product, and apparatus to obtain buffers in a multiprocessor system. A software component receives a call from an I/O device driver for a buffer, the call including at least one parameter, and walks a bucket data structure to a current bucket. The software component then determines whether the current bucket is free, and obtains a buffer list contained with the current bucket. Responsive to a determination that the current bucket is free, the software component determines whether sufficient buffers are obtained based on the parameter. Upon determining there are sufficient buffers obtained, the software component provides the current bucket and a second bucket as a single buffer list to the I/O device driver.

    摘要翻译: 公开了一种在多处理器系统中获得缓冲器的计算机实现方法,计算机程序产品和装置。 软件组件从缓冲器的I / O设备驱动程序接收呼叫,该呼叫包括至少一个参数,并且将数据桶数据结构移动到当前存储桶。 然后,软件组件确定当前存储桶是否空闲,并获得当前存储桶中包含的缓冲区列表。 响应于确定当前存储桶是空闲的,软件组件基于该参数确定是否获得足够的缓冲区。 在确定获得足够的缓冲器后,软件组件将当前存储桶和第二存储桶作为单个缓冲器列表提供给I / O设备驱动程序。

    Adaptive Fast Retransmit Threshold to Make TCP Robust to Non-Congestion Events
    2.
    发明申请
    Adaptive Fast Retransmit Threshold to Make TCP Robust to Non-Congestion Events 有权
    自适应快速重传阈值,使TCP稳健地进行非拥塞事件

    公开(公告)号:US20100008223A1

    公开(公告)日:2010-01-14

    申请号:US12169816

    申请日:2008-07-09

    IPC分类号: H04L12/56 H04J3/16

    摘要: Methods, systems, and media are disclosed for adjusting a fast re-transmit threshold (FRT) value for transmitting data streams over a computer system. One embodiment includes receiving, by a sender, a current fast re-transmit threshold value for a packet from a receiver. Further, the method includes decreasing the size of the congestion window of the sender, and re-transmitting the packet to the receiver in network communication with the sender. Further still, the method includes counting, by the sender, a number of dupacks after re-transmitting the packet until arrival, at the sender, of an acknowledgement (ACK) for the packet. Yet further, the method includes determining, based on the size of the congestion window and the counting, a value of the FRT value. If the sender receives the ACK for the packet in less than one round trip time, then this may be a re-ordering problem for re-setting the FRT value.

    摘要翻译: 公开了用于调整通过计算机系统传输数据流的快速重传阈值(FRT)值的方法,系统和媒体。 一个实施例包括由发送器接收来自接收器的分组的当前快速重传阈值。 此外,该方法包括减少发送者的拥塞窗口的大小,并且在与发送者的网络通信中将分组重新发送到接收者。 此外,该方法还包括由发送方在重新发送分组之后对发送方到达分组的确认(ACK)到达发送方的次数进行计数。 此外,该方法包括基于拥塞窗口的大小和计数来确定FRT值的值。 如果发送方在少于一个往返时间内接收到该数据包的ACK,则这可能是重新设置FRT值的重新排序问题。

    DYNAMIC NETWORK ADAPTER QUEUE PAIR ALLOCATION
    4.
    发明申请
    DYNAMIC NETWORK ADAPTER QUEUE PAIR ALLOCATION 失效
    动态网络适配器队列配对

    公开(公告)号:US20120192183A1

    公开(公告)日:2012-07-26

    申请号:US13423181

    申请日:2012-03-17

    IPC分类号: G06F9/455

    摘要: A method of dynamically changing an allocation of queue pair resources to an operating system image running in virtualized environment receives a notification at the operating system image of a change in allocation of queue pair resources to the operating system image. The method queries a physical network adapter through a hypervisor to obtain a new queue pair resource count that will exist in the virtualized system after the change in allocation. The method performs a hashing operation in the operating system image using the new queue pair resource count to distribute transmit traffic among the queue pair resources that will exist in the virtualized system after the change in allocation.

    摘要翻译: 动态地将队列对资源的分配动态地改变为在虚拟环境中运行的操作系统映像的方法在操作系统映像处接收到对操作系统映像的队列对资源的分配改变的通知。 该方法通过管理程序查询物理网络适配器,以获得在分配更改后将存在于虚拟化系统中的新的队列对资源计数。 该方法使用新的队列对资源计数在操作系统映像中执行散列操作,以便在分配更改之后在虚拟化系统中存在的队列对资源之间分配传输流量。

    Sharing buffer space in link aggregation configurations
    5.
    发明授权
    Sharing buffer space in link aggregation configurations 有权
    在链路聚合配置中共享缓冲区空间

    公开(公告)号:US09178839B2

    公开(公告)日:2015-11-03

    申请号:US12179242

    申请日:2008-07-24

    IPC分类号: H04L12/861 H04L12/891

    摘要: In link aggregation configurations, a data packet may be copied into a buffer space of a first NIC. Load balancing techniques may determine that the packet should be transmitted by a second NIC. The packet exists in memory that the second NIC cannot access. The data packet is copied into memory accessible to the second NIC or the memory location of the packet is registered with the NIC. A copy penalty is incurred if a packet is copied from a first buffer space to a second buffer space. A registration penalty is incurred if the location within the first buffer space is registered with the second NIC. Functionality can be implemented within a link aggregation configuration to register buffer space shared among interconnected NICs. Sharing of buffer space between interconnected NICs allows any one of the NICs to access data within the shared buffer space without incurring a penalty.

    摘要翻译: 在链路聚合配置中,可以将数据分组复制到第一NIC的缓冲空间中。 负载均衡技术可以确定分组应该由第二NIC发送。 数据包存在于第二个NIC无法访问的内存中。 将数据包复制到第二个NIC可访问的存储器中,或者将该数据包的存储位置注册到NIC。 如果将数据包从第一个缓冲区复制到第二个缓冲区,则会产生复制损失。 如果第一个缓冲空间内的位置与第二个NIC进行了注册,就会产生注册损失。 可以在链路聚合配置中实现功能,以注册在互连NIC之间共享的缓冲区空间。 在互连NIC之间共享缓冲区空间允许任何一个NIC访问共享缓冲区空间内的数据,而不会造成惩罚。

    Adaptive fast retransmit threshold to make TCP robust to non-congestion events
    6.
    发明授权
    Adaptive fast retransmit threshold to make TCP robust to non-congestion events 有权
    自适应快速重传阈值,使TCP对非拥塞事件的鲁棒性

    公开(公告)号:US08094557B2

    公开(公告)日:2012-01-10

    申请号:US12169816

    申请日:2008-07-09

    IPC分类号: H04L12/56

    摘要: Mechanisms are disclosed for adjusting a fast re-transmit threshold (FRT) value for transmitting data streams over a computer system. One embodiment includes receiving, by a sender, a current fast re-transmit threshold value for a packet from a receiver. Further, these mechanisms include decreasing the size of the congestion window of the sender, and re-transmitting the packet to the receiver in network communication with the sender. Further still, the mechanisms include counting, by the sender, a number of dupacks after re-transmitting the packet until arrival, at the sender, of an acknowledgement (ACK) for the packet. Yet further, the mechanisms include determining, based on the size of the congestion window and the counting, a value of the FRT value. If the sender receives the ACK for the packet in less than one round trip time, then this may be a re-ordering problem for re-setting the FRT value.

    摘要翻译: 公开了用于调整通过计算机系统传输数据流的快速重传阈值(FRT)值的机制。 一个实施例包括由发送器接收来自接收器的分组的当前快速重传阈值。 此外,这些机制包括减少发送者的拥塞窗口的大小,并且在与发送者的网络通信中将分组重新发送到接收者。 此外,这些机制还包括在重发数据包之后由发送方对发送方在数据包的确认(ACK)到达发送方的情况下对数量的重复进行计数。 此外,这些机制包括基于拥塞窗口的大小和计数来确定FRT值的值。 如果发送方在少于一个往返时间内接收到该数据包的ACK,则这可能是重新设置FRT值的重新排序问题。

    Single DMA transfers from device drivers to network adapters
    7.
    发明授权
    Single DMA transfers from device drivers to network adapters 失效
    从设备驱动程序到网络适配器的单DMA传输

    公开(公告)号:US08054848B2

    公开(公告)日:2011-11-08

    申请号:US12468741

    申请日:2009-05-19

    IPC分类号: H04L12/28

    摘要: Methods and arrangements of data communications are discussed. Embodiments include transformations, code, state machines or other logic to provide data communications. An embodiment may involve receiving from a protocol stack a request for a buffer to hold data. The data may consist of all or part of a payload of a packet. The embodiment may also involve allocating space in a buffer for the data and for a header of a packet. The protocol stack may store the data in a portion of the buffer and hand down the buffer to a network device driver. The embodiment may also involve the network device driver transferring the entire packet from the buffer to a communications adapter in a single direct memory access (DMA) operation.

    摘要翻译: 讨论数据通信的方法和布置。 实施例包括转换,代码,状态机或提供数据通信的其他逻辑。 实施例可以包括从协议栈接收对缓冲器的请求以保存数据。 数据可以由分组的有效载荷的全部或部分组成。 该实施例还可以涉及为数据和数据包的报头分配缓冲器中的空间。 协议栈可以将数据存储在缓冲区的一部分中,并将缓冲区移交给网络设备驱动程序。 该实施例还可以涉及在单个直接存储器访问(DMA)操作中的网络设备驱动器将整个分组从缓冲器传送到通信适配器。

    Single DMA Transfers from Device Drivers to Network Adapters
    8.
    发明申请
    Single DMA Transfers from Device Drivers to Network Adapters 失效
    从设备驱动程序到网络适配器的单DMA传输

    公开(公告)号:US20100296518A1

    公开(公告)日:2010-11-25

    申请号:US12468741

    申请日:2009-05-19

    摘要: Methods and arrangements of data communications are discussed. Embodiments include transformations, code, state machines or other logic to provide data communications. An embodiment may involve receiving from a protocol stack a request for a buffer to hold data. The data may consist of all or part of a payload of a packet. The embodiment may also involve allocating space in a buffer for the data and for a header of a packet. The protocol stack may store the data in a portion of the buffer and hand down the buffer to a network device driver. The embodiment may also involve the network device driver transferring the entire packet from the buffer to a communications adapter in a single direct memory access (DMA) operation.

    摘要翻译: 讨论数据通信的方法和布置。 实施例包括转换,代码,状态机或提供数据通信的其他逻辑。 实施例可以包括从协议栈接收对缓冲器的请求以保存数据。 数据可以由分组的有效载荷的全部或部分组成。 该实施例还可以涉及为数据和数据包的报头分配缓冲器中的空间。 协议栈可以将数据存储在缓冲区的一部分中,并将缓冲区移交给网络设备驱动程序。 该实施例还可以涉及在单个直接存储器访问(DMA)操作中的网络设备驱动器将整个分组从缓冲器传送到通信适配器。

    Method for efficient determination of memory copy versus registration in direct access environments
    10.
    发明授权
    Method for efficient determination of memory copy versus registration in direct access environments 有权
    在直接访问环境中有效确定内存复制与注册的方法

    公开(公告)号:US07685330B2

    公开(公告)日:2010-03-23

    申请号:US11372384

    申请日:2006-03-09

    IPC分类号: G06F13/28 G06F12/08

    CPC分类号: H04L49/90 H04L69/32

    摘要: A memory registration abstraction layer includes decision logic for dynamic, efficient determination of memory copy versus registration. The exemplary embodiments apply to direct memory access environments. The memory registration abstraction layer also includes tracking logic for monitoring the usage history for certain ranges of memory registration requests. The registration logic chooses to copy memory or map memory based on training and observation of application behavior, taking the more efficient performance path without requiring changes to the application.

    摘要翻译: 存储器注册抽象层包括用于动态,有效地确定存储器拷贝与注册的决策逻辑。 示例性实施例适用于直接存储器访问环境。 存储器注册抽象层还包括用于监视某些范围的存储器注册请求的使用历史的跟踪逻辑。 注册逻辑根据应用行为的训练和观察选择复制内存或映射内存,采取更有效的性能路径,而不需要更改应用程序。