公开(公告)号：US10241840B2

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

申请号：US15283274

申请日：2016-09-30

Applicant: VMware, Inc.

Inventor： Po-An Tsai ,  Sahan Gamage ,  Rean Griffith

IPC: G06F9/46 ,  G06F9/50

Abstract: Examples provide two-tiered scheduling within a cluster. A coarse-grained analysis is performed on a candidate set of hosts to select a host for a virtual computing instance based on optimization of at least one resource. A host is selected based on the analysis results. The identified virtual computing instance is placed on the selected host. A fine-grained analysis is performed on a set of communication graphs for a plurality of virtual computing instances to generate a set of penalty scores. A set of communicating virtual computing instances are selected based on the set of penalty scores. A first virtual computing instance from a first host is relocated to a second host to minimize a distance between the first virtual computing instance and a second virtual computing instance. Relocating the first virtual computing instance reduces at least one penalty score for the set of communicating virtual computing instances.

公开(公告)号：US20180095776A1

公开(公告)日：2018-04-05

申请号：US15283274

申请日：2016-09-30

Applicant: VMware, Inc.

Inventor： Po-An Tsai ,  Sahan Gamage ,  Rean Griffith

IPC: G06F9/455 ,  G06F9/50

CPC classification number: G06F9/5077 ,  G06F9/505 ,  G06F9/5083

Abstract: Examples provide two-tiered scheduling within a cluster. A coarse-grained analysis is performed on a candidate set of hosts to select a host for a virtual computing instance based on optimization of at least one resource. A host is selected based on the analysis results. The identified virtual computing instance is placed on the selected host. A fine-grained analysis is performed on a set of communication graphs for a plurality of virtual computing instances to generate a set of penalty scores. A set of communicating virtual computing instances are selected based on the set of penalty scores. A first virtual computing instance from a first host is relocated to a second host to minimize a distance between the first virtual computing instance and a second virtual computing instance. Relocating the first virtual computing instance reduces at least one penalty score for the set of communicating virtual computing instances.

公开(公告)号：US10956227B2

公开(公告)日：2021-03-23

申请号：US16272550

申请日：2019-02-11

Applicant: VMware, Inc.

Inventor： Po-An Tsai ,  Sahan Gamage ,  Rean Griffith

IPC: G06F9/46 ,  G06F9/50

Abstract: Examples provide two-tiered scheduling within a cluster. A coarse-grained analysis is performed on a candidate set of hosts to select a host for a virtual computing instance based on optimization of at least one resource. A host is selected based on the analysis results. The identified virtual computing instance is placed on the selected host. A fine-grained analysis is performed on a set of communication graphs for a plurality of virtual computing instances to generate a set of penalty scores. A set of communicating virtual computing instances are selected based on the set of penalty scores. A first virtual computing instance from a first host is relocated to a second host to minimize a distance between the first virtual computing instance and a second virtual computing instance. Relocating the first virtual computing instance reduces at least one penalty score for the set of communicating virtual computing instances.

公开(公告)号：US20190188050A1

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

申请号：US16272550

申请日：2019-02-11

Applicant: VMware, Inc.

Inventor： Po-An Tsai ,  Sahan Gamage ,  Rean Griffith

IPC: G06F9/50

CPC classification number: G06F9/5077 ,  G06F9/505 ,  G06F9/5083

Abstract: Examples provide two-tiered scheduling within a cluster. A coarse-grained analysis is performed on a candidate set of hosts to select a host for a virtual computing instance based on optimization of at least one resource. A host is selected based on the analysis results. The identified virtual computing instance is placed on the selected host. A fine-grained analysis is performed on a set of communication graphs for a plurality of virtual computing instances to generate a set of penalty scores. A set of communicating virtual computing instances are selected based on the set of penalty scores. A first virtual computing instance from a first host is relocated to a second host to minimize a distance between the first virtual computing instance and a second virtual computing instance. Relocating the first virtual computing instance reduces at least one penalty score for the set of communicating virtual computing instances.