CN112764928A - Method, device and medium for dynamic management of compiling resources - Google Patents
Method, device and medium for dynamic management of compiling resources Download PDFInfo
- Publication number
- CN112764928A CN112764928A CN202110083812.7A CN202110083812A CN112764928A CN 112764928 A CN112764928 A CN 112764928A CN 202110083812 A CN202110083812 A CN 202110083812A CN 112764928 A CN112764928 A CN 112764928A
- Authority
- CN
- China
- Prior art keywords
- compiler
- utilization rate
- compiling
- task
- list
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Withdrawn
Links
- 238000000034 method Methods 0.000 title claims abstract description 24
- 238000011084 recovery Methods 0.000 claims description 7
- 230000001174 ascending effect Effects 0.000 claims description 6
- 238000004364 calculation method Methods 0.000 claims description 6
- 238000012163 sequencing technique Methods 0.000 claims description 5
- 238000004590 computer program Methods 0.000 claims description 4
- 238000007726 management method Methods 0.000 description 8
- 238000010276 construction Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
- G06F9/5016—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals the resource being the memory
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformation of program code
- G06F8/41—Compilation
- G06F8/47—Retargetable compilers
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Devices For Executing Special Programs (AREA)
Abstract
The invention discloses a method for dynamically managing compiled resources, which comprises the steps of inquiring a plurality of Kojids in a hosts list, and setting a threshold value of the number of tasks received by the Kojids and a threshold value of the comprehensive resource utilization rate; judging whether the number of Kojid receiving tasks is equal to the threshold value or not; if the number of the Kojid receiving tasks is equal to the threshold value, executing shift-out operation; if the number of the Kojid receiving tasks is not equal to the threshold value, executing judgment operation to find out a first Kojid; the Kojihub distributes the compiling task to the first Kojid, and the first Kojid executes the compiling task; through the mode, the Kojid with the most abundant compiling resources can be selected, and the compiling task is distributed to the Kojid, so that the task compiling is carried out by the optimal Kojid, the compiling time is shortened, and the compiling efficiency is improved.
Description
Technical Field
The present invention relates to the field of compiled resource management, and in particular, to a method, an apparatus, and a medium for dynamically managing compiled resources.
Background
The Koji construction system is composed of Kojihub and a plurality of Kojids, the Kojihub allocates different tasks to each Kojid according to construction task requirements to compile, and the Kojihub presets the number of receiving tasks for each Kojid.
However, in the actual process, the following problems exist in compiling task allocation: a single Kojid compiling task is full, but other compilers have no tasks or few tasks, so that resource allocation of the compilers is uneven, and compiling efficiency is influenced; and the situation that resources (CPU and memory) are preempted in different compiling tasks in the same Kojid can even cause the compiling tasks to be simultaneously blocked.
Disclosure of Invention
The invention mainly solves the problems that the edge and resource distribution are uneven when the existing compiling task is distributed, the compiling efficiency is influenced, and resource preemption can occur in different compiling tasks in the same Kojid.
In order to solve the technical problems, the invention adopts a technical scheme that: a method for dynamic management of compiled resources is provided, comprising the steps of:
inquiring a plurality of compilers in a compiler list, and setting a threshold value of the number of tasks received by the compilers and a threshold value of the comprehensive resource utilization rate;
judging the relation between the number of the tasks received by the compiler and the threshold value;
if the number of the tasks received by the compiler is not less than the threshold value, executing a shift-out operation on the compiler;
if the number of the tasks received by the compiler is smaller than the threshold value, executing judgment operation to find out a first compiler;
and distributing a compiling task to the first compiler, and executing the compiling task by the first compiler.
Preferably, the step of performing the determination operation further includes:
acquiring the CPU utilization rate and the memory utilization rate of the compiler, and calculating the comprehensive resource utilization rate;
judging whether the comprehensive resource utilization rate is greater than the threshold value of the comprehensive resource utilization rate;
if the comprehensive resource utilization rate is greater than the comprehensive resource utilization rate threshold value, executing the shift-out operation;
and if the comprehensive resource utilization rate is not greater than the comprehensive resource utilization rate threshold value, executing calculation reservation operation.
Preferably, the step of performing a computation reservation operation further comprises:
acquiring a plurality of task types compiled in the compiler;
counting the added value of the number of first tasks and the number of second tasks in the task types compiled in the plurality of compilers;
sequencing the added values in an ascending order, finding out the added value with the first rank and recording the added value as the minimum task number;
reserving the compiler with the added value equal to the minimum task number, recording as a second compiler, and executing selection operation on the second compiler;
executing the move-out operation with the compiler that is not the second compiler in the list of compilers.
Preferably, the step of performing the selection operation further comprises:
judging whether the number of the second compilers in the compiler list is equal to a first preset number or not;
if the number of the second compilers is equal to the first preset number, calculating the comprehensive resource utilization rate of the second compilers;
sequencing the comprehensive resource utilization rate of the second compiler in an ascending order, finding out the compiler in the second compiler according to the comprehensive resource utilization rate ranked first, and recording as a third compiler;
executing the move-out operation by the second compiler which is not the third compiler in the compiler list, wherein the third compiler is the first compiler;
and if the number of the second compiling machines is equal to a first preset number, the second compiling machine is the first compiling machine.
Preferably, the executing of the move-out operation includes: removing the compiler from the list of compilers.
Preferably, after the first compiler executes the compilation task, the compiler removed from the compiler list is restored to the compiler list.
Preferably, the compiler is Kojid, the first task is build, and the second task is build srpmfromcm.
An apparatus for dynamic management of compiled resources, comprising: the device comprises an inquiry device, a calculation device, a judgment device, a shifting-out device and a compiling device;
the query device is used for acquiring a plurality of compilers in a compiler list, the number of tasks and the types of the tasks in the compilers, and querying the CPU utilization rate and the memory utilization rate of the compilers;
the computing device computes the sum of the number of first tasks and the number of second tasks in the task types through the task types in the plurality of compilers, counts the minimum value in the sum, and computes the comprehensive resource utilization rate of the plurality of compilers;
the judging device judges according to the added value, the minimum value and the comprehensive resource utilization rate to obtain the compiler which is moved out of the compiler list;
the shifting-out device is used for acquiring the shifted-out compiler and shifting the shifted-out compiler out of the compiler list to obtain a first compiler list, wherein the compiler in the first compiler list is a first compiler;
the compiling device is used for acquiring the first compiler and distributing a compiling task to the first compiler for execution.
Preferably, the device further comprises a recovery device;
the recovery device is used for recovering the removed compiler to the compiler list after the first compiler executes the compiling task
The present invention also provides a computer readable storage medium, in which a computer program is stored, which, when executed by a processor, implements the steps of a method for dynamic management of compiled resources.
The invention has the beneficial effects that:
1. the method for dynamically managing the compiling resources can be used for inquiring and dynamically managing the compiling resources in real time and dynamically allocating the compiling tasks when the user compiling tasks are allocated; for the compiling task newly submitted by the user, the optimal Kojid is found out by calculating the comprehensive resource utilization rate and the number of tasks, so that the efficiency is improved;
2. according to the device for dynamically managing the compiling resources, the Kojid with the richest compiling resources can be selected through the query device, the calculation device, the judgment device and the recovery device under the existing compiling resources, and the compiling task is distributed to the Kojid, so that the task compiling is carried out by the optimal Kojid, the compiling time is shortened, and the compiling efficiency is improved;
3. the computer-readable storage medium can automatically acquire the utilization rate of a CPU and the utilization rate of a memory to calculate the comprehensive resource utilization rate, and automatically find out the optimal Kojid according to the comprehensive resource utilization rate and the execution of the preset judgment condition, thereby reducing the waste of resources, avoiding manual operation and reducing the consumption of human resources.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a flowchart of a method for dynamically managing compiled resources according to embodiment 1 of the present invention;
fig. 2 is a flowchart of a determining operation in a method for dynamic management of compiled resources according to embodiment 1 of the present invention;
fig. 3 is a schematic diagram of an apparatus for dynamically managing compiled resources according to embodiment 2 of the present invention.
Detailed Description
The technical solutions of the present invention will be described clearly and completely with reference to the accompanying drawings, and it should be understood that the described embodiments are some, but not all embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In the description of the present invention, it should be noted that the terms "first", "second", and "third" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.
It should be noted that, in the description of the present invention,
RPM: the RPM package is a file artifact packaged from source code; RPM Package Manager (RPM) is a powerful command-line driven software Package management tool used to install, uninstall, verify, query and update software packages on Linux systems;
koji: an RPM package construction system of Fedora; fedora is a Linux distribution version, and is a rapid, stable and powerful operating system which is constructed by global community enthusiasts and faces to daily application;
kojihub: the RPM package of Fedora constructs the customer end of the system;
kojid: a compiler for performing a compilation task;
hosts is a system file without extension name, can be opened by using a notebook and other tools, and has the function of establishing a correlation 'database' between some commonly used website domain names and IP addresses corresponding to the website domain names, wherein Hosts in the invention is a Kojid list maintained by Kojihub;
SSH is an abbreviation for Secure Shell, made by the IETF Network Group (Network Working Group); SSH is a security protocol built on an application layer basis. SSH is a reliable protocol specially used for providing security for remote login session and other network services, and the information leakage problem in the remote management process can be effectively prevented by utilizing the SSH protocol.
the top command is a performance analysis tool commonly used in Linux, can display the resource occupation status of each process in the system in real time, and is similar to a task manager of Windows.
A Central Processing Unit (CPU).
In the description of the present invention, the first preset number is 1, the threshold value of the comprehensive resource utilization rate is 90%, the list of the compilers is hosts, and the number of the first compilers is at least one, which is the optimal compiler.
Example 1
An embodiment of the present invention provides a method for dynamically managing compiled resources, please refer to fig. 1 and fig. 2, which includes the following steps:
s100, after a user submits a new compiling task, the Kojihud receives a task request and inquires each Kojid information in a hosts list of the current receivable tasks;
in the present embodiment, N kojids are set, the threshold value of the number of tasks received by each Kojid is equal to capacity M, and the physical configuration of each Kojid is the same;
it is judged whether the number of current Kojid reception tasks is equal to M,
if the threshold value of the number of the current Kojid receiving tasks is equal to M, the Kojid can not receive a new task any more, the result is fed back to the Kojihub, and the Kojid is shifted out of a hosts list of the current receivable tasks;
s200, if the number of the current Kojid receiving tasks is not equal to M, obtaining the CPU utilization rate alpha and the memory utilization rate beta of the current Kojid through a top command, and calculating the integrated resource utilization rate Ag; then judging whether the integrated resource utilization rate is greater than 90%, if so, shifting the Kojid out of the list of hosts currently capable of receiving the task;
where Ag is 0.5 α +0.5 β;
s300, if the integrated resource utilization rate Ag is not greater than 90%, obtaining the current ongoing compiling task types of the Kojids, wherein the compiling task types comprise build, build SRPMFromSCM, build follows, tag build, newRepo, creterepo and the like, and counting the number of build and the number of build SRPMFromSCM of each current ongoing compiling task of the Kojids and the sum T of the number of the build and the number of the build SRPMFromSCM; performing ascending or descending sequencing, finding the minimum task number in the T and recording the minimum task number as Y, feeding back the task information of each Kojid to a Kojihub end, reserving the Kojid of which the T is equal to the Y, and moving the residual Kojid out of a hosts list of the current acceptable tasks;
for example, if T is 1 in the first Kojid, T is 3 in the second Kojid, T is 2 in the third Kojid, and Y is 1 in the fourth Kojid, the first Kojid and the fourth Kojid are reserved, and the second Kojid and the third Kojid are shifted out of the hosts list of the currently acceptable tasks;
s400, determining whether the number of remaining kojids in the list of hosts of the currently acceptable task is equal to 1, and if the number of remaining kojids is not equal to 1, determining again the total resource utilization ratio of remaining kojids in the list of hosts of the currently acceptable task, sorting the total resource utilization ratio Ag in an ascending or descending order, keeping the Kojid with the lowest total resource utilization ratio, and shifting the remaining kojids out of the list of hosts of the currently acceptable task;
if the number of remaining kojids is equal to 1, the Kojid is the Kojid with the optimal compilation resources;
s500, judging the number of the remaining Kojids in the hosts list of the current acceptable tasks again, if the number of the remaining Kojids is equal to 1 or more than 1, enabling the remaining Kojids in the hosts list of the current acceptable tasks to have optimal compiling resources, and distributing the compiling tasks of the current request to the remaining Kojids by the Kojihub.
After the Kojihub uses the remaining Kojid to distribute the currently requested compiling task, restoring the Kojid removed in the above steps to the hosts list of acceptable tasks, and judging and distributing the next compiling task, wherein the specific commands are as follows: koji restart-hosts $ Kojid1$ Kojid2 ….
Wherein Kojid shifts out the hosts list of the current receivable tasks, and the specific execution command is as follows:
Koji disable-host$Kojid1$Kojid2…；
when the Kojid moves out of the hosts list of currently receivable tasks, then the Kojid cannot receive new compilation tasks.
Example 2
An embodiment of the present invention further provides a device for dynamically managing compiled resources, please refer to fig. 3, which includes: the device comprises an inquiry device, a calculation device, a judgment device, a shifting-out device, a compiling device and a recovery device;
the query device is used for acquiring a plurality of Kojids in hosts, the real-time task quantity and the task type of each current Kojid and querying the utilization rate of a CPU and a memory of each Kojid through a top command;
the calculating means calculates the sum T of the number of built tasks and built SRPMFromSCM tasks, the minimum value Y in T of each Kojid and each Kojid integrated resource utilization factor by the task type of each Kojid at present;
the judging device makes a judgment according to T, Y and the integrated resource utilization factor to obtain Kojid that needs to be moved out of the hosts list;
the shifting-out device is used for acquiring the Kojid required to be shifted out by the judging device, executing a Kojid command for operation, and shifting out the Kojid required to be shifted out from the hosts list to obtain a second hosts list; the Kojid contained in the second list has the optimal compiled resources;
the compiling device acquires Kojid in the second hosts list, and the Kojihub distributes and executes compiling tasks according to the Kojid;
and the recovery device is used for executing Kojid commands to operate after the Kojid executes the compiling tasks, and recovering the shifted Koijid into the hosts list so as to be capable of receiving the distribution of the subsequent compiling tasks.
Based on the same inventive concept as the method in the foregoing embodiments, the present specification further provides a computer-readable storage medium, on which a computer program is stored, and the computer program, when executed by a processor, implements the steps of the method for dynamically managing compiled resources as disclosed in the foregoing.
The numbers of the embodiments disclosed in the embodiments of the present invention are merely for description, and do not represent the merits of the embodiments.
It will be understood by those skilled in the art that all or part of the steps of implementing the above embodiments may be implemented by hardware, and a program that can be implemented by the hardware and can be instructed by the program to be executed by the relevant hardware may be stored in a computer readable storage medium, where the storage medium may be a read-only memory, a magnetic or optical disk, and the like.
The above description is only an embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes performed by the present specification and drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (10)
1. A method for dynamic management of compiled resources, comprising the steps of:
inquiring a plurality of compilers in a compiler list, and setting a threshold value of the number of tasks received by the compilers and a threshold value of the comprehensive resource utilization rate;
judging the relation between the number of the tasks received by the compiler and the threshold value;
if the number of the tasks received by the compiler is not less than the threshold value, executing a shift-out operation on the compiler;
if the number of the tasks received by the compiler is smaller than the threshold value, executing judgment operation to find out a first compiler;
and distributing a compiling task to the first compiler, and executing the compiling task by the first compiler.
2. The method for dynamic management of compiled resources of claim 1, wherein: the step of performing the determination further comprises:
acquiring the CPU utilization rate and the memory utilization rate of the compiler, and calculating the comprehensive resource utilization rate;
judging whether the comprehensive resource utilization rate is greater than the threshold value of the comprehensive resource utilization rate;
if the comprehensive resource utilization rate is greater than the comprehensive resource utilization rate threshold value, executing the shift-out operation;
and if the comprehensive resource utilization rate is not greater than the comprehensive resource utilization rate threshold value, executing calculation reservation operation.
3. The method for dynamic management of compiled resources of claim 2, wherein: the step of performing a computation reservation operation further comprises:
acquiring a plurality of task types compiled in the compiler;
counting the added value of the number of first tasks and the number of second tasks in the task types compiled in the plurality of compilers;
sequencing the added values in an ascending order, finding out the added value with the first rank and recording the added value as the minimum task number;
reserving the compiler with the added value equal to the minimum task number, recording as a second compiler, and executing selection operation on the second compiler;
executing the move-out operation with the compiler that is not the second compiler in the list of compilers.
4. A method for dynamic management of compiled resources according to claim 3, wherein: the step of performing a selection operation further comprises:
judging whether the number of the second compilers in the compiler list is equal to a first preset number or not;
if the number of the second compilers is equal to the first preset number, calculating the comprehensive resource utilization rate of the second compilers;
sequencing the comprehensive resource utilization rate of the second compiler in an ascending order, finding out the compiler in the second compiler according to the comprehensive resource utilization rate ranked first, and recording as a third compiler;
executing the move-out operation by the second compiler which is not the third compiler in the compiler list, wherein the third compiler is the first compiler;
and if the number of the second compiling machines is equal to a first preset number, the second compiling machine is the first compiling machine.
5. A method for dynamic management of compiled resources according to any one of claims 1 to 4, wherein: the executing the move-out operation comprises: removing the compiler from the list of compilers.
6. The method for dynamic management of compiled resources of claim 5, wherein: and after the first compiler executes the compiling task, restoring the compiler removed from the compiler list into the compiler list.
7. A method for dynamic management of compiled resources according to claim 3, wherein: the compiler is Kojid, the first task is build, and the second task is build SRPMFromSCM.
8. An apparatus for dynamic management of compiled resources, comprising: the device comprises an inquiry device, a calculation device, a judgment device, a shifting-out device and a compiling device;
the query device is used for acquiring a plurality of compilers in a compiler list, the number of tasks and the types of the tasks in the compilers, and querying the CPU utilization rate and the memory utilization rate of the compilers;
the computing device computes the sum of the number of first tasks and the number of second tasks in the task types through the task types in the plurality of compilers, counts the minimum value in the sum, and computes the comprehensive resource utilization rate of the plurality of compilers;
the judging device judges according to the added value, the minimum value and the comprehensive resource utilization rate to obtain the compiler which is moved out of the compiler list;
the shifting-out device is used for acquiring the shifted-out compiler and shifting the shifted-out compiler out of the compiler list to obtain a first compiler list, wherein the compiler in the first compiler list is a first compiler;
the compiling device is used for acquiring the first compiler and distributing a compiling task to the first compiler for execution.
9. The apparatus for dynamically managing compiled resources of claim 8, wherein: also includes a recovery device;
and the recovery device is used for recovering the removed compiler to the compiler list after the first compiler executes the compiling task.
10. A computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, carries out the method steps of a dynamic management of compiled resources of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110083812.7A CN112764928A (en) | 2021-01-21 | 2021-01-21 | Method, device and medium for dynamic management of compiling resources |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110083812.7A CN112764928A (en) | 2021-01-21 | 2021-01-21 | Method, device and medium for dynamic management of compiling resources |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112764928A true CN112764928A (en) | 2021-05-07 |
Family
ID=75702546
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110083812.7A Withdrawn CN112764928A (en) | 2021-01-21 | 2021-01-21 | Method, device and medium for dynamic management of compiling resources |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112764928A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113849160A (en) * | 2021-09-24 | 2021-12-28 | 苏州浪潮智能科技有限公司 | Dynamic migration method and device for compiling task, electronic equipment and storage medium |
-
2021
- 2021-01-21 CN CN202110083812.7A patent/CN112764928A/en not_active Withdrawn
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113849160A (en) * | 2021-09-24 | 2021-12-28 | 苏州浪潮智能科技有限公司 | Dynamic migration method and device for compiling task, electronic equipment and storage medium |
| CN113849160B (en) * | 2021-09-24 | 2023-11-14 | 苏州浪潮智能科技有限公司 | Dynamic migration method and device for compiling tasks, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8219997B2 (en) | Execution the job that is divided into job tasks based on the estimated completion time | |
| JP4386410B2 (en) | Method and system for dynamically allocating computer system resources | |
| JP5305649B2 (en) | Method, apparatus, and computer program for dynamic query optimization | |
| CN1138207C (en) | Method for use of remote JAVA object allocator | |
| US8209695B1 (en) | Reserving resources in a resource-on-demand system for user desktop utility demand | |
| US7979857B2 (en) | Method and apparatus for dynamic memory resource management | |
| US7567359B2 (en) | Method and program for executing a job in a remote computer in different computer environment | |
| JP4954089B2 (en) | Method, system, and computer program for facilitating comprehensive grid environment management by monitoring and distributing grid activity | |
| US7765552B2 (en) | System and method for allocating computing resources for a grid virtual system | |
| US7437460B2 (en) | Service placement for enforcing performance and availability levels in a multi-node system | |
| US7886125B2 (en) | Configuration size determination in logically partitioned environment | |
| US7441033B2 (en) | On demand node and server instance allocation and de-allocation | |
| US7664859B2 (en) | Resource assigning management apparatus and resource assigning method | |
| US8752059B2 (en) | Computer data processing capacity planning using dependency relationships from a configuration management database | |
| US20040143664A1 (en) | Method for allocating computer resource | |
| US20050198636A1 (en) | Dynamic optimization of batch processing | |
| US8544005B2 (en) | Autonomic method, system and program product for managing processes | |
| EP1654649B1 (en) | On demand node and server instance allocation and de-allocation | |
| US20050262509A1 (en) | Method of allocating computing resources | |
| US7752623B1 (en) | System and method for allocating resources by examining a system characteristic | |
| US20030188120A1 (en) | Memory allocation method and program thereof | |
| CN112764928A (en) | Method, device and medium for dynamic management of compiling resources | |
| JP4862056B2 (en) | Virtual machine management mechanism and CPU time allocation control method in virtual machine system | |
| US20090228537A1 (en) | Object Allocation System and Method | |
| CN110084507B (en) | Scientific workflow scheduling optimization method based on hierarchical perception in cloud computing environment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20210507 |
|
| WW01 | Invention patent application withdrawn after publication |