A system and associated processes to allocate tenants to servers are disclosed. A set of vectors corresponding to a plurality of tenants to be allocated is generated. A target vector establishing a target value of a sum of vectors allocated to a first server is determined. A first vector included in the set of vectors that satisfies a defined relationship with the target vector is identified, and in response, a tenant corresponding to the first vector is allocated to the first server. It is determined whether a second vector satisfies a defined relationship with both the target vector and the first vector exists. If so, a tenant corresponding to the second vector is allocated to the first server. If not, the tenant corresponding to the second vector is allocated to a second server that is different from the first server.

Embodiments for identifying an optimal cloud computing environment for a computing task is disclosed. Embodiments comprises receiving a computing task to be executed in a cloud computing environment, wherein the computing task requires a set of cloud computing environment parameter values of the cloud computing environment, pre-selecting a set of candidate cloud computing environments, each of which meets the set of cloud computing environment parameter values, ranking the candidate cloud computing environments using reward-based ranking parameter values of the candidate cloud computing environments as an additional selection constraint, and selecting the highest ranking cloud computing environment as the optimal cloud computing environment for the computing task. Furthermore, embodiments comprise executing the computing task in the optimal cloud computing environment, monitoring execution when executing the computing task, and updating parameter values of the reward-based ranking for the selected optimal cloud computing environment.

A data protection scheduling system provides a flexible or rolling data protection window that analyzes various criteria to determine an optimal or near optimal time for performing data protection or secondary copy operations. While prior systems may have scheduled backups at an exact time (e.g., 2:00 a.m.), the system described herein dynamically determines when to perform the backups and other data protection storage operations, such as based on network load, CPU load, expected duration of the storage operation, rate of change of user activities, frequency of use of affected computer systems, trends, and so on.

Executing and managing flow plans by performing at least the following: receiving an indication to initiate a task flow including a plurality of discrete but related operations at a customer instance environment of a cloud-based computing platform; obtaining a definition of the task flow identifying run-time requirements for each of the plurality of operations; determining a first execution environment for the first of the plurality of operations; initiating execution of the first operation in the first execution environment; and determining the proper execution environment for subsequent operations of the task flow until all operations of the task flow are complete. Factors, such as look-ahead optimization, environmental operational capabilities, access and security requirements, current load, future load, etc. may be considered when determining the proper execution environment for a given operation. Operations may be executed in environments hosted in the public cloud or in environments present in a dedicated private network.

A resource processing method and apparatus are proposed in the embodiment of the present disclosure. The method includes: obtaining a resource allocation scenario; querying a corresponding strategy combination configuration according to the resource allocation scenario; executing each allocation strategy to determine a target resource pool allocated with the allocation strategy; obtaining resources corresponding to each allocation strategy from the target resource pool allocated with the allocation strategy; executing the combination operation on the resources corresponding to the allocation strategy to obtain target resources.

A computer implemented method of providing connectivity between two or more primary assets, each primary asset comprising a hardware component or a software component, the method comprising receiving a request to provide connectivity between the primary assets; accessing a repository that stores a list of assets and metadata associated with each asset; using the metadata in the repository to generate an hierarchical list of assets; rationalising the hierarchical list of assets by selecting a group of assets from the hierarchical list of assets to be used in providing connectivity between the primary assets; and generating, based on operating parameters of each asset in the group of assets, a deployment plan for the group of assets, wherein the deployment plan defines settings and/or connections to be used between the assets in the group of assets in order to provide connectivity between the two or more primary assets.

Methods, computer readable media, and systems service a queue, comprising a plurality of jobs, by identifying nodes satisfying a hardware requirement for at least a subset of jobs in the queue. Each job indicates when it was submitted to the queue and one or more node resource requirements. A current availability score for each node class in a plurality of node classes is determined and nodes of a first node class in the plurality of node classes are reserved when a demand score for the class satisfies the current availability score for the first node class by a first threshold amount. Reserved nodes are permitted to draw jobs from the queue in accordance with satisfaction by such nodes of the node resource requirements of the jobs but are terminated, without completing the jobs, when the current availability score for their node class exceeds a second threshold amount.

A method of efficiently executing a plurality of processes is described. The method generates, using a predictor, operating constraints for the processes. An operating constraint of the operating constraints is for each process of the processes. The method evaluates possible operating points for each process consistent with the operating constraints and according to a cost function for the processes. The method also determines an operating point for each process based on the evaluating.

A system and associated processes to allocate tenants to platform resources are disclosed. A set of vectors corresponding to a plurality of tenants to be allocated is generated. A target vector establishing a desired value of a sum of vectors allocated to a first platform resource is determined. A first vector included in the set of vectors that satisfies a defined relationship with the target vector is identified, and a tenant corresponding to the first vector is allocated to the platform resource as a result. It is determined whether a second vector satisfies a defined relationship with both the target vector and the first vector exists. If so, a tenant corresponding to the second vector is allocated to the first platform resource. If not, the tenant corresponding to the second vector is allocated to a second platform resource, that is different from the first platform resource.

A processor for performing a predetermined computational operation in which one or multiple data element(s) is/are used to determine a result. The processor includes one or more processor core(s) and at least one buffer memory, connectable to a main memory, and if the main memory is connected, it is designed to access the main memory. Each processor core is designed to execute instructions. The at least one buffer memory includes a calculation circuit which is designed to perform the computational operation in response to an execution signal if the one or the multiple data element(s) is/are stored in the buffer memory, the result being stored in the buffer memory. The processor is designed to perform the computational operation optionally using one of the processor cores with the aid of the instructions or to perform it in the at least one buffer memory using the respective calculation circuit.