中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

9 records (took 0.014 seconds)

    Object-based load balancing approaches in distributed storage system
    3.
    发明授权
    Object-based load balancing approaches in distributed storage system 有权

    公开(公告)号：US11507409B2

    公开(公告)日：2022-11-22

    申请号：US16820735

    申请日：2020-03-17

    Applicant: VMware, Inc.

    Inventor： Haitao Zhou ,  Yang Yang ,  Zhaohui Guo ,  Jian Zhao ,  Zhou Huang ,  Jin Feng

    IPC: G06F9/455 ,  G06F3/06 ,  G06F13/42

    Abstract: One example method to perform object-based load balancing in a distributed storage system of a virtualization system supported by a cluster of host machines may include determining, by a first host machine in the cluster, whether any host machine in the cluster has affinity to a site. The method may also include determining, by the first host machine, whether to distribute affinity Internet small computer system interface (iSCSI) targets owned by the first host machine to at least the second machine based on a first balance objective associated with the site, and after having considered the first balance objective, determining, by the first host machine, whether to distribute iSCSI targets without affinity owned by the first host machine to other host machines in the cluster based on a second balance objective associated with the cluster.

    Routing traffic of a logical unit to multiple backend data objects based on metadata mapping
    5.
    发明授权
    Routing traffic of a logical unit to multiple backend data objects based on metadata mapping 有权

    公开(公告)号：US11176053B2

    公开(公告)日：2021-11-16

    申请号：US16653548

    申请日：2019-10-15

    Applicant: VMware, Inc.

    Inventor： Yang Yang ,  Zhaohui Guo ,  Haitao Zhou ,  Zhou Huang ,  Jian Zhao ,  Jin Feng

    IPC: G06F12/10 ,  G06F13/16

    Abstract: The disclosure herein describes enabling use of a logical unit for data storage in a distributed storage system using a plurality of backend data objects. Based on receiving instructions to create a logical unit of a logical unit size, a target backend object size to be used with the logical unit is determined, and a plurality of backend objects for allocation to the logical unit is calculated. The backend objects are allocated to the logical unit and a metadata mapping associated with the logical unit is generated. The metadata mapping associates logical block addresses of the logical unit to the allocated backend objects. The logical unit is linked with the metadata mapping in an input/output (I/O) service and, based on the linked metadata mapping, I/O traffic is routed to and from the logical unit. Using multiple backend objects enhances flexibility and efficiency of data storage on the distributed storage system.

    System and method of a highly concurrent cache replacement algorithm
    6.
    发明授权
    System and method of a highly concurrent cache replacement algorithm 有权

    公开(公告)号：US11086779B2

    公开(公告)日：2021-08-10

    申请号：US16679570

    申请日：2019-11-11

    Applicant: VMware, Inc.

    Inventor： Wenguang Wang ,  Mounesh Badiger ,  Abhay Kumar Jain ,  Junlong Gao ,  Zhaohui Guo ,  Richard P. Spillane

    IPC: G06F12/08 ,  G06F12/0842 ,  G06F12/0844 ,  G06F12/14 ,  G06F12/1018 ,  G06F12/0871

    Abstract: Disclosed are a method and system for managing multi-threaded concurrent access to a cache data structure. The cache data structure includes a hash table and three queues. The hash table includes a list of elements for each hash bucket with each hash bucket containing a mutex object and elements in each of the queues containing lock objects. Multiple threads can each lock a different hash bucket to have access to the list, and multiple threads can each lock a different element in the queues. The locks permit highly concurrent access to the cache data structure without conflict. Also, atomic operations are used to obtain pointers to elements in the queues so that a thread can safely advance each pointer. Race conditions that are encountered with locking an element in the queues or entering an element into the hash table are detected, and the operation encountering the race condition is retried.

    Graphical display for illustrating resource management
    7.
    发明授权
    Graphical display for illustrating resource management 有权

    公开(公告)号：US10289455B2

    公开(公告)日：2019-05-14

    申请号：US15378069

    申请日：2016-12-14

    Applicant: VMware, Inc.

    Inventor： Shugang Guo ,  Jin Feng ,  Yixiang Zhang ,  Zhaohui Guo

    IPC: G06F9/44 ,  G06F9/50 ,  G06T11/20 ,  G06F11/30 ,  G06F11/32 ,  G06F11/34

    Abstract: A method to present information associated with a group of virtual components in a virtualized environment includes collecting a first resource usage data and a second resource usage data associated with a virtual component of the group of virtual components. In response to a region of the graphical representation associated with a difference between the first resource usage data and the second resource usage data exceeding a threshold, the method also includes collecting first graphical representation rendering information to render the first resource usage data as a first graphic in the graphical representation, collecting second graphical representation rendering information to render the second resource usage data as a second graphic in the graphical representation, and collecting third graphical representation rendering information including a reduction factor to reduce the region in the graphical representation to a third graphic in the graphical representation.

Patent Agency Ranking