Placement of a tenant database in an oversubscribed, database-as-a-service cluster comprised of a plurality of nodes is described. The placement may be based on per-node estimates of a probability of resource demand violation if the tenant database is placed on the node. Past resource usage of similar tenant databases subscribed to the cluster that are collected and stored as compressed traces may be used to obtain the estimates. In some examples, based on the estimates, a per-node expected number of resource violations is determined and compared across nodes, where the determined placement minimizes the number of resource violations. In other examples, when the tenant database is being placed in parallel with other tenant databases, a score assigned to each valid configuration for the placement may be modified based on the estimates, where the determined placement is the configuration having a lowest score.

Example aspects include techniques for implementing resource governance in multi-tenant environment. These techniques may include receiving a service request for a multi-tenant service from a client device, and predicting a resource utilization value (RUV) resulting from execution of the service request based on text of the service request, an amount of data associated with the client device at the multi-tenant service, and/or a temporal execution value. In addition, the techniques may include determining that the RUV is greater than a preconfigured threshold identifying an expensive request, and applying a load balancing strategy to the service request based on the RUV being greater than the preconfigured threshold.

A cluster computing system is provided. The cluster computing system includes: a host including a first processor and a first buffer memory; computing nodes, each of which includes a second processor and a second buffer memory configured to store data received from the host; a network configured to connect the host and the computing nodes; and storage devices respectively corresponding to the computing nodes. The first processor is configured to control a task allocator to monitor a task performance state of each of the computing nodes, select at least one of the computing nodes as a task node based on the task performance state of each of the computing nodes, and distribute a background task to the task node, and the second processor of the task node is configured to perform the background task on sorted files stored in the second buffer memory, the sorted files being received by the second buffer memory from the first buffer memory via the network.

Embodiments of systems and methods for platform framework orchestration and discovery are described. In some embodiments, an Information Handling System (IHS) may include a processor and a memory coupled to the processor, the memory having program instructions stored thereon that, upon execution, cause the IHS to: receive, by a service within a platform framework through an Application Programming Interface (API), a discovery request; in response to the discovery request, convey an inquiry for capability information from the service to a participant registered with the platform framework through the API; receive, by the service from the participant through the API, the capability information; and fulfill, by the service through the API, the discovery request using at least a portion of the capability information.

A computing network includes nodes of different work groups. Nodes of a work group are dedicated to transactions of the work group. If a node of a first work group is predicted to have an idleness window, a second work group may borrow the node to execute a transaction of the second work group. At least a subset of steps of the transaction may be categorized into a step group. Trees of a transaction may be categorized into one or more tree groups. A node is selected for executing a transaction, if the predicted idleness duration of the node is sufficient relative to the predicted runtime of the transaction, the step group, and/or tree group. A credit system is maintained. A first work group transfers a credit to a second work group when borrowing a node of the second work group for executing a transaction of the first work group.

A computing network includes nodes of different work groups. Nodes of a work group are dedicated to transactions of the work group. If a node of a first work group is predicted to have an idleness window, a second work group may borrow the node to execute a transaction of the second work group. At least a subset of steps of the transaction may be categorized into a step group. Trees of a transaction may be categorized into one or more tree groups. A node is selected for executing a transaction, if the predicted idleness duration of the node is sufficient relative to the predicted runtime of the transaction, the step group, and/or tree group. A credit system is maintained. A first work group transfers a credit to a second work group when borrowing a node of the second work group for executing a transaction of the first work group.

A method for software patching, the method may include determining to expose at least one patch of a version of an operating system to one or more computers located outside a unified local path repository (ULPR) hosted by a computer; and exposing, for period of time and by the ULPR, a selected logical computer that stores the at least one patch. The selected logical computer is selected out of multiple logical computers of the ULPR. Different logical computers of the multiple logical computers store operating systems that differ from each other by at least one of identity and version.

A computer system, processor, programming instructions and/or method for balancing the workload of processing pipelines that includes an execution slice, the execution slice comprising at least two processing pipelines having one or more execution units for processing instructions, wherein at least a first processing pipeline and a second processing pipeline are capable of executing a first instruction type; and an instruction decode unit for decoding instructions to determine which of the first processing pipeline or the second processing pipeline to execute the first instruction type. The processor configured to calculate at least one of a workload group consisting of: the first processing pipeline workload, the second processing pipeline workload, and combinations thereof; and select the first processing pipeline or the second processing pipeline to execute the first instruction type based upon at least one of the workload group.

The present disclosure relates to a method, a device, and a program product for managing a computing system. In a method, a current state and a plurality of historical states of a computing device in a computing system are acquired, the plurality of historical states respectively describing historical states of the computing device in the computing system at a plurality of historical time points. In response to determining that the current state matches a scheduling type for scheduling the computing device, the plurality of historical states are searched for a historical state matching the current state. A historical scheduling policy associated with the historical state is determined. Based on the historical scheduling policy, a computing task to be executed by the computing device is allocated to at least one other computing device in the computing system.

Techniques are disclosed for the cell/cluster formation of compute nodes and workload and processing resource scheduling. Compute nodes within an environment may be grouped (clustered) together to perform one or more designated workload tasks. The clustered compute nodes may be associated with (or assigned to) a workload cell formed to perform one or more identified task(s).