CN113986097B - Task scheduling method and device and electronic equipment - Google Patents
Task scheduling method and device and electronic equipment Download PDFInfo
- Publication number
- CN113986097B CN113986097B CN202111219017.2A CN202111219017A CN113986097B CN 113986097 B CN113986097 B CN 113986097B CN 202111219017 A CN202111219017 A CN 202111219017A CN 113986097 B CN113986097 B CN 113986097B
- Authority
- CN
- China
- Prior art keywords
- task
- target
- pool
- task pool
- tasks
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 44
- 230000004044 response Effects 0.000 claims description 23
- 238000000605 extraction Methods 0.000 claims description 20
- 238000012163 sequencing technique Methods 0.000 claims description 11
- 238000005516 engineering process Methods 0.000 claims description 7
- 238000010276 construction Methods 0.000 claims description 3
- 230000000903 blocking effect Effects 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 10
- 238000004590 computer program Methods 0.000 description 4
- 238000012986 modification Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 3
- 230000003252 repetitive effect Effects 0.000 description 3
- 239000013307 optical fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 238000007619 statistical method Methods 0.000 description 2
- 238000007792 addition Methods 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000004883 computer application Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
- G06F3/048—Interaction techniques based on graphical user interfaces [GUI]
- G06F3/0484—Interaction techniques based on graphical user interfaces [GUI] for the control of specific functions or operations, e.g. selecting or manipulating an object, an image or a displayed text element, setting a parameter value or selecting a range
- G06F3/04845—Interaction techniques based on graphical user interfaces [GUI] for the control of specific functions or operations, e.g. selecting or manipulating an object, an image or a displayed text element, setting a parameter value or selecting a range for image manipulation, e.g. dragging, rotation, expansion or change of colour
-
- 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
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Human Computer Interaction (AREA)
- Telephonic Communication Services (AREA)
Abstract
The invention provides a task scheduling method, a task scheduling device and electronic equipment, and relates to the technical field of computers, wherein the task scheduling method comprises the steps of constructing a primary task pool and a secondary task pool; receiving a reservation execution request of a task, and placing the task into a secondary task pool; polling whether a first target task exists in the secondary task pool according to a first preset time; when the first target tasks exist in the secondary task pool, a first preset number of the first target tasks are taken out of the secondary task pool and put into the tail of a primary task pool; polling whether a second target task exists in the main task pool according to a second preset time; when the second target tasks exist in the main task pool, giving priority to the second target tasks with a second preset number in the main task pool. The method and the device effectively solve the problem of system blocking caused by concurrent execution of multiple tasks and the problem of priority when the multiple tasks are reserved and the application is reserved concurrently.
Description
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a task scheduling method, a task scheduling device, and an electronic device.
Background
The screen capturing is a way of capturing pictures or words and is also a computer application technology. The screen capturing method is characterized in that the screen capturing method comprises the steps of screen capturing by a mobile phone and screen capturing by a computer, and the two operation methods are different. The technology can intercept and download the interested article pictures from the internet for viewing, and can help people to understand the use knowledge better.
In the present scientific internet era, many people still do repetitive work, and the repetitive work takes a lot of time, such as: repeated screen capturing work is required to be carried out on a website when legal complaints collect evidence, and particularly when a case system is huge, the consumed time is long.
Therefore, a task scheduling method, device and electronic equipment are required to be provided.
Disclosure of Invention
The specification provides a task scheduling method, a task scheduling device and electronic equipment, which effectively solve the problem of system blocking caused by concurrent execution of multiple tasks and effectively solve the problem of priority when the concurrent reservation application of the multiple tasks is reserved.
The specification provides a method for task scheduling, which comprises the following steps:
constructing a primary task pool and a secondary task pool;
Receiving a reservation execution request of a task, and placing the task into a secondary task pool;
polling whether a first target task exists in the secondary task pool according to a first preset time, wherein the first target task comprises the task meeting the first preset condition in the secondary task pool;
when the first target tasks exist in the secondary task pool, a first preset number of the first target tasks are taken out of the secondary task pool and put into the tail of a primary task pool;
polling whether a second target task exists in the main task pool according to a second preset time, wherein the second target task comprises the first target task meeting the second preset condition in the main task pool;
when the second target tasks exist in the main task pool, giving priority to the second target tasks with a second preset number in the main task pool.
Optionally, the receiving a reservation execution request of a task, placing the task into a secondary task pool, includes:
receiving a reservation execution request of the task;
ordering the tasks based on reservation information of the tasks in the secondary task pool, and determining the positions of the tasks in the secondary task pool;
And placing the task in a corresponding position in the secondary task pool.
Optionally, the method further comprises:
receiving an execution request of a burst task, and putting the burst task into a main task pool;
polling whether the second target task exists in the main task pool according to the second preset time, wherein the second target task further comprises the burst task meeting the second preset condition in the main task pool;
when the second target tasks exist in the main task pool, giving priority to the second target tasks with a second preset number in the main task pool.
Optionally, the receiving the request for executing the burst task and placing the burst task into a main task pool includes:
receiving an execution request of the burst task;
sequencing the burst tasks based on reservation information of the first target task in the main task pool, and determining the position of the burst tasks in the main task pool;
and placing the burst task in a corresponding position in the main task pool.
Optionally, when the second target task exists in the main task pool, giving priority to a second preset number of second target tasks in the main task pool, including:
When the second target task exists in the main task pool, judging whether the priority is overdrinkage or not;
when the priority is not overdrinked, acquiring the number of seats to be played of the priority, and judging whether the second preset number exceeds the number of seats to be played;
when the second preset number does not exceed the number of seats to be sent, giving priority to the second target tasks with the second preset number in the main task pool;
when the second preset number exceeds the number of the seats to be sent, the second preset number is adjusted to be the same as the number of the seats to be sent, and the second target task priority with the adjusted second preset number in the main task pool is given.
Optionally, when the first target task exists in the secondary task pool, the step of taking out a first preset number of the first target tasks from the secondary task pool and placing the first target tasks at the end of the primary task pool includes:
when the first target task exists in the secondary task pool, judging whether a space exists in the primary task pool;
when the space exists in the main task pool, the first target tasks with the first preset number are taken out of the secondary task pool and put into the tail of the main task pool;
When the main task pool does not have space, judging whether a removable task exists in the main task pool or not;
and when the removable tasks exist in the main task pool, removing the removable tasks from the main task pool, taking out the first target tasks with the first preset number from the secondary task pool, and placing the first target tasks with the first preset number at the tail of the main task pool.
Optionally, the determining whether a removable task exists in the main task pool includes:
sending a response request to the first target task and/or the burst task in the main task pool;
the first target task and/or the burst task do not respond to the response request within a third preset time, and the task can be removed by judging that the first target task and/or the burst task do not respond to the response request;
or;
and the first target task and/or the burst task cancel the reservation execution request, and then the first target task and/or the burst task which cancel the reservation execution request are judged to be removable.
The present specification also provides a task scheduling apparatus, including:
the construction module is used for constructing a primary task pool and a secondary task pool;
The first receiving module is used for receiving a reservation execution request of a task and placing the task into a secondary task pool;
the first polling module is used for polling whether a first target task exists in the secondary task pool according to a first preset time, wherein the first target task comprises the task meeting the first preset condition in the secondary task pool;
the first extraction module is used for taking out a first preset number of first target tasks from the secondary task pool and putting the first target tasks into the tail of the primary task pool when the first target tasks exist in the secondary task pool;
the second polling module is used for polling whether a second target task exists in the main task pool according to a second preset time, wherein the second target task comprises the first target task meeting the second preset condition in the main task pool;
and the second extraction module is used for giving priority to a second target task with a second preset number in the main task pool when the second target task exists in the main task pool.
Optionally, the first receiving module includes:
the first receiving unit is used for receiving a reservation execution request of the task;
the first ordering unit is used for ordering the tasks based on reservation information of the tasks in the secondary task pool and determining the positions of the tasks in the secondary task pool;
And the first placing unit is used for placing the task in a corresponding position in the secondary task pool.
Optionally, the apparatus further includes:
the second receiving module is used for receiving the execution request of the burst task and putting the burst task into the main task pool;
the third polling module is used for polling whether the second target task exists in the main task pool according to the second preset time, and the second target task further comprises the burst task meeting the second preset condition in the main task pool;
and the third extraction module is used for giving priority to a second target task with a second preset number in the main task pool when the second target task exists in the main task pool.
Optionally, the second receiving module includes:
the second receiving unit is used for receiving the execution request of the burst task;
the second sequencing unit is used for sequencing the burst tasks based on the reservation information of the first target task in the main task pool and determining the position of the burst tasks in the main task pool;
and the second placing unit is used for placing the burst task in a corresponding position in the main task pool.
Optionally, the third extraction module includes:
The first judging unit is used for judging whether the priority is overdrinkage issued or not when the second target task exists in the main task pool;
the second judging unit is used for acquiring the number of seats to be released of the priority when the priority is not excessively released, and judging whether the second preset number exceeds the number of seats to be released;
the first sending unit is used for giving priority to the second target tasks with the second preset number in the main task pool when the second preset number does not exceed the number of seats to be sent;
the second issuing unit is used for adjusting the second preset number to be the same as the number of the seats to be issued when the second preset number exceeds the number of the seats to be issued, and giving priority to the second target tasks of the second preset number after adjustment in the main task pool.
Optionally, the first extraction module includes:
a third judging unit, configured to judge whether a space exists in the primary task pool when the first target task exists in the secondary task pool;
the first extraction unit is used for taking out the first target tasks with the first preset number from the secondary task pool and putting the first target tasks with the first preset number into the tail of the primary task pool when the space exists in the primary task pool;
A fourth judging unit, configured to judge whether a removable task exists in the main task pool when there is no space in the main task pool;
and the second extraction unit is used for removing the removable task from the main task pool when the removable task exists in the main task pool, taking out the first target tasks with the first preset number from the secondary task pool and placing the first target tasks at the tail of the main task pool.
Optionally, the fourth judging unit includes:
sending a response request to the first target task and/or the burst task in the main task pool;
the first target task and/or the burst task do not respond to the response request within a third preset time, and the task can be removed by judging that the first target task and/or the burst task do not respond to the response request;
or;
and the first target task and/or the burst task cancel the reservation execution request, and then the first target task and/or the burst task which cancel the reservation execution request are judged to be removable.
The specification also provides an electronic device, wherein the electronic device includes:
a processor; the method comprises the steps of,
A memory storing computer executable instructions that, when executed, cause the processor to perform any of the methods described above.
The present specification also provides a computer readable storage medium storing one or more programs which when executed by a processor implement any of the methods described above.
In the invention, a primary task pool and a secondary task pool are constructed; receiving a reservation execution request of a task, and placing the task into a secondary task pool; polling whether a first target task exists in a secondary task pool according to a first preset time, wherein the first target task comprises a task meeting a first preset condition in the secondary task pool; when a first target task exists in the secondary task pool, a first preset number of first target tasks are taken out of the secondary task pool and put into the tail of the primary task pool; polling whether a second target task exists in the main task pool according to a second preset time, wherein the second target task comprises a first target task meeting a second preset condition in the main task pool; and giving priority to a second target task with a second preset number in the main task pool when the second target task exists in the main task pool. The invention effectively solves the problem of system blocking caused by concurrent execution of multiple tasks and the problem of priority when the multiple tasks are reserved and the application is reserved concurrently.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic diagram of a task scheduling method according to an embodiment of the present disclosure;
fig. 2 is a schematic structural diagram of an apparatus for task scheduling according to an embodiment of the present disclosure;
fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure;
fig. 4 is a schematic diagram of a computer readable medium according to an embodiment of the present disclosure.
Detailed Description
The following description is presented to enable one of ordinary skill in the art to make and use the invention. The preferred embodiments in the following description are by way of example only and other obvious variations will occur to those skilled in the art. The basic principles of the invention defined in the following description may be applied to other embodiments, variations, modifications, equivalents, and other technical solutions without departing from the spirit and scope of the invention.
Exemplary embodiments of the present invention are described more fully below in connection with fig. 1-4. However, the exemplary embodiments can be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Rather, these exemplary embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of the invention to those skilled in the art. The same reference numerals in the drawings denote the same or similar elements, components or portions, and thus a repetitive description thereof will be omitted.
The features, structures, characteristics or other details described in a particular embodiment do not exclude that may be combined in one or more other embodiments in a suitable manner, without departing from the technical idea of the invention.
In the description of specific embodiments, features, structures, characteristics, or other details described in the present invention are provided to enable one skilled in the art to fully understand the embodiments. However, it is not excluded that one skilled in the art may practice the present invention without one or more of the specific features, structures, characteristics, or other details.
The flow diagrams depicted in the figures are exemplary only, and do not necessarily include all of the elements and operations/steps, nor must they be performed in the order described. For example, some operations/steps may be decomposed, and some operations/steps may be combined or partially combined, so that the order of actual execution may be changed according to actual situations.
The block diagrams depicted in the figures are merely functional entities and do not necessarily correspond to physically separate entities. That is, the functional entities may be implemented in software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.
The term "and/or" and/or "includes all combinations of any one or more of the associated listed items.
Fig. 1 is a schematic diagram of a method for automatically upgrading a blockchain according to an embodiment of the present disclosure, where the method may include:
s101: constructing a primary task pool and a secondary task pool;
in the specific embodiment of the specification, the task scheduling method is applied to a task scheduling system, wherein the task scheduling system comprises a Redis server and a plurality of task pools, and the plurality of task pools comprise a main task pool and a secondary task pool. Redis is an open source log-type Key-Value database which is written and supported by ANSI C language, can be based on memory and can be durable, is in a single-threaded mode, and can change concurrent access into serial access by adopting a queue mode by utilizing a Redis technology, thereby eliminating the overhead of the serial control of the traditional database. The task scheduling system is constructed by the Redis technology, so that distributed online queuing can be realized, and the application scene of online queuing with high flow, high concurrency and high performance can be supported.
S102: receiving a reservation execution request of a task, and placing the task into a secondary task pool;
optionally, the receiving a reservation execution request of a task, placing the task into a secondary task pool, includes:
receiving a reservation execution request of the task;
ordering the tasks based on reservation information of the tasks in the secondary task pool, and determining the positions of the tasks in the secondary task pool;
and placing the task in a corresponding position in the secondary task pool.
In the specific embodiment of the specification, when receiving the reservation execution request of the task, the Redis server can acquire task information and reservation information according to the reservation execution request, wherein the reservation information comprises reservation execution time. Queuing the tasks through reserved execution time of the tasks in the secondary task pool, determining the positions of the tasks in the secondary task pool, and placing the tasks in the corresponding positions in the secondary task pool. Such as: in the secondary task pool, the reserved execution time of the task A is 10:00, the reserved execution time of the task B is 10:10, the reserved execution time of the received task C is 10:05, the reserved execution time is compared, the 10:05 is determined to be between 10:00 and 10:10, and the task C is determined to be placed between the task A and the task B in the secondary task pool. The position of the task in the secondary task pool can be accurately positioned through sequencing, and the task processing efficiency and the task processing accuracy are improved.
S103: polling whether a first target task exists in the secondary task pool according to a first preset time, wherein the first target task comprises the task meeting the first preset condition in the secondary task pool;
s104: when the first target tasks exist in the secondary task pool, a first preset number of the first target tasks are taken out of the secondary task pool and put into the tail of a primary task pool;
in the specific embodiment of the present disclosure, the first preset time is set according to an actual requirement, or may be an empirical value, or may be a result obtained by statistical analysis. The first preset condition may be to determine whether the reserved execution time of the task is within a preset time of the current time, and the preset time of the first preset condition may be valued according to the first preset time. The method comprises the following steps: the optimal value of the first preset time is obtained through statistics to be 30 minutes, the judgment task is executed every 30 minutes, the current time is 10:00, whether the task with the reserved execution time of 10:00-10:30 exists in the secondary task pool or not is judged, namely the reserved execution time of the task D is 10:20, the task D meets the first preset condition, and the first target task exists in the secondary task pool.
When the first target tasks exist in the secondary task pool, all the first target tasks meeting the first preset conditions are taken out, or a first preset number of first target tasks are taken out according to the capacity of the primary task pool, and the taken out first target tasks are put into the tail end of the primary task pool. Through the step, the first preset condition can be set according to actual requirements, and the task processing efficiency is improved.
S105: polling whether a second target task exists in the main task pool according to a second preset time, wherein the second target task comprises the first target task meeting the second preset condition in the main task pool;
s106: when the second target tasks exist in the main task pool, giving priority to the second target tasks with a second preset number in the main task pool.
In the specific embodiment of the present disclosure, the second preset time is set according to an actual requirement, or may be an empirical value, or may be a result obtained by statistical analysis. The second preset condition may be to determine whether the reserved execution time of the first target task is within the preset time of the current time, and the preset time of the second preset condition may be valued according to the second preset time. The method comprises the following steps: the optimal value of the second preset time is 1 minute through statistics, the judgment task is executed once every 1 minute, the current time is 10:00, whether the task with the reserved execution time of 10:00-10:01 exists in the secondary task pool or not is judged, namely the reserved execution time of the task E is 10:01, the task E meets the second preset condition, and the second target task exists in the primary task pool.
When second target tasks exist in the main task pool, taking out all the second target tasks meeting second preset conditions, or taking out a second preset number of second target tasks according to the capacity of the priority position, and placing the taken out second target tasks in the priority position. Through the step, the second preset condition can be set according to the actual requirement, and the task processing efficiency is improved.
Optionally, the method further comprises:
receiving an execution request of a burst task, and putting the burst task into a main task pool;
polling whether the second target task exists in the main task pool according to the second preset time, wherein the second target task further comprises the burst task meeting the second preset condition in the main task pool;
when the second target tasks exist in the main task pool, giving priority to the second target tasks with a second preset number in the main task pool.
Optionally, the receiving the request for executing the burst task and placing the burst task into a main task pool includes:
receiving an execution request of the burst task;
sequencing the burst tasks based on reservation information of the first target task in the main task pool, and determining the position of the burst tasks in the main task pool;
And placing the burst task in a corresponding position in the main task pool.
In the specific embodiment of the specification, an execution request of a queue inserting task is received, burst tasks are ordered according to reserved execution time of a first target task in a main task pool, the position where the burst tasks should be placed in the main task pool is determined, and the burst tasks are placed in the correct positions. Such as: the reserved execution time of the task F in the main task pool is 10:50, and the reserved execution time of the task G is 11:05, the reserved execution time of the task H is 11:10, the execution request time of the burst task I is 11:00, it can be determined that the burst task I should be placed between the task F and the task G. The position of the task in the secondary task pool can be accurately positioned through sequencing, and the task processing efficiency and the task processing accuracy are improved.
The second preset condition may be to determine whether the reserved execution time of the burst task is within a preset time of the current time. The method comprises the following steps: the optimal value of the second preset time is 1 minute through statistics, the judging task is executed once every 1 minute, the current time is 11:01, whether the task with reserved execution time of 11:01-10:02 exists in the secondary task pool or not is judged, namely the execution request time of the burst task I is 11:02, the burst task I meets the second preset condition, and the second target task exists in the primary task pool.
When second target tasks exist in the main task pool, taking out all the second target tasks meeting second preset conditions, or taking out a second preset number of second target tasks according to the capacity of the priority position, and placing the taken out second target tasks in the priority position. Through the step, the second preset condition can be set according to the actual requirement, and the task processing efficiency is improved.
Optionally, when the second target task exists in the main task pool, giving priority to a second preset number of second target tasks in the main task pool, including:
when the second target task exists in the main task pool, judging whether the priority is overdrinkage or not;
when the priority is not overdrinked, acquiring the number of seats to be played of the priority, and judging whether the second preset number exceeds the number of seats to be played;
when the second preset number does not exceed the number of seats to be sent, giving priority to the second target tasks with the second preset number in the main task pool;
when the second preset number exceeds the number of the seats to be sent, the second preset number is adjusted to be the same as the number of the seats to be sent, and the second target task priority with the adjusted second preset number in the main task pool is given.
In the specific embodiment of the specification, when a second target task exists in the main task pool, judging whether the priority is overdrinked or not; when the priority is not overdue issued, acquiring the number of seats to be issued of the priority, and judging whether the second preset number exceeds the number of seats to be issued; when the second preset number does not exceed the number of seats to be issued, giving priority to a second target task of the second preset number in the main task pool; when the second preset number exceeds the number of the seats to be released, the second preset number is adjusted to be the same as the number of the seats to be released, and the second target task priority of the adjusted second preset number in the main task pool is given. For example: the number of the priority positions is 10, when the number of the tasks with the priority at present is 8, the priority is not excessively issued, the number of seats to be issued with the priority is 2, whether the second preset number exceeds 2, when the second preset number is 1 or 2, the priority of 1 or 2 second target tasks is directly given, and when the second preset number is 3, the priority of 2 second target tasks is given by adjusting the second preset number to 2.
Optionally, when the first target task exists in the secondary task pool, the step of taking out a first preset number of the first target tasks from the secondary task pool and placing the first target tasks at the end of the primary task pool includes:
When the first target task exists in the secondary task pool, judging whether a space exists in the primary task pool;
when the space exists in the main task pool, the first target tasks with the first preset number are taken out of the secondary task pool and put into the tail of the main task pool;
when the main task pool does not have space, judging whether a removable task exists in the main task pool or not;
and when the removable tasks exist in the main task pool, removing the removable tasks from the main task pool, taking out the first target tasks with the first preset number from the secondary task pool, and placing the first target tasks with the first preset number at the tail of the main task pool.
Optionally, the determining whether a removable task exists in the main task pool includes:
sending a response request to the first target task and/or the burst task in the main task pool;
the first target task and/or the burst task do not respond to the response request within a third preset time, and the task can be removed by judging that the first target task and/or the burst task do not respond to the response request;
or;
and the first target task and/or the burst task cancel the reservation execution request, and then the first target task and/or the burst task which cancel the reservation execution request are judged to be removable.
In the specific implementation manner of the specification, when a first target task exists in the secondary task pool, judging whether a space exists in the primary task pool or not when the first target task exists in the secondary task pool; when the space exists in the main task pool, a first target task with a first preset number is taken out from the secondary task pool and put into the tail of the main task pool; when the main task pool does not have space, judging whether a removable task exists in the main task pool or not; sending a response request to a first target task and/or a burst task in the main task pool; if the first target task and/or the burst task do not respond to the response request within the third preset time, judging that the first target task and/or the burst task which do not respond to the response request can remove the task; or; and the first target task and/or the burst task cancel the reservation execution request, and the first target task and/or the burst task which cancel the reservation execution request is judged to be the removable task. When the removable task exists in the main task pool, the removable task is removed from the main task pool, a first preset number of first target tasks are taken out of the secondary task pool and put into the tail of the main task pool. For example: the capacity of the main task is 30, the current task number in the main task pool is 20, 10 task spaces exist in the main task pool, and no more than 10 first target tasks are taken out of the secondary task pool and put into the main task pool. When the number of the current tasks in the main task pool is 30, the main task pool does not have task space, a response request is sent to the first target tasks and/or burst tasks in the main task pool, 7 first target tasks and/or burst tasks do not respond to the response request within 10 minutes, and the 7 first target tasks and/or burst tasks are not ready for task execution, namely the removable tasks, and the unresponsive 7 first target tasks and/or burst tasks can be directly put into the secondary task pool or directly moved out of the whole task scheduling system. Or the 7 first target tasks and/or the burst tasks actively cancel the reservation execution request, and the 7 cancelled first target tasks and/or burst tasks are moved out of the whole task scheduling system. At this time, the primary task pool is cleaned up of 7 task spaces, and no more than 7 first target tasks are taken out of the secondary task pool and put into the primary task pool. This step improves the efficiency of the system and the utilization of resources.
In this embodiment, a task scheduling device is provided, fig. 3 is a schematic structural diagram of a task scheduling method according to an embodiment of the present invention, and as shown in fig. 3, the process includes the following steps:
a construction module 201, configured to construct a primary task pool and a secondary task pool;
a first receiving module 202, configured to receive a reservation execution request of a task, and put the task into a secondary task pool;
a first polling module 203, configured to poll, according to a first preset time, whether a first target task exists in the secondary task pool, where the first target task includes the task in the secondary task pool that meets the first preset condition;
a first extracting module 204, configured to, when the first target task exists in the secondary task pool, take a first preset number of the first target tasks out of the secondary task pool and put the first target tasks into the end of the primary task pool;
a second polling module 205, configured to poll, according to a second preset time, whether a second target task exists in the main task pool, where the second target task includes the first target task in the main task pool that meets the second preset condition;
a second extraction module 206, configured to give priority to a second preset number of second target tasks in the main task pool when the second target tasks exist in the main task pool.
Optionally, the first receiving module includes:
the first receiving unit is used for receiving a reservation execution request of the task;
the first ordering unit is used for ordering the tasks based on reservation information of the tasks in the secondary task pool and determining the positions of the tasks in the secondary task pool;
and the first placing unit is used for placing the task in a corresponding position in the secondary task pool.
Optionally, the apparatus further includes:
the second receiving module is used for receiving the execution request of the burst task and putting the burst task into the main task pool;
the third polling module is used for polling whether the second target task exists in the main task pool according to the second preset time, and the second target task further comprises the burst task meeting the second preset condition in the main task pool;
and the third extraction module is used for giving priority to a second target task with a second preset number in the main task pool when the second target task exists in the main task pool.
Optionally, the second receiving module includes:
the second receiving unit is used for receiving the execution request of the burst task;
The second sequencing unit is used for sequencing the burst tasks based on the reservation information of the first target task in the main task pool and determining the position of the burst tasks in the main task pool;
and the second placing unit is used for placing the burst task in a corresponding position in the main task pool.
Optionally, the third extraction module includes:
the first judging unit is used for judging whether the priority is overdrinkage issued or not when the second target task exists in the main task pool;
the second judging unit is used for acquiring the number of seats to be released of the priority when the priority is not excessively released, and judging whether the second preset number exceeds the number of seats to be released;
the first sending unit is used for giving priority to the second target tasks with the second preset number in the main task pool when the second preset number does not exceed the number of seats to be sent;
the second issuing unit is used for adjusting the second preset number to be the same as the number of the seats to be issued when the second preset number exceeds the number of the seats to be issued, and giving priority to the second target tasks of the second preset number after adjustment in the main task pool.
Optionally, the first extraction module includes:
a third judging unit, configured to judge whether a space exists in the primary task pool when the first target task exists in the secondary task pool;
the first extraction unit is used for taking out the first target tasks with the first preset number from the secondary task pool and putting the first target tasks with the first preset number into the tail of the primary task pool when the space exists in the primary task pool;
a fourth judging unit, configured to judge whether a removable task exists in the main task pool when there is no space in the main task pool;
and the second extraction unit is used for removing the removable task from the main task pool when the removable task exists in the main task pool, taking out the first target tasks with the first preset number from the secondary task pool and placing the first target tasks at the tail of the main task pool.
Optionally, the fourth judging unit includes:
sending a response request to the first target task and/or the burst task in the main task pool;
the first target task and/or the burst task do not respond to the response request within a third preset time, and the task can be removed by judging that the first target task and/or the burst task do not respond to the response request;
Or;
and the first target task and/or the burst task cancel the reservation execution request, and then the first target task and/or the burst task which cancel the reservation execution request are judged to be removable.
The functions of the apparatus according to the embodiments of the present invention have been described in the foregoing method embodiments, so that the descriptions of the embodiments are not exhaustive, and reference may be made to the related descriptions in the foregoing embodiments, which are not repeated herein.
Based on the same inventive concept, the embodiments of the present specification also provide an electronic device.
The following describes an embodiment of an electronic device according to the present invention, which may be regarded as a specific physical implementation of the above-described embodiment of the method and apparatus according to the present invention. Details described in relation to the embodiments of the electronic device of the present invention should be considered as additions to the embodiments of the method or apparatus described above; for details not disclosed in the embodiments of the electronic device of the present invention, reference may be made to the above-described method or apparatus embodiments.
Fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure. An electronic device 300 according to this embodiment of the present invention is described below with reference to fig. 3. The electronic device 300 shown in fig. 3 is merely an example and should not be construed as limiting the functionality and scope of use of embodiments of the present invention.
As shown in fig. 3, the electronic device 300 is embodied in the form of a general purpose computing device. Components of electronic device 300 may include, but are not limited to: at least one processing unit 310, at least one memory unit 320, a bus 330 connecting the different system components (including the memory unit 320 and the processing unit 310), a display unit 340, and the like.
Wherein the storage unit stores program code that is executable by the processing unit 310 such that the processing unit 310 performs the steps according to various exemplary embodiments of the invention described in the above processing method section of the present specification. For example, the processing unit 310 may perform the steps shown in fig. 1.
The memory unit 320 may include readable media in the form of volatile memory units, such as Random Access Memory (RAM) 3201 and/or cache memory 3202, and may further include Read Only Memory (ROM) 3203.
The storage unit 320 may also include a program/utility 3204 having a set (at least one) of program modules 3205, such program modules 3205 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each or some combination of which may include an implementation of a network environment.
Bus 330 may be one or more of several types of bus structures including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.
The electronic device 300 may also communicate with one or more external devices 400 (e.g., keyboard, pointing device, bluetooth device, etc.), one or more devices that enable a user to interact with the electronic device 300, and/or any device (e.g., router, modem, etc.) that enables the electronic device 300 to communicate with one or more other computing devices. Such communication may occur through an input/output (I/O) interface 350. Also, electronic device 300 may communicate with one or more networks such as a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the Internet, through network adapter 360. The network adapter 360 may communicate with other modules of the electronic device 300 via the bus 330. It should be appreciated that although not shown in fig. 3, other hardware and/or software modules may be used in connection with electronic device 300, including, but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, data backup storage systems, and the like.
From the above description of embodiments, those skilled in the art will readily appreciate that the exemplary embodiments described herein may be implemented in software, or may be implemented in software in combination with necessary hardware. Thus, the technical solution according to the embodiments of the present invention may be embodied in the form of a software product, which may be stored in a computer readable storage medium (may be a CD-ROM, a usb disk, a mobile hard disk, etc.) or on a network, and includes several instructions to cause a computing device (may be a personal computer, a server, or a network device, etc.) to perform the above-mentioned method according to the present invention. The computer program, when executed by a data processing device, enables the computer readable medium to carry out the above-described method of the present invention, namely: such as the method shown in fig. 1.
Fig. 4 is a schematic diagram of a computer readable medium according to an embodiment of the present disclosure.
A computer program implementing the method shown in fig. 1 may be stored on one or more computer readable media. The computer readable medium may be a readable signal medium or a readable storage medium. The readable storage medium can be, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium would include the following: an electrical connection having one or more wires, a portable disk, a hard disk, random Access Memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
The computer readable storage medium may include a data signal propagated in baseband or as part of a carrier wave, with readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A readable storage medium may also be any readable medium 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 readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C++ or the like 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 computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of remote computing devices, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., connected via the Internet using an Internet service provider).
In summary, the invention may be implemented in hardware, or in software modules running on one or more processors, or in a combination thereof. Those skilled in the art will appreciate that some or all of the functionality of some or all of the components in accordance with embodiments of the present invention may be implemented in practice using a general purpose data processing device such as a microprocessor or Digital Signal Processor (DSP). The present invention can also be implemented as an apparatus or device program (e.g., a computer program and a computer program product) for performing a portion or all of the methods described herein. Such a program embodying the present invention may be stored on a computer readable medium, or may have the form of one or more signals. Such signals may be downloaded from an internet website, provided on a carrier signal, or provided in any other form.
The above-described specific embodiments further describe the objects, technical solutions and advantageous effects of the present invention in detail, and it should be understood that the present invention is not inherently related to any particular computer, virtual device or electronic apparatus, and various general-purpose devices may also implement the present invention. The foregoing description of the embodiments of the invention is not intended to be limiting, but rather is intended to cover all modifications, equivalents, alternatives, and improvements that fall within the spirit and scope of the invention.
In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments.
The foregoing is merely exemplary of the present application and is not intended to limit the present application. Various modifications and changes may be made to the present application by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc. which are within the spirit and principles of the present application are intended to be included within the scope of the claims of the present application.
Claims (14)
1. A method for task scheduling, applied to a task scheduling system, the task scheduling system constructed by the Redis technology, comprising:
constructing a primary task pool and a secondary task pool;
the Redis server receives a reservation execution request of a task and acquires reservation information according to the reservation execution request; ordering the tasks based on reservation information of the tasks in the secondary task pool, determining the positions of the tasks in the secondary task pool, and placing the tasks in the corresponding positions in the secondary task pool;
polling whether a first target task exists in the secondary task pool according to a first preset time, wherein the first target task comprises the task meeting the first preset condition in the secondary task pool;
When the first target tasks exist in the secondary task pool, a first preset number of the first target tasks are taken out of the secondary task pool and put into the tail of a primary task pool;
polling whether a second target task exists in the main task pool according to a second preset time, wherein the second target task comprises the first target task meeting the second preset condition in the main task pool;
when the second target tasks exist in the main task pool, giving priority to the second target tasks with a second preset number in the main task pool.
2. The method as recited in claim 1, further comprising:
receiving an execution request of a burst task, and putting the burst task into a main task pool;
polling whether the second target task exists in the main task pool according to the second preset time, wherein the second target task further comprises the burst task meeting the second preset condition in the main task pool;
when the second target tasks exist in the main task pool, giving priority to the second target tasks with a second preset number in the main task pool.
3. The method of claim 2, wherein the receiving the request for execution of the burst task, placing the burst task into a master task pool, comprises:
Receiving an execution request of the burst task;
sequencing the burst tasks based on reservation information of the first target task in the main task pool, and determining the position of the burst tasks in the main task pool;
and placing the burst task in a corresponding position in the main task pool.
4. The method of claim 3, wherein said prioritizing a second predetermined number of said second target tasks from said master task pool when said second target tasks are present in said master task pool comprises:
when the second target task exists in the main task pool, judging whether the priority is overdrinkage or not;
when the priority is not overdrinked, acquiring the number of seats to be played of the priority, and judging whether the second preset number exceeds the number of seats to be played;
when the second preset number does not exceed the number of seats to be sent, giving priority to the second target tasks with the second preset number in the main task pool;
when the second preset number exceeds the number of the seats to be sent, the second preset number is adjusted to be the same as the number of the seats to be sent, and the second target task priority with the adjusted second preset number in the main task pool is given.
5. The method of claim 4, wherein when the first target task exists in the secondary task pool, the step of taking a first preset number of the first target tasks from the secondary task pool to be placed at the end of the primary task pool comprises:
when the first target task exists in the secondary task pool, judging whether a space exists in the primary task pool;
when the space exists in the main task pool, the first target tasks with the first preset number are taken out of the secondary task pool and put into the tail of the main task pool;
when the main task pool does not have space, judging whether a removable task exists in the main task pool or not;
and when the removable tasks exist in the main task pool, removing the removable tasks from the main task pool, taking out the first target tasks with the first preset number from the secondary task pool, and placing the first target tasks with the first preset number at the tail of the main task pool.
6. The method of claim 5, wherein said determining whether a removable task exists in the primary task pool comprises:
sending a response request to the first target task and/or the burst task in the main task pool;
The first target task and/or the burst task do not respond to the response request within a third preset time, and the task can be removed by judging that the first target task and/or the burst task do not respond to the response request;
or;
and the first target task and/or the burst task cancel the reservation execution request, and then the first target task and/or the burst task which cancel the reservation execution request are judged to be removable.
7. A device for task scheduling, applied to a task scheduling system, the task scheduling system being constructed by the Redis technology, comprising:
the construction module is used for constructing a primary task pool and a secondary task pool;
the first receiving module is used for receiving a reservation execution request of a task by the Redis server and acquiring reservation information according to the reservation execution request; ordering the tasks based on reservation information of the tasks in the secondary task pool, determining the positions of the tasks in the secondary task pool, and placing the tasks in the corresponding positions in the secondary task pool;
the first polling module is used for polling whether a first target task exists in the secondary task pool according to a first preset time, wherein the first target task comprises the task meeting the first preset condition in the secondary task pool;
The first extraction module is used for taking out a first preset number of first target tasks from the secondary task pool and putting the first target tasks into the tail of the primary task pool when the first target tasks exist in the secondary task pool;
the second polling module is used for polling whether a second target task exists in the main task pool according to a second preset time, wherein the second target task comprises the first target task meeting the second preset condition in the main task pool;
and the second extraction module is used for giving priority to a second target task with a second preset number in the main task pool when the second target task exists in the main task pool.
8. The apparatus as recited in claim 7, further comprising:
the second receiving module is used for receiving the execution request of the burst task and putting the burst task into the main task pool;
the third polling module is used for polling whether the second target task exists in the main task pool according to the second preset time, and the second target task further comprises the burst task meeting the second preset condition in the main task pool;
and the third extraction module is used for giving priority to a second target task with a second preset number in the main task pool when the second target task exists in the main task pool.
9. The apparatus of claim 8, wherein the second receiving module comprises:
the second receiving unit is used for receiving the execution request of the burst task;
the second sequencing unit is used for sequencing the burst tasks based on the reservation information of the first target task in the main task pool and determining the position of the burst tasks in the main task pool;
and the second placing unit is used for placing the burst task in a corresponding position in the main task pool.
10. The apparatus of claim 9, wherein the third extraction module comprises:
the first judging unit is used for judging whether the priority is overdrinkage issued or not when the second target task exists in the main task pool;
the second judging unit is used for acquiring the number of seats to be released of the priority when the priority is not excessively released, and judging whether the second preset number exceeds the number of seats to be released;
the first sending unit is used for giving priority to the second target tasks with the second preset number in the main task pool when the second preset number does not exceed the number of seats to be sent;
the second issuing unit is used for adjusting the second preset number to be the same as the number of the seats to be issued when the second preset number exceeds the number of the seats to be issued, and giving priority to the second target tasks of the second preset number after adjustment in the main task pool.
11. The apparatus of claim 10, wherein the first extraction module comprises:
a third judging unit, configured to judge whether a space exists in the primary task pool when the first target task exists in the secondary task pool;
the first extraction unit is used for taking out the first target tasks with the first preset number from the secondary task pool and putting the first target tasks with the first preset number into the tail of the primary task pool when the space exists in the primary task pool;
a fourth judging unit, configured to judge whether a removable task exists in the main task pool when there is no space in the main task pool;
and the second extraction unit is used for removing the removable task from the main task pool when the removable task exists in the main task pool, taking out the first target tasks with the first preset number from the secondary task pool and placing the first target tasks at the tail of the main task pool.
12. The apparatus of claim 11, wherein the fourth determination unit comprises:
sending a response request to the first target task and/or the burst task in the main task pool;
the first target task and/or the burst task do not respond to the response request within a third preset time, and the task can be removed by judging that the first target task and/or the burst task do not respond to the response request;
Or;
and the first target task and/or the burst task cancel the reservation execution request, and then the first target task and/or the burst task which cancel the reservation execution request are judged to be removable.
13. An electronic device, wherein the electronic device comprises:
a processor; the method comprises the steps of,
a memory storing computer executable instructions that, when executed, cause the processor to perform the method of any of claims 1-6.
14. A computer readable storage medium, wherein the computer readable storage medium stores one or more programs which, when executed by a processor, implement the method of any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111219017.2A CN113986097B (en) | 2021-10-20 | 2021-10-20 | Task scheduling method and device and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111219017.2A CN113986097B (en) | 2021-10-20 | 2021-10-20 | Task scheduling method and device and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113986097A CN113986097A (en) | 2022-01-28 |
| CN113986097B true CN113986097B (en) | 2024-02-27 |
Family
ID=79739469
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111219017.2A Active CN113986097B (en) | 2021-10-20 | 2021-10-20 | Task scheduling method and device and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113986097B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114741178B (en) * | 2022-05-20 | 2022-08-23 | 北京宇信科技集团股份有限公司 | Credit application processing method and device, electronic equipment and storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105976420A (en) * | 2015-08-28 | 2016-09-28 | 深圳市彬讯科技有限公司 | Online rendering method and system |
| CN110032438A (en) * | 2019-04-24 | 2019-07-19 | 北京高途云集教育科技有限公司 | Delayed tasks execute method, apparatus and electronic equipment |
| CN111090507A (en) * | 2019-11-25 | 2020-05-01 | 南京航空航天大学 | Task scheduling method based on cloud edge fusion server network architecture and application |
| CN112685156A (en) * | 2020-12-28 | 2021-04-20 | 北京五八信息技术有限公司 | Task execution method and device, electronic equipment and computer readable medium |
| CN112817733A (en) * | 2021-02-26 | 2021-05-18 | 北京控制工程研究所 | Efficient satellite autonomous task planning task pool design method and system |
| CN112948081A (en) * | 2021-02-26 | 2021-06-11 | 北京百度网讯科技有限公司 | Method, device and equipment for processing task in delayed mode and storage medium |
| CN113377551A (en) * | 2020-03-10 | 2021-09-10 | 北京京东乾石科技有限公司 | Unmanned vehicle task allocation method and device, electronic equipment and storage medium |
-
2021
- 2021-10-20 CN CN202111219017.2A patent/CN113986097B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105976420A (en) * | 2015-08-28 | 2016-09-28 | 深圳市彬讯科技有限公司 | Online rendering method and system |
| CN110032438A (en) * | 2019-04-24 | 2019-07-19 | 北京高途云集教育科技有限公司 | Delayed tasks execute method, apparatus and electronic equipment |
| CN111090507A (en) * | 2019-11-25 | 2020-05-01 | 南京航空航天大学 | Task scheduling method based on cloud edge fusion server network architecture and application |
| CN113377551A (en) * | 2020-03-10 | 2021-09-10 | 北京京东乾石科技有限公司 | Unmanned vehicle task allocation method and device, electronic equipment and storage medium |
| CN112685156A (en) * | 2020-12-28 | 2021-04-20 | 北京五八信息技术有限公司 | Task execution method and device, electronic equipment and computer readable medium |
| CN112817733A (en) * | 2021-02-26 | 2021-05-18 | 北京控制工程研究所 | Efficient satellite autonomous task planning task pool design method and system |
| CN112948081A (en) * | 2021-02-26 | 2021-06-11 | 北京百度网讯科技有限公司 | Method, device and equipment for processing task in delayed mode and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113986097A (en) | 2022-01-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20200177673A1 (en) | Minimizing overhead of applications deployed in multi-clouds | |
| US9396028B2 (en) | Scheduling workloads and making provision decisions of computer resources in a computing environment | |
| US9584442B2 (en) | Managing a set of assets of a shared pool of configurable computing resources | |
| US11144437B2 (en) | Pre-populating continuous delivery test cases | |
| CN109901918B (en) | Method and device for processing overtime task | |
| US20150106503A1 (en) | Predictive cloud provisioning based on human behaviors and heuristics | |
| CN111950600B (en) | Method and device for predicting overdue user resource return performance and electronic equipment | |
| US8612597B2 (en) | Computing scheduling using resource lend and borrow | |
| CN113986097B (en) | Task scheduling method and device and electronic equipment | |
| CN110955640A (en) | Cross-system data file processing method, device, server and storage medium | |
| US10956133B2 (en) | Static optimization of production code for dynamic profiling | |
| US10255057B2 (en) | Locale object management | |
| US10474475B2 (en) | Non-intrusive restart of a task manager | |
| WO2020047390A1 (en) | Systems and methods for hybrid burst optimized regulated workload orchestration for infrastructure as a service | |
| CN115220908A (en) | Resource scheduling method, device, electronic equipment and storage medium | |
| CN114064403A (en) | Task delay analysis processing method and device | |
| CN115220907A (en) | Resource scheduling method and device, electronic equipment and storage medium | |
| CN117093335A (en) | Task scheduling method and device for distributed storage system | |
| CN115016890A (en) | Virtual machine resource allocation method and device, electronic equipment and storage medium | |
| CN113407331A (en) | Task processing method and device and storage medium | |
| CN106484536B (en) | IO scheduling method, device and equipment | |
| US11372692B2 (en) | Methods and systems for application program interface call management | |
| US11556425B2 (en) | Failover management for batch jobs | |
| CN111367875B (en) | Ticket file processing method, system, equipment and medium | |
| CN112764950B (en) | Event interaction method and device based on combined behaviors and electronic equipment |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |