NUMA I/O aware network queue assignments
    2.
    发明授权
    NUMA I/O aware network queue assignments 有权
    NUMA I / O感知网络队列分配

    公开(公告)号:US09495192B2

    公开(公告)日:2016-11-15

    申请号:US14530574

    申请日:2014-10-31

    Applicant: VMWare, Inc.

    Abstract: Systems and methods for preferentially assigning virtual machines (VMs) on a particular NUMA node with network queues on the same NUMA node are described. A load balancer process on a host assigns multiple VMs to network queues. The assignment of the VMs to a network queues is performed with a bias toward assigning VMs using a particular NUMA node to network queues on the same NUMA node. A scheduler on the host assigns VMs to NUMA nodes. The scheduler is biased toward assigning VMs to the same NUMA node as the PNIC and/or the same NUMA node as a network queue assigned to the VM.

    Abstract translation: 描述用于在具有相同NUMA节点上的网络队列的特定NUMA节点上优先分配虚拟机(VM)的系统和方法。 主机上的负载均衡器进程将多个虚拟机分配给网络队列。 将虚拟机分配给网络队列的方式是偏向于使用特定的NUMA节点将VM分配到同一NUMA节点上的网络队列。 主机上的调度程序将VM分配给NUMA节点。 调度器偏向于将VM分配给与作为分配给VM的网络队列的PNIC和/或相同的NUMA节点相同的NUMA节点。

    FAST LOOKUP AND UPDATE OF CURRENT HOP LIMIT
    3.
    发明申请
    FAST LOOKUP AND UPDATE OF CURRENT HOP LIMIT 有权
    快速查看和更新​​当前的限制

    公开(公告)号:US20150281049A1

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

    申请号:US14231677

    申请日:2014-03-31

    Applicant: VMware, Inc.

    CPC classification number: H04L45/20 H04L45/02 H04L45/48 H04L45/566 H04L69/16

    Abstract: In order to facilitate efficient and scalable lookup of current hop limits of transmitted packets, a communications device embeds hop limit values along with other connection parameters in a connection data structure. To transmit a packet for a particular connection, the communications device retrieves the data structure for the particular connection and applies the hop limit value embedded in the data structure to the packet for transmission. To keep track of the hop limits being embedded in different data structures of different connections, the communications device use a binary search in which each node of the search tree correspond to a different connection. The communications device maintains one such search tree per communications interface.

    Abstract translation: 为了便于有效和可扩展地查找传输分组的当前跳数限制,通信设备将跳数限制值与连接数据结构中的其他连接参数一起嵌入。 为了发送用于特定连接的分组,通信设备检索特定连接的数据结构,并将嵌入在数据结构中的跳数限制值应用于分组以进行传输。 为了跟踪嵌入在不同连接的不同数据结构中的跳数限制,通信设备使用二叉搜索,其中搜索树的每个节点对应于不同的连接。 通信设备每个通信接口维护一个这样的搜索树。

    Group clustering using inter-group dissimilarities

    公开(公告)号:US10706079B2

    公开(公告)日:2020-07-07

    申请号:US15877977

    申请日:2018-01-23

    Applicant: VMware, Inc.

    Abstract: Certain embodiments described herein are generally directed to improving performance of one or more machines within a system by clustering multidimensional datasets relating to the performance of the machines using inter-group dissimilarities between groups of the dataset. The method for improving performance of one or more machines within a system, includes forming a multidimensional dataset having a plurality of groups using performance related data associated with one or more machines in the system, clustering the plurality of groups into one or more clusters based on intergroup dissimilarities between the plurality of groups, identifying one or more anomalous clusters from among the one or more clusters, identifying the one or more anomalous groups in the one or more anomalous clusters, and adjusting a configuration of the system to improve the performance of the one or more machines corresponding to the one or more anomalous groups.

    FAST LOOKUP AND UPDATE OF CURRENT HOP LIMIT
    6.
    发明申请

    公开(公告)号:US20190230024A1

    公开(公告)日:2019-07-25

    申请号:US16253105

    申请日:2019-01-21

    Applicant: VMware, Inc.

    Abstract: In order to facilitate efficient and scalable lookup of current hop limits of transmitted packets, a communications device embeds hop limit values along with other connection parameters in a connection data structure. To transmit a packet for a particular connection, the communications device retrieves the data structure for the particular connection and applies the hop limit value embedded in the data structure to the packet for transmission. To keep track of the hop limits being embedded in different data structures of different connections, the communications device use a binary search in which each node of the search tree correspond to a different connection. The communications device maintains one such search tree per communications interface.

    Fast lookup and update of current hop limit

    公开(公告)号:US10187294B2

    公开(公告)日:2019-01-22

    申请号:US15607670

    申请日:2017-05-29

    Applicant: VMware, Inc.

    Abstract: In order to facilitate efficient and scalable lookup of current hop limits of transmitted packets, a communications device embeds hop limit values along with other connection parameters in a connection data structure. To transmit a packet for a particular connection, the communications device retrieves the data structure for the particular connection and applies the hop limit value embedded in the data structure to the packet for transmission. To keep track of the hop limits being embedded in different data structures of different connections, the communications device use a binary search in which each node of the search tree correspond to a different connection. The communications device maintains one such search tree per communications interface.

    Systems and methods for non-uniform memory access aligned I/O for virtual machines

    公开(公告)号:US10338822B2

    公开(公告)日:2019-07-02

    申请号:US15183386

    申请日:2016-06-15

    Applicant: VMware, Inc.

    Abstract: Systems and methods described herein align various types of hypervisor threads with a non-uniform memory access (NUMA) client of a virtual machine (VM) that is driving I/O transactions from an application so that no remote memory access is required and the I/O transactions can be completed with local accesses to CPUs, caches, and the I/O devices of a same NUMA node of a hardware NUMA system. First, hypervisor of the VM detects whether the VM runs on a single or multiple NUMA nodes. If the VM runs on multiple NUMA nodes, a NUMA client on which the application is executing the I/O transactions is identified and knowledge of resource sharing between the NUMA client and its related hypervisor threads is established. Such knowledge is then utilized to schedule the NUMA client and its related hypervisor threads to the same NUMA node of the NUMA system.

    FAST LOOKUP AND UPDATE OF CURRENT HOP LIMIT
    9.
    发明申请

    公开(公告)号:US20170331723A1

    公开(公告)日:2017-11-16

    申请号:US15607670

    申请日:2017-05-29

    Applicant: VMware, Inc.

    CPC classification number: H04L45/20 H04L45/02 H04L45/48 H04L45/566 H04L69/16

    Abstract: In order to facilitate efficient and scalable lookup of current hop limits of transmitted packets, a communications device embeds hop limit values along with other connection parameters in a connection data structure. To transmit a packet for a particular connection, the communications device retrieves the data structure for the particular connection and applies the hop limit value embedded in the data structure to the packet for transmission. To keep track of the hop limits being embedded in different data structures of different connections, the communications device use a binary search in which each node of the search tree correspond to a different connection. The communications device maintains one such search tree per communications interface.

    Fast lookup and update of current hop limit

    公开(公告)号:US09667528B2

    公开(公告)日:2017-05-30

    申请号:US14231677

    申请日:2014-03-31

    Applicant: VMware, Inc.

    CPC classification number: H04L45/20 H04L45/02 H04L45/48 H04L45/566 H04L69/16

    Abstract: In order to facilitate efficient and scalable lookup of current hop limits of transmitted packets, a communications device embeds hop limit values along with other connection parameters in a connection data structure. To transmit a packet for a particular connection, the communications device retrieves the data structure for the particular connection and applies the hop limit value embedded in the data structure to the packet for transmission. To keep track of the hop limits being embedded in different data structures of different connections, the communications device use a binary search in which each node of the search tree correspond to a different connection. The communications device maintains one such search tree per communications interface.

Patent Agency Ranking