中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

11 records (took 0.013 seconds)

    Distributed hierarchical scheduler
    1.
    发明授权
    Distributed hierarchical scheduler 有权

    公开(公告)号：US10552228B2

    公开(公告)日：2020-02-04

    申请号：US15187772

    申请日：2016-06-20

    Applicant: VMware, Inc.

    Inventor： Vadim Spivak ,  Amar Padmanabhan ,  Anfernee Yongkun Gui ,  Badhri Sampathkumar ,  Luca Castellano ,  Maithem Munshed ,  Michi Mutsuzaki ,  Vui Chiap Lam

    IPC: G06F9/50 ,  G06F9/48

    Abstract: Techniques disclosed herein provide an approach for assigning resource consumers to available resources. In one embodiment, components of a distributed scheduler are organized into a hierarchy, such as a tree. A placement request received at a root scheduler of the hierarchy is propagated down the hierarchy, either to all children or to randomly selected subsets of children of each scheduler in the hierarchy. Leaf schedulers in the hierarchy that receive the request each propagate back up a score indicating the amount of free resources in its corresponding resource bucket. Branch schedulers then compare scores that they receive, and each further propagate one of the received scores, such as the highest score, based on the comparison, until the root scheduler is reached. The root scheduler makes an additional comparison and returns one of the resource buckets in response to the received placement request.

    Constrained placement in hierarchical randomized schedulers
    3.
    发明授权
    Constrained placement in hierarchical randomized schedulers 有权

    公开(公告)号：US11010206B2

    公开(公告)日：2021-05-18

    申请号：US16272562

    申请日：2019-02-11

    Applicant: VMware, Inc.

    Inventor： Luca Castellano

    IPC: G06F9/455 ,  G06F9/50 ,  H04L29/08 ,  H04L29/06

    Abstract: A distributed scheduler for a virtualized computer system has a hierarchical structure and includes a root scheduler as the root node, one or more branch schedulers as intermediate nodes, and a plurality of hosts as leaf nodes. A request to place a virtual computing instance is propagated down the hierarchical structure to the hosts that satisfy placement constraints of the request. Each host that receives the request responds with a score indicating resource availability on that host, and the scores are propagated back up the hierarchical structure. Branch schedulers that receive such scores compare the received scores and further propagate a “winning” score, such as the highest or lowest score, up the hierarchical structure, until the root scheduler is reached. The root scheduler makes a similar comparison of received scores to select the best candidate among the hosts to place the virtual computing instance.

    Distributed, Transactional Key-Value Store
    4.
    发明申请
    Distributed, Transactional Key-Value Store 有权
    分布式事务键值存储

    公开(公告)号：US20140156618A1

    公开(公告)日：2014-06-05

    申请号：US13692777

    申请日：2012-12-03

    Applicant: VMWARE, INC.

    Inventor： Luca Castellano

    IPC: G06F17/30

    CPC classification number: G06F17/30368 ,  G06F17/30088 ,  G06F17/30091 ,  G06F17/30106 ,  G06F17/30162 ,  G06F17/30221 ,  G06F17/30227 ,  G06F17/30336 ,  G06F17/30348 ,  G06F17/30371 ,  G06F17/30587 ,  G06F2201/84 ,  Y10S707/99933

    Abstract: In one embodiment, a system for implementing a distributed, transactional key-value store is provided. The system includes a set of nodes, where each node is communicatively coupled with one or more storage devices storing a set of data log files, and where each data log file including key-value pairs for a key namespace. Each node is configured to execute, using a transaction log file specific to the node, transactions for modifying or retrieving key-value pairs in the set of data log files, where the transaction log file includes state information for the transactions. The transactions are executed in a manner that ensures the atomicity and durability of each transaction.

    Abstract translation: 在一个实施例中，提供了一种用于实现分布式事务键值存储的系统。 该系统包括一组节点，其中每个节点与存储一组数据日志文件的一个或多个存储设备通信耦合，并且其中每个数据日志文件包括用于密钥命名空间的键值对。 每个节点被配置为使用特定于节点的事务日志文件来执行用于修改或检索数据日志文件集合中的键值对的事务，其中事务日志文件包括事务的状态信息。 以确保每个交易的原子性和耐久性的方式执行交易。

    Distributed, Transactional Key-Value Store
    5.
    发明申请
    Distributed, Transactional Key-Value Store 审中-公开
    分布式事务键值存储

    公开(公告)号：US20150227573A1

    公开(公告)日：2015-08-13

    申请号：US14692531

    申请日：2015-04-21

    Applicant: VMware, Inc.

    Inventor： Luca Castellano

    IPC: G06F17/30

    CPC classification number: G06F17/30368 ,  G06F17/30088 ,  G06F17/30091 ,  G06F17/30106 ,  G06F17/30162 ,  G06F17/30221 ,  G06F17/30227 ,  G06F17/30336 ,  G06F17/30348 ,  G06F17/30371 ,  G06F17/30587 ,  G06F2201/84 ,  Y10S707/99933

    Abstract: In one embodiment, a system for implementing a distributed, transactional key-value store is provided. The system includes a set of nodes, where each node is communicatively coupled with one or more storage devices storing a set of data log files, and where each data log file including key-value pairs for a key namespace. Each node is configured to execute, using a transaction log file specific to the node, transactions for modifying or retrieving key-value pairs in the set of data log files, where the transaction log file includes state information for the transactions. The transactions are executed in a manner that ensures the atomicity and durability of each transaction.

    Abstract translation: 在一个实施例中，提供了一种用于实现分布式事务键值存储的系统。 该系统包括一组节点，其中每个节点与存储一组数据日志文件的一个或多个存储设备通信耦合，并且其中每个数据日志文件包括用于密钥命名空间的键值对。 每个节点被配置为使用特定于节点的事务日志文件来执行用于修改或检索数据日志文件集合中的键值对的事务，其中事务日志文件包括事务的状态信息。 以确保每个交易的原子性和耐久性的方式执行交易。

    CONSTRAINED PLACEMENT IN HIERARCHICAL RANDOMIZED SCHEDULERS
    6.
    发明申请
    CONSTRAINED PLACEMENT IN HIERARCHICAL RANDOMIZED SCHEDULERS 审中-公开

    公开(公告)号：US20190188051A1

    公开(公告)日：2019-06-20

    申请号：US16272562

    申请日：2019-02-11

    Applicant: VMware, Inc.

    Inventor： Luca Castellano

    IPC: G06F9/50 ,  H04L29/08 ,  H04L29/06 ,  G06F9/455

    CPC classification number: G06F9/5077 ,  G06F9/45558 ,  G06F9/5005 ,  G06F2009/45562 ,  G06F2009/4557 ,  H04L67/10 ,  H04L67/1008 ,  H04L67/1029 ,  H04L67/38

    Abstract: A distributed scheduler for a virtualized computer system has a hierarchical structure and includes a root scheduler as the root node, one or more branch schedulers as intermediate nodes, and a plurality of hosts as leaf nodes. A request to place a virtual computing instance is propagated down the hierarchical structure to the hosts that satisfy placement constraints of the request. Each host that receives the request responds with a score indicating resource availability on that host, and the scores are propagated back up the hierarchical structure. Branch schedulers that receive such scores compare the received scores and further propagate a “winning” score, such as the highest or lowest score, up the hierarchical structure, until the root scheduler is reached. The root scheduler makes a similar comparison of received scores to select the best candidate among the hosts to place the virtual computing instance.

    Constrained placement in hierarchical randomized schedulers
    7.
    发明授权
    Constrained placement in hierarchical randomized schedulers 有权

    公开(公告)号：US10235212B2

    公开(公告)日：2019-03-19

    申请号：US15798026

    申请日：2017-10-30

    Applicant: VMware, Inc.

    Inventor： Luca Castellano

    IPC: G06F9/46 ,  G06F9/50 ,  H04L29/08 ,  G06F9/455 ,  H04L29/06

    Abstract: A distributed scheduler for a virtualized computer system has a hierarchical structure and includes a root scheduler as the root node, one or more branch schedulers as intermediate nodes, and a plurality of hosts as leaf nodes. A request to place a virtual computing instance is propagated down the hierarchical structure to the hosts that satisfy placement constraints of the request. Each host that receives the request responds with a score indicating resource availability on that host, and the scores are propagated back up the hierarchical structure. Branch schedulers that receive such scores compare the received scores and further propagate a “winning” score, such as the highest or lowest score, up the hierarchical structure, until the root scheduler is reached. The root scheduler makes a similar comparison of received scores to select the best candidate among the hosts to place the virtual computing instance.

    Constrained placement in hierarchical randomized schedulers
    9.
    发明授权
    Constrained placement in hierarchical randomized schedulers 有权

    公开(公告)号：US09804895B2

    公开(公告)日：2017-10-31

    申请号：US14986161

    申请日：2015-12-31

    Applicant: VMware, Inc.

    Inventor： Luca Castellano

    IPC: G06F9/455 ,  G06F9/50 ,  H04L29/08 ,  H04L29/06

    CPC classification number: G06F9/5077 ,  G06F9/45558 ,  G06F9/5005 ,  G06F2009/45562 ,  G06F2009/4557 ,  H04L67/10 ,  H04L67/1008 ,  H04L67/1029 ,  H04L67/38

    Abstract: A distributed scheduler for a virtualized computer system has a hierarchical structure and includes a root scheduler as the root node, one or more branch schedulers as intermediate nodes, and a plurality of hosts as leaf nodes. A request to place a virtual computing instance is propagated down the hierarchical structure to the hosts that satisfy placement constraints of the request. Each host that receives the request responds with a score indicating resource availability on that host, and the scores are propagated back up the hierarchical structure. Branch schedulers that receive such scores compare the received scores and further propagate a “winning” score, such as the highest or lowest score, up the hierarchical structure, until the root scheduler is reached. The root scheduler makes a similar comparison of received scores to select the best candidate among the hosts to place the virtual computing instance.

Patent Agency Ranking