SATURATION DETECTION AND ADMISSION CONTROL FOR STORAGE DEVICES
    1.
    发明申请
    SATURATION DETECTION AND ADMISSION CONTROL FOR STORAGE DEVICES 审中-公开
    存储设备的饱和度检测和接收控制

    公开(公告)号:US20170019465A1

    公开(公告)日:2017-01-19

    申请号:US15280579

    申请日:2016-09-29

    Applicant: VMware, Inc.

    Abstract: Maximum throughput of a storage unit, and workload and latency values of the storage unit corresponding to a predefined fraction of the maximum throughput are estimated based on workloads and latencies that are monitored on the storage unit. The computed metrics are usable in a variety of different applications including admission control, storage load balancing, and enforcing quality of service in a shared storage environment.

    Abstract translation: 基于在存储单元上监视的工作负载和延迟来估计存储单元的最大吞吐量,以及对应于最大吞吐量的预定义分数的存储单元的工作负载和延迟值。 所计算的度量可用于各种不同的应用,包括准入控制,存储负载平衡和在共享存储环境中实施服务质量。

    SOFTWARE APPLICATION PLACEMENT USING COMPUTING RESOURCE CONTAINERS
    2.
    发明申请
    SOFTWARE APPLICATION PLACEMENT USING COMPUTING RESOURCE CONTAINERS 审中-公开
    使用计算资源容器的软件应用程序

    公开(公告)号:US20140331227A1

    公开(公告)日:2014-11-06

    申请号:US14332291

    申请日:2014-07-15

    Applicant: VMware, Inc.

    Abstract: Embodiments associate software applications with computing resource containers based on placement rules. A placement rule indicates that a first software application is to be co-located with a second software application during execution of the first and second software applications and second placement rule indicates that the first software application is to be separated from the second software application when the second placement rule is violated by enforcing the first placement rule. The placement rule also indicates that the first software application is to be separated from the second software application during execution of the first and second software applications and the second placement rule indicates the first software application is to be co-located with the second software application when the second placement rule is violated by enforcing the first placement rule.

    Abstract translation: 实施例将软件应用与基于放置规则的计算资源容器相关联。 放置规则指示在执行第一和第二软件应用期间第一软件应用程序将与第二软件应用程序位于同一位置,而第二软件应用程序指示当第一软件应用程序与第二软件应用程序分离时, 执行第一个放置规则会违反第二个放置规则。 放置规则还指示在执行第一和第二软件应用期间第一软件应用程序与第二软件应用程序分离,并且第二布局规则指示第一软件应用程序将与第二软件应用程序位于同一位置时 执行第一个放置规则会违反第二个放置规则。

    COMPUTER STORAGE DEDUPLICATION
    3.
    发明申请

    公开(公告)号:US20200065318A1

    公开(公告)日:2020-02-27

    申请号:US16671802

    申请日:2019-11-01

    Applicant: VMware, Inc.

    Abstract: Decentralized deduplication operations in a computer system employ a hash index that is a variant of a B+ tree to support both efficient sequential updates as well as efficient random updates. Sequential update is selected when deduplication is infrequently performed, such as on the order of days, and random update is selected when deduplication is performed more frequently, such as on the order of seconds. More frequent deduplication may be beneficial during periods when large amounts of temporary duplicate data are created, and the system may not have enough storage space to accommodate the temporary spike in demand.

    DECENTRALIZED MANAGEMENT OF VIRTUALIZED HOSTS
    4.
    发明申请
    DECENTRALIZED MANAGEMENT OF VIRTUALIZED HOSTS 审中-公开
    虚拟主机的分散化管理

    公开(公告)号:US20150128138A1

    公开(公告)日:2015-05-07

    申请号:US14508685

    申请日:2014-10-07

    Applicant: VMware, Inc.

    Abstract: One or more embodiments of the present invention provide a technique for effectively managing virtualized computing systems with an unlimited number of hardware resources. Host systems included in a virtualized computer system are organized into a scalable, peer-to-peer (P2P) network in which host systems arrange themselves into a network overlay to communicate with one another. The network overlay enables the host systems to perform a variety of operations, which include dividing computing resources of the host systems among a plurality of virtual machines (VMs), load balancing VMs across the host systems, and performing an initial placement of a VM in one of the host systems.

    Abstract translation: 本发明的一个或多个实施例提供了一种用于以无限数量的硬件资源有效地管理虚拟化计算系统的技术。 包括在虚拟化计算机系统中的主机系统被组织成可扩展的对等(P2P)网络,其中主机系统将其自身布置成网络覆盖以便彼此通信。 网络覆盖使得主机系统能够执行各种操作,其包括在多个虚拟机(VM)中划分主机系统的计算资源,跨主机系统负载平衡VM,以及执行VM的初始放置 其中一个主机系统。

    DECENTRALIZED INPUT/OUTPUT RESOURCE MANAGEMENT
    5.
    发明申请
    DECENTRALIZED INPUT/OUTPUT RESOURCE MANAGEMENT 审中-公开
    分散式输入/输出资源管理

    公开(公告)号:US20140237113A1

    公开(公告)日:2014-08-21

    申请号:US14263231

    申请日:2014-04-28

    Applicant: VMware, INC.

    Abstract: A shared input/output (IO) resource is managed in a decentralized manner. Each of multiple hosts having IO access to the shared resource, computes an average latency value that is normalized with respect to average IO request sizes, and stores the computed normalized latency value for later use. The normalized latency values thus computed and stored may be used for a variety of different applications, including enforcing a quality of service (QoS) policy that is applied to the hosts, detecting a condition known as an anomaly where a host that is not bound by a QoS policy accesses the shared resource at a rate that impacts the level of service received by the plurality of hosts that are bound by the QoS policy, and migrating workloads between storage arrays to achieve load balancing across the storage arrays.

    Abstract translation: 共享的输入/输出(IO)资源以分散的方式进行管理。 具有对共享资源的IO访问权的多个主机中的每一个计算相对于平均IO请求大小进行归一化的平均延迟值,并且存储所计算的归一化等待时间值以备以后使用。 如此计算和存储的归一化等待时间值可以用于各种不同的应用,包括实施应用于主机的服务质量(QoS)策略,检测被称为异常的状况,其中不受 QoS策略以影响由QoS策略约束的多个主机接收的服务等级的速率访问共享资源,以及在存储阵列之间迁移工作负载以实现跨存储阵列的负载平衡。

    SOFTWARE APPLICATION PLACEMENT USING COMPUTING RESOURCE CONTAINERS
    7.
    发明申请
    SOFTWARE APPLICATION PLACEMENT USING COMPUTING RESOURCE CONTAINERS 审中-公开
    使用计算资源容器的软件应用程序

    公开(公告)号:US20160188357A1

    公开(公告)日:2016-06-30

    申请号:US14875888

    申请日:2015-10-06

    Applicant: VMware, Inc.

    Abstract: Embodiments associate software applications with computing resource containers based on a placement rule and a selected failure correlation. A placement rule indicates that a first software application is to be co-located with a second software application during execution of the first and second software applications. The placement rule also indicates that the first software application is to be separated from the second software application during execution of the first and second software applications. Failure correlations are determined for a plurality of computing resources associated with the first software application. A computing resource with a lowest failure correlation is selected from the plurality of computing resources, and the second software application is associated with the selected computing resource despite the association violating the placement rule.

    Abstract translation: 实施例基于放置规则和选择的故障相关性将软件应用与计算资源容器相关联。 放置规则指示在执行第一和第二软件应用期间,第一软件应用程序将与第二软件应用程序位于同一位置。 放置规则还指示在执行第一和第二软件应用期间,第一软件应用程序将与第二软件应用程序分离。 针对与第一软件应用相关联的多个计算资源确定故障相关性。 从多个计算资源中选择具有最低故障相关性的计算资源,并且第二软件应用程序与所选择的计算资源相关联,尽管关联违反放置规则。

    METHOD OF ALLOCATING REFERENCED MEMORY PAGES FROM A FREE LIST
    8.
    发明申请
    METHOD OF ALLOCATING REFERENCED MEMORY PAGES FROM A FREE LIST 审中-公开
    从免费列表分配引用的记忆页的方法

    公开(公告)号:US20150301931A1

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

    申请号:US14790604

    申请日:2015-07-02

    Applicant: VMware, Inc.

    Abstract: Memory pages that are allocated to a memory consumer and continue to be accessed by the memory consumer are included in a free list, so that they may be immediately allocated to another memory consumer as needed during the course of normal operation without preserving the original contents of the memory page. When a memory page in the free list is accessed to perform a read, a generation number associated with the memory page is compared with a stored copy. If the two match, the read is performed on the memory page. If the two do not match, the read is not performed on the memory page.

    Abstract translation: 分配给存储器使用者并继续被存储器消费者访问的存储器页面被包括在空闲列表中,使得它们可以在正常操作过程中根据需要被立即分配给另一个存储器消费者,而不保留原始内容 内存页面。 当访问空闲列表中的存储器页面以执行读取时,将与存储器页面相关联的代数与存储的副本进行比较。 如果两者匹配,则在内存页上执行读取。 如果两者不匹配,则不会在内存页上执行读取。

Patent Agency Ranking