CN117032974A - Dynamic scheduling method and terminal based on resource application - Google Patents
Dynamic scheduling method and terminal based on resource application Download PDFInfo
- Publication number
- CN117032974A CN117032974A CN202311038852.5A CN202311038852A CN117032974A CN 117032974 A CN117032974 A CN 117032974A CN 202311038852 A CN202311038852 A CN 202311038852A CN 117032974 A CN117032974 A CN 117032974A
- Authority
- CN
- China
- Prior art keywords
- task
- resource
- computing power
- executed
- power resources
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 56
- 238000013468 resource allocation Methods 0.000 claims abstract description 23
- 238000004364 calculation method Methods 0.000 claims abstract description 18
- 230000002159 abnormal effect Effects 0.000 claims description 15
- 238000004590 computer program Methods 0.000 claims description 8
- 238000012216 screening Methods 0.000 claims description 5
- 238000007726 management method Methods 0.000 claims description 4
- 238000012544 monitoring process Methods 0.000 claims description 4
- 230000005856 abnormality Effects 0.000 claims 1
- 239000002699 waste material Substances 0.000 abstract description 9
- 230000009286 beneficial effect Effects 0.000 description 3
- 238000001514 detection method Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000006399 behavior Effects 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
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/5061—Partitioning or combining of resources
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Power Sources (AREA)
Abstract
The application provides a dynamic scheduling method and a terminal based on resource application, comprising the following steps: counting the computing power resources of each device and managing the resources; acquiring a task to be executed, and calculating the required resource size according to the content of the task to be executed; performing minimum resource allocation calculation on all computing power resources according to the size of the resources to obtain a resource allocation scheme; and according to the resource allocation scheme, corresponding computing power resources are allocated to the tasks to be executed, and the devices corresponding to the computing power resources execute the tasks to be executed. According to the application, the calculation power resource statistics is carried out on each device, then the created task is obtained, the resource demand calculation is carried out on the task, the minimum calculation power resource allocation is carried out on the task according to the resource demand of the task, namely, the device which is most in line with the task demand and is least in waste is selected to execute the task, the execution of the task which is dynamically changed in the system is satisfied, the waste of available resources of the device can be effectively reduced, and the completion efficiency of the task and the stability of the system can be improved.
Description
Technical Field
The present application relates to the field of resource scheduling technologies, and in particular, to a dynamic scheduling method and a terminal based on resource application.
Background
At present, task scheduling on edge computing equipment is a static scheduling mode, namely, an execution plan of a task is formulated according to the properties of the task and the condition of equipment resources. For example, assuming that there is a task for detecting phishing behavior of a reservoir, an edge computing device needs to be selected first, then a phishing behavior detection algorithm is configured, the detection period is set to be 24 hours, the detection frequency is set to be 1 minute once, finally, a task execution strategy is issued to the edge device, and the device starts to execute the task according to the strategy.
However, the above-described scheme generally has the following drawbacks:
disadvantage 1: complicated task configuration is troublesome because static task configuration mainly depends on configuration of a user according to task execution conditions, involves a complicated execution strategy and has higher requirements for the user.
Disadvantage 2: the task operated by each device is prepared from the beginning, so that the task can be ensured to normally operate, the resources required by the task cannot exceed the resources of a single device, and if the spare resources of the device are not enough to operate a complete task, the task cannot be operated on the device, so that the resources are wasted as a whole.
Disadvantage 3: if the equipment running the task fails, the task stops.
Disclosure of Invention
The technical problems to be solved by the application are as follows: the dynamic scheduling method and the terminal based on the resource application are provided to cope with the dynamic change of the system, and the completion efficiency of the task and the stability of the system are improved.
In order to solve the technical problems, the application adopts the following technical scheme:
a dynamic scheduling method based on resource application comprises the following steps:
s1, counting computing power resources of each device and managing the resources;
s2, acquiring a task to be executed, and calculating the required resource size according to the content of the task to be executed;
s3, carrying out minimum resource allocation calculation on all the computing power resources according to the resource size to obtain a resource allocation scheme;
and S4, distributing the corresponding computing power resources to the task to be executed according to the resource distribution scheme, and executing the task to be executed by the equipment corresponding to the computing power resources.
In order to solve the technical problems, the application adopts another technical scheme that:
a resource application based dynamic scheduling terminal comprising a memory, a processor and a computer program stored on the memory and executable on the processor, said processor implementing the steps in a resource application based dynamic scheduling method as described above when executing said computer program.
The application has the beneficial effects that: the application provides a dynamic scheduling method and a terminal based on resource application, which replace the process of reconstructing a task by the prior device, and replace the process of reconstructing the task by the prior device, and then calculate the resource demand of the task by firstly counting the computing power resources of each device and then acquiring the created task, and allocate the minimum computing power resource to the task according to the resource demand of the task, the method has the advantages that the device which meets the task requirement most and has the smallest waste is selected to execute the task, and the method is equivalent to replacing the existing process of firstly selecting the device and then creating the task to execute the task with the process of firstly creating the task and then selecting the device to execute the task, so that the execution of the task which dynamically changes in the system is met in a mode of searching available resources, the waste of the available resources of the device can be effectively reduced, and the completion efficiency of the task and the stability of the system can be improved.
Drawings
FIG. 1 is a flow chart of a dynamic scheduling method based on resource application according to an embodiment of the present application;
FIG. 2 is a task scheduling block diagram of a dynamic scheduling method based on resource application according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a dynamic scheduling terminal based on resource application according to an embodiment of the present application.
Description of the reference numerals:
1. a dynamic scheduling terminal based on resource application; 2. a memory; 3. a processor.
Detailed Description
In order to describe the technical contents, the achieved objects and effects of the present application in detail, the following description will be made with reference to the embodiments in conjunction with the accompanying drawings.
Referring to fig. 1 and 2, a dynamic scheduling method based on resource application includes the steps of:
s1, counting computing power resources of each device and managing the resources;
s2, acquiring a task to be executed, and calculating the required resource size according to the content of the task to be executed;
s3, carrying out minimum resource allocation calculation on all the computing power resources according to the resource size to obtain a resource allocation scheme;
and S4, distributing the corresponding computing power resources to the task to be executed according to the resource distribution scheme, and executing the task to be executed by the equipment corresponding to the computing power resources.
From the above description, the beneficial effects of the application are as follows: the process of reconstructing the task by the prior equipment is replaced by the process of reconstructing the task by the prior equipment, the calculation resource statistics is carried out on each equipment, then the created task is obtained, the resource demand calculation is carried out on the task, the minimum calculation resource allocation is carried out on the task according to the resource demand of the task, namely, the equipment which is most in line with the task demand and is least wasted is selected to execute the task, which is equivalent to the process of replacing the prior equipment and then creating the task to execute the task by the prior equipment and then selecting the equipment to execute the task, so that the execution of the task which dynamically changes in the system is satisfied in a mode of searching the available resource, the waste of the available resource of the equipment can be effectively reduced, and the completion efficiency of the task and the stability of the system can be improved.
Further, the computing power resources comprise CPU main frequency, core number, memory size, disk size and GPU computing power of the device.
From the above description, it can be seen that counting the computing power resources of each device including the main frequency of the CPU, the core number, the memory size, the disk size and the GPU computing power is performed, so as to convert each device into an intuitive resource data form, and facilitate the subsequent calculation of minimum resource allocation according to the computing power resources.
Further, the resource management specifically includes:
and creating a resource list, writing each device and the corresponding computing power resources into the resource list, and recording the total amount, the use condition and the residual available amount of the computing power resources.
From the above description, it can be seen that by uniformly managing the computing power resources of each device, the use of each device and the situation of the computing power resources thereof can be checked, maintained and updated in real time by acquiring the resource list.
Further, the step S3 specifically includes:
s31, traversing the resource list, and screening equipment corresponding to unused computing power resources according to the use condition and the residual available quantity of the computing power resources;
s32, comparing the calculated force resource size corresponding to each device and the resource size required by the task to be executed, and searching for the optimal device capable of meeting the task to be executed to obtain a resource allocation scheme.
As can be seen from the above description, since the resource list records the use condition and the remaining available amount of each computing power resource, that is, it is equivalent to recording whether each device is currently idle, by screening the idle device and directly comparing the computing power resource size of the idle device with the resource demand size of the task to be executed, the optimal device most suitable for executing the current task can be obtained quickly, the idle computing power resource of the device can be ensured to be fully utilized, the range of computing power resource cannot be exceeded or exceeded, and the situation that the idle resource of the device is insufficient to run a complete task or the resource is wasted is avoided.
Further, the step S4 specifically includes:
executing the task to be executed by adopting the optimal equipment, and monitoring the execution condition of the task to be executed in real time;
releasing the computing power resource corresponding to the optimal equipment after the task to be executed is completed;
and the use condition and the residual available quantity of the computing power resources in the resource list are updated in real time in the whole process.
According to the description, the execution and release of the task are updated in the resource list in real time, so that the resource list can maintain the resource use condition of each device in real time, when a new task appears, the dynamic scheduling method can timely perform subsequent task execution, the condition that the new task is waiting for backlog and cannot be executed is avoided, and the task completion efficiency is effectively improved.
Further, the step S31 further includes:
if the computing power resources are all used, the task to be executed enters a task waiting until the unused computing power resources appear in the resource list.
From the above description, it can be seen that only when each device in the system is in a task execution state, the newly created task needs to enter a task waiting state, and when the device is idle, the dynamic scheduling step is repeated to perform optimal resource allocation so as to execute the new task.
Further, before the step S2, the method further includes:
and presetting a priority for each task to be executed.
From the above description, it is known to preset priorities for new tasks so that important tasks can be performed first.
Further, the step S31 further includes:
if the computing power resources are used and the priority of the task to be executed is higher than the priority of the task being executed by at least one device in the resource list, terminating execution of the task with the lowest priority and releasing the computing power resources of the corresponding device;
and the task to be executed is executed by the equipment releasing the computing power resources, and the terminated task enters task waiting until the unused computing power resources appear in the resource list.
As can be seen from the above description, the task with the high priority is a task that is important relative to other tasks, so when no idle device is available, the device that executes the task with the lowest priority can be tuned to execute the new task with the high priority at the moment by terminating the execution of the task with the lowest priority, thereby avoiding the delay of important tasks.
Further, in the whole dynamic scheduling process, if the equipment is abnormal, alarming is carried out, abnormal equipment in the resource list and the corresponding computing power resources are removed, and the abnormal equipment is rewritten in the resource list when the abnormal equipment is recovered to be normal;
the anomalies include power outages, task execution failures, equipment line faults, and equipment damage.
As can be seen from the above description, the abnormal device is removed from the resource list, and is not used as a device for performing subsequent calculation of the optimal calculation force resource, so that task allocation to the abnormal device is avoided, and execution failure of the task is avoided.
Referring to fig. 3, a dynamic scheduling terminal based on resource application includes a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor implements the steps in a dynamic scheduling method based on resource application as described above when executing the computer program.
From the above description, the beneficial effects of the application are as follows: based on the same technical conception, the dynamic scheduling method based on the resource application is matched, the dynamic scheduling terminal based on the resource application is provided, the process of reconstructing the task by the existing first-selected equipment is replaced by the process of reconstructing the task by the first-selected equipment, computing power resource statistics is carried out on each equipment, then the created task is acquired, resource demand calculation is carried out on the task, minimum computing power resource allocation is carried out on the task according to the resource demand of the task, namely, the equipment which is most in line with the task demand and is least wasted is selected to execute the task, which is equivalent to the process of replacing the process of executing the task by the first-selected equipment and then the task is created and then the task is selected to execute the task, so that the execution of the dynamic change in the system is met by searching available resources, the waste of the available resources of the equipment is effectively reduced, and the completion efficiency of the task and the stability of the system are improved.
The dynamic scheduling method and the terminal based on the resource application are applied to dynamic task scheduling of edge computing equipment, and are described below with reference to specific embodiments.
Referring to fig. 1, a first embodiment of the present application is as follows:
a dynamic scheduling method based on resource application, as shown in figure 1, comprises the following steps:
s1, counting computing power resources of each device and managing the resources;
the computing power resource comprises CPU main frequency, core number, memory size, disk size and GPU computing power of the equipment, and the resource management is specifically as follows: and creating a resource list, writing each device and the corresponding computing power resources into the resource list, and recording the total amount, the use condition and the residual available amount of the computing power resources.
S2, acquiring a task to be executed, and calculating the needed resource size according to the content of the task to be executed.
And S3, carrying out minimum resource allocation calculation on all the computing power resources according to the size of the resources to obtain a resource allocation scheme.
And S4, distributing the corresponding computing power resources to the tasks to be executed according to the resource distribution scheme, and executing the tasks to be executed by the equipment corresponding to the computing power resources.
In this embodiment, the process of reconstructing the task by using the existing first-selected device is replaced by the process of reconstructing the task by using the first-selected device, and computing power resource statistics including the main frequency, the core number, the memory size, the disk size and the GPU computing power is performed on each device to convert each device into an intuitive resource data form, then the created task is obtained, resource demand calculation is performed on the task, and minimum computing power resource allocation is performed on the task according to the resource demand of the task, namely, the device which best meets the task demand and has the minimum waste is selected to execute the task, which is equivalent to the process of replacing the process of executing the task by using the existing first-selected device and then the created task by using the first-selected device to execute the task, so that the execution of the task which dynamically changes in the system is satisfied by searching for available resources is realized, not only the waste of available resources of the device can be effectively reduced, but also the completion efficiency of the task and the stability of the system can be improved. The method comprises the steps of carrying out unified management on the computing power resources of each device, and then realizing the use of each device and the viewing, maintenance and real-time updating of the computing power resources thereof by a mode of acquiring a resource list so as to effectively improve the overall stability of the system.
Referring to fig. 2, a second embodiment of the present application is as follows:
in this embodiment, as shown in fig. 2, a task scheduling block diagram of the dynamic scheduling method based on resource application in this embodiment is shown, in this embodiment, a task queue includes a plurality of tasks to be executed, and each task has a required resource size; the resource pool is the computing power resource of each device of the system and each device; the dynamic scheduling system matches the optimal computing power resource (i.e. the optimal device) in the resource pool with the computing power resource of the idle device in the resource pool by comparing the resource size of each task to be executed in the task queue with the computing power resource size of the idle device in the resource pool, so that the optimal device correspondingly executes the task to be executed.
In this embodiment, in order to enable minimum resource allocation, step S3 is specifically:
s31, traversing the resource list, and screening equipment corresponding to unused computing power resources according to the use condition and the residual available quantity of the computing power resources.
S32, comparing the calculated power resource size corresponding to each device and the resource size required by the task to be executed, and searching the optimal device capable of meeting the requirement of the task to be executed to obtain a resource allocation scheme.
In this embodiment, since the resource list records the use condition and the remaining available amount of each computing power resource, that is, it is equivalent to recording whether each device is currently idle, by screening the idle device and directly comparing the computing power resource size of the idle device with the resource demand size of the task to be executed, the optimal device most suitable for executing the current task can be obtained quickly, the idle computing power resource of the device can be ensured to be fully utilized, the range of computing power resources is not exceeded or exceeded, and the situation that the idle resource of the device is not enough to run a complete task or the resource is wasted is avoided.
Wherein step S31 further comprises:
if all the computing resources are used, the task to be executed enters the task waiting until the unused computing resources appear in the resource list.
The newly created task needs to enter a task waiting mode only when all devices in the system are in the task executing mode, and the dynamic scheduling step is repeated to perform optimal resource allocation to execute the new task when the idle device is left.
After the optimal resource allocation scheme is obtained, in this embodiment, step S4 specifically includes:
executing a task to be executed by adopting optimal equipment, and monitoring the execution condition of the task to be executed in real time;
and after the task to be executed is executed, releasing the computing power resource corresponding to the optimal equipment.
As shown in FIG. 2, the dynamic system further comprises an operation monitoring system, which can update the use condition and the residual available amount of the computing power resources in the resource list in real time in the whole dynamic scheduling process.
The execution and release of the task are updated in the resource list in real time, so that the resource list realizes the real-time maintenance of the resource use condition of each device, and when a new task appears, the dynamic scheduling method can be timely carried out for carrying out subsequent task execution, thereby avoiding the condition that the new task is waiting for backlog and can not be executed, and effectively improving the completion efficiency of the task.
The third embodiment of the application is as follows:
on the basis of the first or second embodiment, in this embodiment, the method further includes, before step S2:
a priority is preset for each task to be executed.
That is, in the present embodiment, priorities are preset for new tasks so that important tasks can be performed first.
Step S31 further includes:
if the computing resources are used and the priority of the task to be executed is higher than the priority of the task being executed by at least one device in the resource list, terminating the execution of the task with the lowest priority and releasing the computing resources of the corresponding devices;
the task to be executed is executed by the device releasing the computing power resources, and the terminated task enters the task to wait until unused computing power resources appear in the resource list.
The task with the highest priority is the important task relative to other tasks, so that when no idle equipment is available, the equipment for executing the task with the lowest priority can be called to execute the new task with the higher priority at the moment by stopping the execution of the task with the lowest priority, and the important task is prevented from being delayed.
In addition, it is worth to say that in the whole dynamic scheduling process, if the equipment is abnormal, an alarm is given, abnormal equipment in the resource list and the corresponding computing power resources are removed, and the abnormal equipment is rewritten in the resource list when the abnormal equipment is recovered to be normal.
Namely, the abnormal equipment is removed from the resource list and is not used as equipment for carrying out subsequent calculation of the optimal calculation force resource, so that task allocation to the abnormal equipment is avoided, and execution failure of the task is avoided. Including but not limited to power outages, task execution failures, equipment line faults, and equipment damage.
Referring to fig. 3, a third embodiment of the present application is as follows:
the dynamic scheduling terminal 1 based on resource application comprises a memory 2, a processor 3 and a computer program stored in the memory 2 and capable of running on the processor 3, wherein the processor 3 realizes the steps in the dynamic scheduling method based on resource application in any one of the first to third embodiments when executing the computer program.
In summary, the dynamic scheduling method and the terminal based on the resource application provided by the application can effectively reduce the waste of available resources of the equipment and can also improve the task completion efficiency and the system stability.
The foregoing description is only illustrative of the present application and is not intended to limit the scope of the application, and all equivalent changes made by the specification and drawings of the present application, or direct or indirect application in the relevant art, are included in the scope of the present application.
Claims (10)
1. The dynamic scheduling method based on the resource application is characterized by comprising the following steps:
s1, counting computing power resources of each device and managing the resources;
s2, acquiring a task to be executed, and calculating the required resource size according to the content of the task to be executed;
s3, carrying out minimum resource allocation calculation on all the computing power resources according to the resource size to obtain a resource allocation scheme;
and S4, distributing the corresponding computing power resources to the task to be executed according to the resource distribution scheme, and executing the task to be executed by the equipment corresponding to the computing power resources.
2. The method of claim 1, wherein the computing power resources include CPU dominant frequency, core number, memory size, disk size, and GPU computing power of the device.
3. The dynamic scheduling method based on resource application according to claim 1, wherein the resource management specifically comprises:
and creating a resource list, writing each device and the corresponding computing power resources into the resource list, and recording the total amount, the use condition and the residual available amount of the computing power resources.
4. The dynamic scheduling method based on resource application according to claim 3, wherein the step S3 specifically includes:
s31, traversing the resource list, and screening equipment corresponding to unused computing power resources according to the use condition and the residual available quantity of the computing power resources;
s32, comparing the calculated force resource size corresponding to each device and the resource size required by the task to be executed, and searching for the optimal device capable of meeting the task to be executed to obtain a resource allocation scheme.
5. The method for dynamic scheduling based on resource application according to claim 4, wherein the step S4 specifically comprises:
executing the task to be executed by adopting the optimal equipment, and monitoring the execution condition of the task to be executed in real time;
releasing the computing power resource corresponding to the optimal equipment after the task to be executed is completed;
and the use condition and the residual available quantity of the computing power resources in the resource list are updated in real time in the whole process.
6. The method for dynamic scheduling based on resource application according to claim 5, wherein the step S31 further comprises:
if the computing power resources are all used, the task to be executed enters a task waiting until the unused computing power resources appear in the resource list.
7. The method for dynamic scheduling based on resource application according to claim 6, wherein the step S2 further comprises:
and presetting a priority for each task to be executed.
8. The dynamic scheduling method according to claim 7, wherein the step S31 further comprises:
if the computing power resources are used and the priority of the task to be executed is higher than the priority of the task being executed by at least one device in the resource list, terminating execution of the task with the lowest priority and releasing the computing power resources of the corresponding device;
and the task to be executed is executed by the equipment releasing the computing power resources, and the terminated task enters task waiting until the unused computing power resources appear in the resource list.
9. The dynamic scheduling method based on resource application according to claim 3, wherein in the whole dynamic scheduling process, if there is an abnormality in the equipment, an alarm is given, abnormal equipment in the resource list and the corresponding computing power resources are removed, and the abnormal equipment is rewritten in the resource list when the abnormal equipment is recovered to be normal;
the anomalies include power outages, task execution failures, equipment line faults, and equipment damage.
10. A resource application based dynamic scheduling terminal comprising a memory, a processor and a computer program stored on the memory and executable on the processor, said processor implementing the steps in a resource application based dynamic scheduling method according to any of the preceding claims 1 to 9 when said computer program is executed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311038852.5A CN117032974A (en) | 2023-08-17 | 2023-08-17 | Dynamic scheduling method and terminal based on resource application |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311038852.5A CN117032974A (en) | 2023-08-17 | 2023-08-17 | Dynamic scheduling method and terminal based on resource application |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117032974A true CN117032974A (en) | 2023-11-10 |
Family
ID=88635094
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311038852.5A Pending CN117032974A (en) | 2023-08-17 | 2023-08-17 | Dynamic scheduling method and terminal based on resource application |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117032974A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118036994A (en) * | 2024-03-13 | 2024-05-14 | 湖北思兴建设有限公司 | Intelligent building management method and system based on BIM scene construction |
-
2023
- 2023-08-17 CN CN202311038852.5A patent/CN117032974A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118036994A (en) * | 2024-03-13 | 2024-05-14 | 湖北思兴建设有限公司 | Intelligent building management method and system based on BIM scene construction |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3180695B1 (en) | Systems and methods for auto-scaling a big data system | |
| CN108845884B (en) | Physical resource allocation method, device, computer equipment and storage medium | |
| CN109857558A (en) | A kind of data flow processing method and system | |
| CN103955491B (en) | Method for synchronizing timing data increment | |
| US11726836B2 (en) | Predicting expansion failures and defragmenting cluster resources | |
| CN106293941B (en) | Method for distributing database system resources | |
| CN104915407A (en) | Resource scheduling method under Hadoop-based multi-job environment | |
| CN102081554A (en) | Cloud computing operating system as well as kernel control system and method thereof | |
| CN103746838B (en) | A kind of method for scheduling task of non-stop layer node computer network | |
| CN117032974A (en) | Dynamic scheduling method and terminal based on resource application | |
| US12026536B2 (en) | Rightsizing virtual machine deployments in a cloud computing environment | |
| CN112506808B (en) | Test task execution method, computing device, computing system and storage medium | |
| CN112559159A (en) | Task scheduling method based on distributed deployment | |
| CN115373835A (en) | Task resource adjusting method and device for Flink cluster and electronic equipment | |
| CN110727508A (en) | Task scheduling system and scheduling method | |
| CN114610567A (en) | Container monitoring method, network device and storage medium | |
| JP2013206368A (en) | Virtual environment operation support system | |
| CN111897626A (en) | Cloud computing scene-oriented virtual machine high-reliability system and implementation method | |
| CN111506407A (en) | Resource management and job scheduling method, system and medium combining Pull mode and Push mode | |
| CN111708799A (en) | Spark task processing method and device, electronic equipment and storage medium | |
| CN107967172B (en) | Spark task dynamic migration method and system for heterogeneous storage | |
| CN115480924A (en) | Method and device for processing job data, storage medium and electronic equipment | |
| CN113901141B (en) | Distributed data synchronization method and system | |
| US20100293358A1 (en) | Dynamic processor-set management | |
| CN115391030A (en) | Control method and device, computer equipment and storage medium |
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 |