CN115098252A - Resource scheduling method, device and computer readable medium - Google Patents
Resource scheduling method, device and computer readable medium Download PDFInfo
- Publication number
- CN115098252A CN115098252A CN202210681196.XA CN202210681196A CN115098252A CN 115098252 A CN115098252 A CN 115098252A CN 202210681196 A CN202210681196 A CN 202210681196A CN 115098252 A CN115098252 A CN 115098252A
- Authority
- CN
- China
- Prior art keywords
- test
- node
- task
- nodes
- automatic
- 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
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/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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
- G06F11/3668—Software testing
- G06F11/3672—Test management
-
- 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/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Hardware Design (AREA)
- Quality & Reliability (AREA)
- Debugging And Monitoring (AREA)
Abstract
The scheme can configure a test node into an automatic node, an artificial node or a tide node in advance, wherein the automatic node is used for executing an automatic test task, the artificial node is used for executing the artificial test task, the tide node is used for executing the automatic test task in a first time interval and is used for executing the artificial test task in a second time interval, after task parameters of the test task submitted by a user are obtained, the test task can be distributed to the corresponding test node according to the task parameters, and meanwhile the test task on the tide node can be cleared when preset conditions are met. Therefore, the test nodes can be reasonably distributed, so that the tide nodes can play the same role as the automatic nodes or the manual nodes in different time periods according to the requirements of actual scenes, idle computing resources are timely recycled, and the utilization rate of the computing resources is improved.
Description
Technical Field
The present application relates to the field of information technology, and in particular, to a resource scheduling method, device, and computer readable medium.
Background
Software testing often uses automated testing frameworks to configure custom environments to reduce repetitive labor, while automated testing is also used to perform regression testing. Typically, both are maintained in one set of systems.
In an actual scene, a computing resource is generally leased through a cloud platform to provide a required computing resource for a test, and when the computing resource is leased, in order to ensure that the test can be successfully completed without being interrupted in the test process, time granularity during application is often large, such as more than several days. However, in the process of software testing, there may be a situation that a part of the testing task does not need a long time to complete, and the testing task is often completed, but the occupied computing resources are not released in time, which results in a great waste of computing resources.
Disclosure of Invention
An object of the present application is to provide a resource scheduling method, device and computer readable medium, so as to solve the problems in the prior art that computing resources cannot be released in time and are wasted.
In order to achieve the above object, the present application provides a resource scheduling method, including:
configuring a test node as an automatic node, a manual node or a tide node, wherein the automatic node is used for executing an automatic test task, the manual node is used for executing a manual test task, and the tide node is used for executing the automatic test task in a first time interval and executing the manual test task in a second time interval;
acquiring task parameters of a test task submitted by a user, and distributing the test task to a corresponding test node according to the task parameters so as to enable the test node to execute the distributed test task;
clearing the test tasks on the tide nodes when preset conditions are met.
Further, configuring the test nodes as automatic nodes, manual nodes or tidal nodes, comprising:
adding a type label to a test node according to a preset configuration rule, and distributing the test node to an automatic test resource pool, a manual test resource pool or a tide resource pool according to the type label, wherein the test node in the automatic test resource pool is an automatic node, the test node in the manual test resource pool is an artificial node, and the test node in the tide resource pool is a tide node.
Further, according to the task parameter, allocating the test task to a corresponding test node, so that the test node executes the allocated test task, including:
determining the type of the test nodes suitable for executing the test task according to the task parameters, and selecting a preset number of test nodes from the type of test nodes;
and distributing the test task to the selected test node so that the test node executes the distributed test task.
Further, the task parameters at least comprise a type tag;
determining the type of a test node suitable for executing the test task according to the task parameters, wherein the type of the test node comprises the following steps:
and matching the label in the task parameter with the type label of the test node, and determining the type of the test node suitable for executing the test task.
Further, acquiring task parameters of a test task submitted by a user, and distributing the test task to a corresponding test node according to the task parameters, so that the test node executes the distributed test task, including:
and the scheduler acquires task parameters of the test tasks submitted by the users, and allocates the test tasks to corresponding test nodes according to the task parameters so that the test nodes execute the allocated test tasks.
Further, cleaning up the test tasks on the tidal nodes when preset conditions are met, comprising:
cleaning the test tasks on the tidal node at the beginning of the first time interval and/or the second time interval.
Further, cleaning up the test tasks on the tidal node when preset conditions are met, comprising:
cleaning up the test tasks on the tidal nodes by a service or daemon when preset conditions are met.
Further, the method further comprises:
monitoring the load condition of each type of test node;
when the load of one type of test nodes exceeds a threshold value, determining the type of test nodes as high-load type test nodes, and configuring part of test nodes in an idle state in other types as the high-load type test nodes.
According to another aspect of the present application, there is also provided an automatic operation and maintenance repair device for a private cloud, the device including a memory for storing computer program instructions and a processor for executing the computer program instructions, wherein when the computer program instructions are executed by the processor, the device is triggered to execute the automatic operation and maintenance repair method for the private cloud.
The embodiment of the application also provides a computer readable medium, on which computer program instructions are stored, and the computer program instructions can be executed by a processor to implement the automatic operation and maintenance repair method for the private cloud.
Compared with the prior art, the resource scheduling scheme is provided, and the scheme can configure a test node into an automatic node, an artificial node or a tide node in advance, wherein the automatic node is used for executing an automatic test task, the artificial node is used for executing the artificial test task, the tide node is used for executing the automatic test task in a first time interval and executing the artificial test task in a second time interval, and after acquiring the task parameters of the test task submitted by a user, the test task can be distributed to the corresponding test node according to the task parameters, so that the test node executes the distributed test task, and meanwhile, the test task on the tide node can be cleared when the preset condition is met. Therefore, the test nodes can be reasonably distributed, so that the tide nodes can play the same role as the automatic nodes or the manual nodes in different time periods according to the requirements of actual scenes, idle computing resources are timely recycled, and the utilization rate of the computing resources is improved.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
fig. 1 is a processing flow chart of a resource scheduling method according to an embodiment of the present application;
the same or similar reference numbers in the drawings identify the same or similar elements.
Detailed Description
The present application is described in further detail below with reference to the attached figures.
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some, but not all embodiments of the present application. 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 application.
In a typical configuration of the present application, the terminal, the device serving the network, each include one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, which include both non-transitory and non-transitory, removable and non-removable media, may implement the information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device.
Some embodiments of the present application provide a resource scheduling method, which may configure a test node as an automatic node, an artificial node, or a tide node in advance, wherein the automatic node is configured to execute an automatic test task, the artificial node is configured to execute an artificial test task, the tide node is configured to execute the automatic test task in a first time interval and is configured to execute the artificial test task in a second time interval, and after acquiring task parameters of the test task submitted by a user, the test task may be allocated to a corresponding test node according to the task parameters, so that the test node executes the allocated test task, and meanwhile, the test task on the tide node may be cleared when a preset condition is met. Therefore, the test nodes can be reasonably distributed, so that the tidal nodes can play the same role as the automatic nodes or the artificial nodes in different time periods according to the requirements of actual scenes, idle computing resources are timely recycled, and the utilization rate of the computing resources is improved.
In an actual scenario, the execution subject of the method may be user equipment, network equipment, or a device formed by integrating the user equipment and the network equipment through a network, or may also be an application program running on the device. The user equipment comprises but is not limited to various terminal equipment such as a computer, a mobile phone and a tablet computer; including but not limited to implementations such as a network host, a single network server, multiple sets of network servers, or a cloud-computing-based collection of computers. Here, the Cloud is composed of a large number of hosts or network servers based on Cloud Computing (Cloud Computing), which is one type of distributed Computing, one virtual computer consisting of a collection of loosely coupled computers.
Fig. 1 shows a processing flow of a resource scheduling method provided in an embodiment of the present application, which at least includes the following steps:
and step S101, configuring the test nodes into automatic nodes, manual nodes or tide nodes. The test nodes are devices capable of being used for executing test tasks, and the devices can be computing resources rented by a user to a cloud computing service provider within a certain time to form the cloud computing nodes, so that in order to reduce cost, the user needs to use the computing resources as much as possible within a rental period, and idle time of the computing resources is reduced.
In a practical scenario, the testing task can be generally divided into an automatic testing task and a manual testing task. The automatic test task is characterized in that manual intervention is not needed in the test process, a test environment can be automatically constructed, and then the test result is automatically executed and obtained. The manual testing task is characterized in that manual intervention is required in the testing process, for example, a user is required to manually construct a testing environment, or some operations related to testing are required to be manually executed in the testing process, and the testing cannot be completed automatically.
The automatic nodes are special test nodes for executing automatic test tasks and do not execute manual test tasks, and the manual nodes are special test nodes for executing manual test tasks and do not execute automatic test tasks. The tide node can be used for executing automatic test tasks and manual test tasks, but the conditions for executing the automatic test tasks or the manual test tasks can be set in advance according to the requirements of actual scenes. For example, the condition set in the present embodiment may be to execute an automatic test task or a manual test task in a time-division manner, that is, the tidal node is used for executing the automatic test task in a first time interval and is used for executing the manual test task in a second time interval. The first time interval and the second time interval refer to two different time periods, for example, a tidal cycle, such as a day, two days, or a week, may be set, and the tidal cycle is divided into two different time periods, which may be set as the first time interval and the second time interval, respectively.
Taking a day as an example, it is generally not suitable to perform manual testing tasks at night because it is not working hours, so the time period of night may be set as a first time interval, while the time period of day may be set as a second time interval. For example, in this embodiment, the second time interval may be set to 9 to 21 points, and the first time interval may be set to 21 to 9 points. Because the tidal node only executes the manual testing task in the second time interval, compared with the manual node, the tidal node is more suitable for executing the manual testing task with shorter testing time, the manual testing environment can be generally generated quickly, the new testing environment can be accepted to be created again every time, and the manual node is more suitable for executing the manual testing task with longer testing time. Taking the first time interval and the second time interval as an example, since the second time interval is from 9 to 21, the tidal node in this embodiment is suitable for performing a manual test task with a test time of no more than 12 hours, and a manual test task with a test time of more than 12 hours is more suitable for being tested by the manual node.
In configuring the test nodes as automatic nodes, manual nodes or tidal nodes, this may be done based on pre-set configuration rules. The configuration rule can be set according to the requirements of actual scenes, so that the optimal distribution can be completed aiming at different application scenes, the idle time of the test nodes is reduced as much as possible, and the utilization rate is improved. For example, when there are many automatic test tasks to be executed, more test nodes may be configured as automatic nodes, or resources of the tidal nodes capable of being used for executing automatic tests may be increased, when there are many test tasks that need to be executed and take a long time, more test nodes may be configured as manual nodes, and when there are many test tasks that need to be executed and take a short time, more test nodes may be configured as tidal nodes, thereby implementing more refined node configuration and improving the utilization rate of computing resources.
In an actual scene, a type label can be added to a test node according to a preset configuration rule, and the test node is allocated to an automatic test resource pool, a manual test resource pool or a tide resource pool according to the type label. The test nodes in the automatic test resource pool are automatic nodes, the test nodes in the manual test resource pool are manual nodes, and the test nodes in the tide resource pool are tide nodes. The type labels may include automatic, manual, tidal, etc. that indicate the node type to which the test nodes are to be configured, whereby the test nodes may be automatically assigned to the corresponding resource pool based on the added type labels.
Thus, the computing resources assigned to the "auto" tags constitute a pool of automated testing resources for automated testing. All resources in the resource pool can only be automatically tested and used, and cannot be used for manual testing. The computing resources assigned to the "manual" tags constitute a manual testing resource pool for manual testing, and the automated testing tasks cannot occupy the computing resources in the resource pool. The computing resource components assigned to the tide label can be used in different time periods, and specifically, the time period of the tide can be set according to the characteristics of the flow of the test task, for example, a manual test task is executed in the daytime, and an automatic test task is executed at night.
Step S102, acquiring task parameters of a test task submitted by a user, and distributing the test task to a corresponding test node according to the task parameters so that the test node executes the distributed test task.
The task parameter includes information related to the test task, for example, the task parameter of the test task may include a tag corresponding to a type of a suitable test node of the test task, so that the type of the test node suitable for executing the test task may be determined according to the task parameter. In a practical scenario, the task parameters may be provided by a user who submits the test task, for example, if the user wants to execute a certain test task in a tidal node, a corresponding tag may be added to the task parameters when submitting the test task, so that when allocating a task, it may be determined that the type of the test node suitable for executing the test task is a tidal node.
In some embodiments of the present application, since a type label is added to a test node when the test node is allocated as an automatic node, a manual node, or a tidal node, the type of the test node suitable for executing the test task may be determined according to the type label in the task parameter, matching with the type of the test node.
After determining the types of the test nodes suitable for executing the test task, a preset number of test nodes may be selected from the types of test nodes. For example, in this embodiment, each of the different types of test nodes may correspond to a corresponding resource pool, that is, the automatic test resource pool includes a certain number of automatic nodes, the manual test resource pool includes a certain number of manual nodes, and the tidal resource pool includes a certain number of tidal nodes. When the corresponding test tasks need to be distributed, a preset number of test nodes can be selected from the resource pools, and then the test tasks are distributed to the selected test nodes, so that the distributed test tasks are executed by the test nodes.
In some embodiments of the present application, a scheduler may obtain task parameters of a test task submitted by a user, and allocate the test task to a corresponding test node according to the task parameters, so that the test node executes the allocated test task. The scheduler may adopt any available framework, such as Jenkins, and the user may input the corresponding task parameter by configuring job at this time. When the scheduler distributes the test tasks to the test nodes, the manual test tasks which need to be completed for more than several days are distributed to the manual nodes, and the manual nodes cannot be recovered before the lease of the manual nodes expires, so that the test work is ensured to be completed smoothly in the period. The automatic test tasks do not need manual intervention, and generally the automatic test tasks can be triggered in batches at a moment in the evening and automatically distributed to the automatic nodes and the tide nodes in the first time interval by the scheduler to execute the test.
And step S103, cleaning the test tasks on the tide nodes when preset conditions are met. Through clearing up the test task on the morning and evening tides node, can release the resource on the morning and evening tides node to avoid calculation resource to be idle by after artifical test task is accomplished, lead to calculation resource usage to reduce, indirectly improved the test cost.
The preset condition may be a condition triggered based on time or a condition triggered based on other factors, and may be specifically set according to a requirement of an actual scene. For example, the tidal node in this embodiment executes the automatic test task and the manual test task separately in different time intervals, so that when the preset condition of cleaning is set, the preset condition can also be set in accordance with the switching time of the tidal node, that is, when the first time interval and/or the second time interval starts, the test task on the tidal node is cleaned. If the first time interval is 21 o ' clock to 9 o ' clock and the second time interval is 9 o ' clock to 21 o ' clock, then the test task on the tidal node can be cleared at 21 o ' clock each day. In addition, the test tasks on the tidal nodes can be cleaned at the beginning of the second time interval, and the test tasks can be set according to the requirements of the actual scene.
In a practical scenario, test tasks on the tidal nodes may be cleared by a service or daemon upon meeting preset conditions. For example, the service may be a service running on the system, a daemon, or a service supported by a container. The service or daemon regularly cleans the processes of executing test tasks on the tidal nodes, no matter the manual test tasks or the automatic test tasks executed on the tidal nodes at the moment. The scheduler may assign new test tasks to tidal nodes after they are found to be idle, thereby increasing the utilization of computing resources.
In other embodiments of the present application, load conditions of each type of test node may be further monitored, and when a load of one type of test node exceeds a threshold, the type of test node is determined as a high-load type test node, and some test nodes in an idle state in other types are configured as the high-load type test node. For example, a manual node may be determined to be a high load type node when all or more than 95% of the resources in the manual test resource pool are occupied. If the loads of the nodes of the other two types do not exceed the threshold value, a part of the test nodes in the idle state in the other types can be reconfigured into the artificial nodes, so that the situation that the resources of the artificial nodes are exhausted and the corresponding test tasks cannot be executed is avoided. Therefore, dynamic adjustment of resources can be realized, and resource allocation is more reasonable.
Based on the same inventive concept, the embodiment of the present application further provides a resource scheduling device, and the method corresponding to the device is the resource scheduling method in the foregoing embodiment, and the principle of solving the problem is similar to that of the method. The resource scheduling device provided by the embodiment of the present application includes a memory for storing computer program instructions and a processor for executing the computer program instructions, wherein when the computer program instructions are executed by the processor, the device is triggered to implement the method and/or technical solution of the foregoing embodiments of the present application.
In particular, the methods and/or embodiments in the embodiments of the present application may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer-readable medium, the computer program comprising program code for performing the method illustrated by the flow chart. The computer program, when executed by a processing unit, performs the above-described functions defined in the method of the present application.
It should be noted that the computer readable medium described herein can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this application, a computer readable medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
In this application, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present application may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart or block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
As another aspect, the present application also provides a computer-readable medium, which may be contained in the apparatus described in the above embodiments; or may be separate and not assembled into the device. The computer-readable medium carries one or more computer program instructions that are executable by a processor to implement the methods and/or aspects of the embodiments of the present application described above.
It should be noted that the present application may be implemented in software and/or a combination of software and hardware, for example, implemented using Application Specific Integrated Circuits (ASICs), general purpose computers or any other similar hardware devices. In some embodiments, the software programs of the present application may be executed by a processor to implement the above steps or functions. As such, the software programs (including associated data structures) of the present application can be stored in a computer readable recording medium, such as RAM memory, magnetic or optical drive or diskette and the like. Further, some of the steps or functions of the present application may be implemented in hardware, for example, as circuitry that cooperates with the processor to perform various steps or functions.
It will be evident to those skilled in the art that the present application is not limited to the details of the foregoing illustrative embodiments, and that the present application may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the application being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference sign in a claim should not be construed as limiting the claim concerned. Furthermore, it is obvious that the word "comprising" does not exclude other elements or steps, and the singular does not exclude the plural. A plurality of units or means recited in the apparatus claims may also be implemented by one unit or means in software or hardware. The terms first, second, etc. are used to denote names, but not to denote any particular order. The numerical sequence of the sequence numbers corresponding to the steps does not indicate any specific execution sequence, and the steps can be executed in any sequence combination on the premise of conforming to the execution logic.
Claims (10)
1. A method for scheduling resources, the method comprising:
configuring a test node as an automatic node, a manual node or a tide node, wherein the automatic node is used for executing an automatic test task, the manual node is used for executing a manual test task, and the tide node is used for executing the automatic test task in a first time interval and executing the manual test task in a second time interval;
acquiring task parameters of a test task submitted by a user, and distributing the test task to a corresponding test node according to the task parameters so that the test node executes the distributed test task;
clearing the test tasks on the tide nodes when preset conditions are met.
2. The method of claim 1, wherein configuring the test nodes as automatic nodes, manual nodes, or tidal nodes comprises:
adding a type label to a test node according to a preset configuration rule, and distributing the test node to an automatic test resource pool, a manual test resource pool or a tide resource pool according to the type label, wherein the test node in the automatic test resource pool is an automatic node, the test node in the manual test resource pool is an artificial node, and the test node in the tide resource pool is a tide node.
3. The method of claim 1, wherein distributing the test tasks to corresponding test nodes according to the task parameters to enable the test nodes to execute the distributed test tasks comprises:
determining the type of test nodes suitable for executing the test task according to the task parameters, and selecting a preset number of test nodes from the type of test nodes;
and distributing the test task to the selected test node so that the test node executes the distributed test task.
4. The method of claim 3, wherein the task parameters include at least a type tag;
determining the type of the test node suitable for executing the test task according to the task parameters, wherein the determination comprises the following steps:
and matching the label in the task parameter with the type label of the test node, and determining the type of the test node suitable for executing the test task.
5. The method of claim 1, wherein obtaining task parameters of a test task submitted by a user, and distributing the test task to a corresponding test node according to the task parameters, so that the test node executes the distributed test task, comprises:
and acquiring task parameters of a test task submitted by a user by a scheduler, and distributing the test task to a corresponding test node according to the task parameters so as to enable the test node to execute the distributed test task.
6. The method of claim 1, wherein clearing test tasks on the tidal node when preset conditions are met comprises:
cleaning the test tasks on the tidal node at the beginning of the first time interval and/or the second time interval.
7. The method of claim 1, wherein clearing test tasks on the tidal node when preset conditions are met comprises:
and clearing the test tasks on the tide nodes by a service or daemon when preset conditions are met.
8. The method of claim 1, further comprising:
monitoring the load condition of each type of test node;
when the load of one type of test nodes exceeds a threshold value, determining the type of test nodes as high-load type test nodes, and configuring part of test nodes in an idle state in other types as the high-load type test nodes.
9. A resource scheduling apparatus comprising a memory for storing computer program instructions and a processor for executing the computer program instructions, wherein the computer program instructions, when executed by the processor, trigger the apparatus to perform the method of any of claims 1 to 8.
10. A computer readable medium having stored thereon computer program instructions executable by a processor to implement the method of any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210681196.XA CN115098252A (en) | 2022-06-16 | 2022-06-16 | Resource scheduling method, device and computer readable medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210681196.XA CN115098252A (en) | 2022-06-16 | 2022-06-16 | Resource scheduling method, device and computer readable medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115098252A true CN115098252A (en) | 2022-09-23 |
Family
ID=83291480
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210681196.XA Pending CN115098252A (en) | 2022-06-16 | 2022-06-16 | Resource scheduling method, device and computer readable medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115098252A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115604261A (en) * | 2022-09-27 | 2023-01-13 | 中国联合网络通信集团有限公司（Cn） | Cloud network service resource processing method, device, equipment and storage medium |
-
2022
- 2022-06-16 CN CN202210681196.XA patent/CN115098252A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115604261A (en) * | 2022-09-27 | 2023-01-13 | 中国联合网络通信集团有限公司（Cn） | Cloud network service resource processing method, device, equipment and storage medium |
| CN115604261B (en) * | 2022-09-27 | 2024-04-30 | 中国联合网络通信集团有限公司 | Cloud network service resource processing method, device, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10452438B2 (en) | Parameter selection for optimization of task execution based on execution history for prior tasks | |
| CN107567696B (en) | Automatic expansion of a group of resource instances within a computing cluster | |
| CN107968810B (en) | Resource scheduling method, device and system for server cluster | |
| US9479382B1 (en) | Execution plan generation and scheduling for network-accessible resources | |
| US20140297868A1 (en) | Burst capacity for user-defined pools | |
| US20220276904A1 (en) | Job execution with managed compute environments | |
| US20080263553A1 (en) | Dynamic Service Level Manager for Image Pools | |
| US10013264B2 (en) | Affinity of virtual processor dispatching | |
| CN110008018A (en) | A kind of batch tasks processing method, device and equipment | |
| CN106776395B (en) | A kind of method for scheduling task and device of shared cluster | |
| US10877796B1 (en) | Job execution with scheduled reserved compute instances | |
| US20170178041A1 (en) | Completion contracts | |
| CN111078404B (en) | Computing resource determining method and device, electronic equipment and medium | |
| CN105022668B (en) | Job scheduling method and system | |
| CN111104227A (en) | Resource control method and device of K8s platform and related components | |
| CN107430526B (en) | Method and node for scheduling data processing | |
| CN104301257A (en) | Resource distribution method, device and equipment | |
| CN112860387A (en) | Distributed task scheduling method and device, computer equipment and storage medium | |
| CN113886069A (en) | Resource allocation method and device, electronic equipment and storage medium | |
| CN115098252A (en) | Resource scheduling method, device and computer readable medium | |
| CN116483546B (en) | Distributed training task scheduling method, device, equipment and storage medium | |
| CN104679575A (en) | Control system and control method for input and output flow | |
| CN110188258B (en) | Method and device for acquiring external data by using crawler | |
| US10230664B1 (en) | Strategic resource allocation in a web-based computing system | |
| US20200241911A1 (en) | Automatically freeing up virtual machine resources based on virtual machine tagging |
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 |