View source for 18062182. PROVISIONAL RESOURCE SCHEDULING IN A CLOUD COMPUTING ENVIRONMENT simplified abstract (INTERNATIONAL BUSINESS MACHINES CORPORATION)

=PROVISIONAL RESOURCE SCHEDULING IN A CLOUD COMPUTING ENVIRONMENT=


==Organization Name==

[[:Category:INTERNATIONAL BUSINESS MACHINES CORPORATION|INTERNATIONAL BUSINESS MACHINES CORPORATION]]


[[Category:INTERNATIONAL BUSINESS MACHINES CORPORATION]]

==Inventor(s)==

[[:Category:Asser Nasreldin Tantawi of Somers NY (US)|Asser Nasreldin Tantawi of Somers NY (US)]][[Category:Asser Nasreldin Tantawi of Somers NY (US)]]

[[:Category:Ming-Hung Chen of Mount Kisco NY (US)|Ming-Hung Chen of Mount Kisco NY (US)]][[Category:Ming-Hung Chen of Mount Kisco NY (US)]]

[[:Category:Pavlos Maniotis of White Plains NY (US)|Pavlos Maniotis of White Plains NY (US)]][[Category:Pavlos Maniotis of White Plains NY (US)]]

[[:Category:Claudia Misale of White Plains NY (US)|Claudia Misale of White Plains NY (US)]][[Category:Claudia Misale of White Plains NY (US)]]

[[:Category:Laurent Schares of Pleasantville NY (US)|Laurent Schares of Pleasantville NY (US)]][[Category:Laurent Schares of Pleasantville NY (US)]]

[[:Category:Seetharami R. Seelam of Chappaqua NY (US)|Seetharami R. Seelam of Chappaqua NY (US)]][[Category:Seetharami R. Seelam of Chappaqua NY (US)]]

[[:Category:Hao Yu of Chappaqua NY (US)|Hao Yu of Chappaqua NY (US)]][[Category:Hao Yu of Chappaqua NY (US)]]

==PROVISIONAL RESOURCE SCHEDULING IN A CLOUD COMPUTING ENVIRONMENT - A simplified explanation of the abstract==


This abstract first appeared for US patent application 18062182 titled 'PROVISIONAL RESOURCE SCHEDULING IN A CLOUD COMPUTING ENVIRONMENT

==Simplified Explanation==

The patent application describes an approach for scheduling resources in a cloud computing environment. Here are the key points:

* The approach involves receiving a request to host an application, which includes virtual units with topological constraints.
* Resources are scheduled for each virtual unit, taking into account the topological constraints and assigning a weight to each resource.
* If a second request is received, the resources are re-allocated to virtual units of the second request based on their topological constraints and weights, with the goal of minimizing the total weight.
* Each resource is then assigned a new weight.

Potential applications of this technology:

* Cloud computing providers can use this approach to efficiently allocate resources to different applications and virtual units.
* It can be applied in various industries where cloud computing is used, such as e-commerce, healthcare, and finance.

Problems solved by this technology:

* Provisional scheduling of resources in a cloud computing environment can be complex and time-consuming. This approach simplifies the process by considering topological constraints and weights.
* It minimizes the total weight of resources, leading to more efficient resource allocation and utilization.

Benefits of this technology:

* Improved resource allocation: By considering topological constraints and weights, the approach ensures that resources are allocated in a way that optimizes their utilization.
* Time and cost savings: The provisional scheduling and re-allocation process is automated, reducing the time and effort required for resource management.
* Enhanced performance: By minimizing the total weight of resources, the approach helps to improve the overall performance and efficiency of applications hosted in the cloud computing environment.


==Original Abstract Submitted==

Approaches presented herein enable provisional scheduling of resources in a cloud computing environment. More specifically, a first group request to host an application is obtained. This first group request includes one or more virtual units, which each have one or more topological constraints. One or more resources are scheduled for each of the virtual units. This scheduling includes provisionally allocating the resources to each of the virtual units according to the topological constraints. Each resource comprises a respective weight. In response to obtaining a second group request, the resources are provisionally re-allocated to one or more virtual units of the second group request according to one or more topological constraints of the second group request and the respective weight of each of the resources. This re-allocating minimizes a summation of each respective weight of the resources. A new respective weight is then assigned to each of the resources.



[[Category:G06F9/50]]