利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

1051 条记录 (耗时 0.023 秒)

    Scalable leadership election in a multi-processing computing environment
    21.
    发明授权
    Scalable leadership election in a multi-processing computing environment 有权

    公开(公告)号：US11888599B2

    公开(公告)日：2024-01-30

    申请号：US17646480

    申请日：2021-12-29

    申请人： Nutanix, Inc.

    发明人： Karan Gupta ,  Pavan Kumar Konka ,  Parthasarathy Ramachandran ,  Arun Olappamanna Vasudevan ,  Andrey Alexseyevich Pyatkov

    IPC分类号： H04L47/70 ,  H04L67/10 ,  H04L67/01

    CPC分类号： H04L47/70 ,  H04L67/01 ,  H04L67/10

    摘要： A scalable multi-cluster resource sharing facility. A global witness process runs on a first computing platform that communicates over one or more networks to any number of nodes situated over two or more clusters. The global witness process listens on the network for occurrences of leadership and/or resource requests from nodes of different clusters. The global witness processes a request by retrieving a resource request and a respective last known state value, comparing the last known state value to a global stored state value, then storing a new state value when the respective last known state value is equal to the stored state value. Any number of contemporaneous requests can be processed by the global witness process, however only one request can be granted. The other requestors each receive a rejection of their resource request when their proffered last known state value is not equal to the stored state value.

    OPTIMIZING EXECUTION OF SCHEDULED TASKS
    24.
    发明公开
    OPTIMIZING EXECUTION OF SCHEDULED TASKS 审中-公开

    公开(公告)号：US20230418669A1

    公开(公告)日：2023-12-28

    申请号：US18329153

    申请日：2023-06-05

    申请人： Nutanix, Inc.

    发明人： Deepti Gupta ,  Ashish Dhar ,  Akshay Chandak

    IPC分类号： G06F9/48

    CPC分类号： G06F9/4887

    摘要： A system may include a memory having computer-readable instructions stored thereon, and a processor that executes the computer-readable instructions to determine a plurality of scheduled events to be executed in a time period, determine a number of buckets in the time period based on a predetermined permissible interval, generate a plurality of buckets equal to the number of buckets in the time period, wherein each of the plurality of buckets is associated with a time interval, and schedule each of the plurality of scheduled events in one of the plurality of buckets, wherein execution of each of the plurality of scheduled events is delayed or advanced from an original scheduled time based on the predetermined permissible interval.

    Global entity distribution
    27.
    发明授权
    Global entity distribution 有权

    公开(公告)号：US11853177B2

    公开(公告)日：2023-12-26

    申请号：US17702748

    申请日：2022-03-23

    申请人： Nutanix, Inc.

    发明人： Bharat Kumar Beedu ,  Ganesh Sahukari ,  Nikhil Loya ,  Sharad Maheshwari

    IPC分类号： G06F11/20 ,  H04L67/1095 ,  G06F9/455 ,  G06F11/14

    CPC分类号： G06F11/2076 ,  G06F9/45533 ,  G06F11/1464 ,  H04L67/1095 ,  G06F2009/45595

    摘要： Methods, systems and computer program products for data protection across computing infrastructure comprising a plurality of geographically distant computing clusters. The geographically distant computing clusters form a distributed system comprising clusters that are assigned into availability zones. Disaster recovery policies are maintained in each of the availability zones. A first cluster detects a modification of a disaster recovery policy. The modification of the disaster recovery policy that occurred at the first cluster is to be communicated over a wide area network. Synchronization of the disaster recovery policy is accomplished by carrying out a peer-to-peer communication protocol over the wide area network. The peer-to-peer communication protocol comprises issuing a first synchronization request message from a source peer, receiving the first synchronization request message at a remote peer, and issuing a synchronization response message by the remote peer, which in turn is transmitted over the wide area network to the source peer.

    System and method for object lambda functions
    28.
    发明授权
    System and method for object lambda functions 有权

    公开(公告)号：US11816125B1

    公开(公告)日：2023-11-14

    申请号：US17893619

    申请日：2022-08-23

    申请人： Nutanix, Inc.

    发明人： Johnu George ,  Manik Taneja ,  Manosiz Bhattacharyya ,  Naveen Reddy Gundlagutta

    IPC分类号： G06F16/25

    CPC分类号： G06F16/258

    摘要： An illustrative embodiment disclosed herein is a computer-implemented method. In some embodiments, the method includes uploading, by a processor, an object to a source bucket in an object store and creating, by the processor, a lambda bucket in the object store that is symlinked to the source bucket. In some embodiments, the lambda bucket is associated with a transformation function. In some embodiments, the method includes associating, by the processor, a lambda function with the object in the source bucket, receiving, by the processor, a request to download the object from the lambda bucket, detecting, by the processor, that the object is in the source bucket and associated with the lambda function, fetching, by the processor, the object from the source bucket, generating, by the processor, a transformed object by invoking the lambda function and the transformation function on the object, and downloading, by the processor, the transformed object.

    ELASTIC REQUEST HANDLING TECHNIQUE FOR OPTIMIZING WORKLOAD PERFORMANCE
    29.
    发明公开
    ELASTIC REQUEST HANDLING TECHNIQUE FOR OPTIMIZING WORKLOAD PERFORMANCE 审中-公开

    公开(公告)号：US20230359359A1

    公开(公告)日：2023-11-09

    申请号：US17853123

    申请日：2022-06-29

    申请人： Nutanix, Inc.

    发明人： Daniel Chilton ,  Gaurav Gangalwar ,  Manoj Premanand Naik ,  Pradeep Thomas ,  Will Strickland

    IPC分类号： G06F3/06

    CPC分类号： G06F3/0611 ,  G06F3/0655 ,  G06F3/0679

    摘要： An elastic request handling technique limits a number of threads used to service input/output (I/O) requests of a low-latency I/O workload received by a file system server executing on a cluster having a plurality of nodes deployed in a virtualization environment. The limited number of threads (server threads) is constantly maintained as “active” and running on virtual central processing units (vCPUs) of a node. The file system server spawns and organizes the active server threads as one or more pools of threads. The server prioritizes the low-latency I/O requests by loading them onto the active threads and allowing the requests to run on those active threads to completion, thereby obviating overhead associated with lock contention and vCPU migration after a context switch (i.e., to avoid rescheduling a thread on a different vCPU after execution of the thread was suspended).