-
公开(公告)号：US20170060642A1
公开(公告)日：2017-03-02
申请号：US14986161
申请日：2015-12-31
Applicant: VMware, Inc.
Inventor： Luca CASTELLANO
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.
Abstract translation: 用于虚拟化计算机系统的分布式调度器具有分层结构，并且包括作为根节点的根调度器，作为中间节点的一个或多个分支调度器和作为叶节点的多个主机。 放置虚拟计算实例的请求从层次结构向下传播到满足请求的布局约束的主机。 接收请求的每个主机都会以表示该主机资源可用性的分数进行响应，并将分数传播回层次结构。 接收这种分数的分支调度器比较接收到的分数，并进一步传播分层结构中的“获胜”分数，例如最高或最低分数，直到达到根调度器。 根调度器对接收到的分数进行类似的比较，以选择主机中放置虚拟计算实例的最佳候选。
-
公开(公告)号：US20180060137A1
公开(公告)日：2018-03-01
申请号：US15798026
申请日：2017-10-30
Applicant: VMware, Inc.
Inventor： Luca CASTELLANO
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.
-
公开(公告)号：US20170364392A1
公开(公告)日：2017-12-21
申请号：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
CPC classification number: G06F9/5083 , G06F9/4881
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.
-
-
Search Results
3
records
(took 0.008 seconds)
