G06F2209/5021

Method and apparatus for comparing acquired cloud resource use information to thresholds to recommend a target cloud resource instance

Embodiments of the present disclosure disclose a method and apparatus for acquiring information. The method may include: acquiring cloud resource use information; comparing the cloud resource use information with a use rate threshold value, to obtain a comparison result; obtaining use state information of a cloud resource corresponding to the cloud resource use information according to the comparison result; and generating cloud resource state information based on the use state information.

Determining optimal placements of workloads on multiple platforms as a service in response to a triggering event

A computer-implemented method, a computer program product, and a computer system for placements of workloads in a system of multiple platforms as a service. A computer detects a triggering event for modifying a matrix that pairs respective workloads on respective platforms and includes attributes of running respective workloads on respective platforms. The computer recalculates the attributes in the matrix, in response to the triggering event being detected. The computer determines optimal placements of the respective workloads on the respective platforms, based on information in the matrix. The computer places the respective workloads on the respective platforms, based on the optimal placements.

Task Processing Method and Device, and Electronic Device

A task processing method, a task processing device and an electronic device are provided, which relate to the field of cloud computing technology and big data technology, in particular to the field of task processing technology. The task processing method includes: obtaining a task processing request for a to-be-processed task, the task processing request including processing time information of the to-be-processed task and a service type of the to-be-processed task; in the case that the processing time information of the to-be-processed task meets a triggering condition, writing the to-be-processed task into a corresponding message queue in accordance with the service type of the to-be-processed task, one message queue corresponding to a respective one service type; and processing the to-be-processed task in the message queue, to obtain a task processing result of the to-be-processed task.

Information processing apparatus, job scheduling method, and non-transitory computer-readable storage medium
11550626 · 2023-01-10 · ·

An information processing apparatus includes a memory and a processor couple to the memory and configured to generate one or more job groups by grouping multiple jobs of execution targets in descending order of priority, and perform a control for scheduling execution timings regarding the multiple jobs such that scheduling of respective jobs included in a specific job group including a job having a higher priority is implemented by priority over scheduling of respective jobs included in other job groups. The processor performs the control for scheduling the execution timings of the respective jobs included in the specific job group such that an execution completion time of all the jobs included in the specific job group satisfies a predetermined condition.

USING MULTIPLE QUOTA TREES IN RESOURCE SCHEDULING

Systems, computer-implemented methods, and computer program products to facilitate using multiple quota trees in resource scheduling are provided. According to an embodiment, a system can comprise a processor that executes computer executable components stored in memory. The computer executable components comprise an evaluation component that executes admissibility of a job request based on a scope property of one or more quota trees that apply to the job request.

OPTIMIZING RESOURCE UTILIZATION BASED ON QUOTA TREES IN RESOURCE SCHEDULING

Systems, computer-implemented methods, and computer program products to facilitate optimization of resource usage based on quota trees are provided. According to an embodiment, a system can comprise a processor that executes computer executable components stored in memory. The computer executable components comprise a determination component that determines one or more quota trees that classify a job request as inadmissible. The computer executable components further comprise an optimization component that optimizes resource usage to enable admissibility of the job request based on the one or more quota trees.

Optimizing placements of workloads on multiple platforms as a service based on costs and service levels

A computer-implemented method, a computer program product, and a computer system for optimizing workload placements in a system of multiple platforms as a service. A computer first places respective workloads on respective platforms that yield lowest costs for the respective workloads. The computer determines whether mandatory constraints are satisfied. The computer checks best effort constraints, in response to the mandatory constraints being satisfied. The computer determines a set of workloads for which the best effort constraints are not satisfied and determines a set of candidate platforms that yield the lowest costs and enable the best effort constraints to be satisfied. From the set of workloads, the computer selects a workload that has a lowest upgraded cost and updates the workload by setting an upgraded platform index.

ELECTRONIC CONTROL DEVICE

To appropriately execute a task by an electronic control device including a processor having a plurality of cores. An ECU 100 includes a multi-core CPU having a plurality of cores that execute a first task that has an execution time that varies depending on a processing amount every predetermined cycle and a second task that is higher in priority than the first task and is prohibited from being interrupted. The second task is set to be inexecutable simultaneously between the plurality of cores. A task allocation unit 11 generates a first plan. A diagnosis task planning unit 12 generates a second plan. Task processing units 10a and 10b execute the first task based on the first plan. A diagnosis task correction unit 13 times a delay time of the first task executed by the task processing units 10a and 10b, and postpones the second task of the second plan to the subsequent executable timing in accordance with the timed delay time. A diagnosis unit 14 executes the second task for each core based on the second plan corrected by the diagnosis task correction unit 13.

Automated learning technology to partition computer applications for heterogeneous systems

Systems, apparatuses and methods may provide for technology that identifies a prioritization data structure associated with a function, wherein the prioritization data structure lists hardware resource types in priority order. The technology may also allocate a first type of hardware resource to the function if the first type of hardware resource is available, wherein the first type of hardware resource has a highest priority in the prioritization data structure. Additionally, the technology may allocate, in the priority order, a second type of hardware resource to the function if the first type of hardware resource is not available.

Operating system assisted prioritized thread execution

The present disclosure is directed to dynamically prioritizing, selecting or ordering a plurality threads for execution by processor circuitry based on a quality of service and/or class of service value/indicia assigned to the thread by an operating system executed by the processor circuitry. As threads are executed by processor circuitry, the operating system dynamically updates/associates respective class of service data with each of the plurality of threads. The current quality of service/class of service data assigned to the thread by the operating system is stored in a manufacturer specific register (MSR) associated with the respective thread. Selection circuitry polls the MSRs on a periodic, aperiodic, intermittent, continuous, or event-driven basis and determines an execution sequence based on the current class of service value associated with each of the plurality of threads.