Abstract: Disclosed are various embodiments for distributed resource scheduling. An eviction request from a first host is received. The eviction request comprises data regarding a virtual machine to be migrated from the first host. The eviction request is then broadcast to a plurality of hosts. A plurality of responses are received from the plurality of hosts, each response comprising a score representing an ability of a respective one of the plurality of hosts to act as a new host for the virtual machine. A second host is selected from the plurality of hosts to act as the new host for the virtual machine based at least in part on the score in each of the plurality of responses. Then, a response is sent to the first host, the response containing an identifier of the second host.

Abstract: Disclosed are various embodiments for distributed resource scheduling. An eviction request from a first host is received. The eviction request comprises data regarding a virtual machine to be migrated from the first host. The eviction request is then broadcast to a plurality of hosts. A plurality of responses are received from the plurality of hosts, each response comprising a score representing an ability of a respective one of the plurality of hosts to act as a new host for the virtual machine. A second host is selected from the plurality of hosts to act as the new host for the virtual machine based at least in part on the score in each of the plurality of responses. Then, a response is sent to the first host, the response containing an identifier of the second host.

Abstract: In an example, a computer implemented method may include receiving a request including a set of workload descriptors. Further, the method may include parsing the set of workload descriptors to determine a set of pods and a set of constraints associated with the set of pods and determining a relationship between the set of pods based on the set of constraints. Furthermore, the method may include categorizing the set of pods into a set of resource clusters based on the determined relationship and determining a cloud infrastructure to deploy the set of resource clusters based on an optimization parameter. Upon determining the cloud infrastructure, the determined cloud infrastructure may be recommended to deploy the set of resource clusters.

Abstract: Disclosed are various embodiments for distributed resource scheduling. An eviction request from a first host is received. The eviction request comprises data regarding a virtual machine to be migrated from the first host. The eviction request is then broadcast to a plurality of hosts. A plurality of responses are received from the plurality of hosts, each response comprising a score representing an ability of a respective one of the plurality of hosts to act as a new host for the virtual machine. A second host is selected from the plurality of hosts to act as the new host for the virtual machine based at least in part on the score in each of the plurality of responses. Then, a response is sent to the first host, the response containing an identifier of the second host.

Abstract: Disclosed are various embodiments for distributed resource scheduling. An eviction request from a first host is received. The eviction request comprises data regarding a virtual machine to be migrated from the first host. The eviction request is then broadcast to a plurality of hosts. A plurality of responses are received from the plurality of hosts, each response comprising a score representing an ability of a respective one of the plurality of hosts to act as a new host for the virtual machine. A second host is selected from the plurality of hosts to act as the new host for the virtual machine based at least in part on the score in each of the plurality of responses. Then, a response is sent to the first host, the response containing an identifier of the second host.

Abstract: Disclosed are various embodiments for distributed resource scheduling. An eviction request from a first host is received. The eviction request comprises data regarding a virtual machine to be migrated from the first host. The eviction request is then broadcast to a plurality of hosts. A plurality of responses are received from the plurality of hosts, each response comprising a score representing an ability of a respective one of the plurality of hosts to act as a new host for the virtual machine. A second host is selected from the plurality of hosts to act as the new host for the virtual machine based at least in part on the score in each of the plurality of responses. Then, a response is sent to the first host, the response containing an identifier of the second host.

Abstract: Methods and systems allocate storage costs to virtual machines (“VMs”) in a virtual data center. Methods calculate a datastore-base rate based on datastore utilized-storage capacity in each LD and each LD-base rate when the datastore utilized-storage capacity and each LD-base rate are available. Datastore total cost is calculated by multiplying the datastore-base rate by the datastore utilized-storage capacity. Methods also use graph based methods to calculate datastore-base rates when the datastore utilized-storage capacity is unknown for each LD. The datastore-base rate associated with each datastore may then be used to calculate a VM storage cost of each VM hosted by a datastore.

Abstract: Techniques for migrating a VM in a hybrid cloud computing system are provided. The techniques include identifying a similar VM at the destination, comparing dictionaries for the VM to be transmitted and the similar VM, and compressing the VM based on the comparison. After transmitting the compressed VM, the destination decompresses the VM using the dictionary of the similar VM. Dictionaries associate chunks of VM data with hashes of those chunks. This allows replacement of chunks with the hashes, thereby compressing the VM for transmission.

Abstract: Techniques for migrating a VM in a hybrid cloud computing system are provided. The techniques include identifying a similar VM at the destination, comparing dictionaries for the VM to be transmitted and the similar VM, and compressing the VM based on the comparison. After transmitting the compressed VM, the destination decompresses the VM using the dictionary of the similar VM. Dictionaries associate chunks of VM data with hashes of those chunks. This allows replacement of chunks with the hashes, thereby compressing the VM for transmission.

Abstract: Methods and systems allocate storage costs to virtual machines (“VMs”) in a virtual data center. Methods calculate a datastore-base rate based on datastore utilized-storage capacity in each LD and each LD-base rate when the datastore utilized-storage capacity and each LD-base rate are available. Datastore total cost is calculated by multiplying the datastore-base rate by the datastore utilized-storage capacity. Methods also use graph based methods to calculate datastore-base rates when the datastore utilized-storage capacity is unknown for each LD. The datastore-base rate associated with each datastore may then be used to calculate a VM storage cost of each VM hosted by a datastore.