CN111061556A - Optimization method and device for executing priority task, computer equipment and medium - Google Patents
Optimization method and device for executing priority task, computer equipment and medium Download PDFInfo
- Publication number
- CN111061556A CN111061556A CN201911365886.9A CN201911365886A CN111061556A CN 111061556 A CN111061556 A CN 111061556A CN 201911365886 A CN201911365886 A CN 201911365886A CN 111061556 A CN111061556 A CN 111061556A
- Authority
- CN
- China
- Prior art keywords
- task
- priority
- priority queue
- tasks
- module
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- 238000005457 optimization Methods 0.000 title claims abstract description 19
- 238000004590 computer program Methods 0.000 claims description 12
- 238000012544 monitoring process Methods 0.000 claims description 12
- 238000003860 storage Methods 0.000 claims description 8
- 238000012217 deletion Methods 0.000 claims 1
- 230000037430 deletion Effects 0.000 claims 1
- 238000012545 processing Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000013500 data storage Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 238000013461 design Methods 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 238000005304 joining Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/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
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses an optimization method, a device, computer equipment and a medium for executing priority tasks, wherein the method comprises the following steps: creating a plurality of priority queues with different priority levels; creating a temporary super-priority queue; judging whether a task needs to be executed in the temporary super-priority queue; if so, a scheduler of the task scheduling system acquires the tasks from the temporary super-priority queue; and if not, the scheduler of the task scheduling system sequentially acquires the tasks from the corresponding priority queues according to the priority levels. In the invention, when an urgent and important task needs to be executed preferentially, the urgent task can be added into the temporary super-priority queue after being approved, and the scheduler of the task scheduling system can acquire the task from the temporary super-priority queue preferentially and then acquire the task from the priority queue, thereby ensuring that the urgent task can be executed preferentially.
Description
Technical Field
The invention relates to the field of data processing, in particular to a method, a device, computer equipment and a medium for optimizing execution priority tasks in a task scheduling system.
Background
In the existing task scheduling system usage scenario, some tasks need to be executed preferentially, and some tasks can be executed slowly, which involves the problem of task priority, and then the existing priority processing scheme is generally: the priorities are divided into low, medium, high and high levels, a plurality of priority queues are established, and tasks with different priorities are put into different queues. The scheduler can obtain tasks from a queue with high priority to a queue with low priority, the tasks are scheduled firstly with high priority, and then scheduled with low priority, but once developers consider the tasks to be urgent, the tasks are set to be the highest priority, so the priority loses the meaning of the tasks, and the really urgent tasks cannot be executed preferentially.
Therefore, it is necessary to design a new mechanism to ensure that truly urgent tasks can be performed with priority.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provides an optimization method, a device, a computer device and a medium for executing priority tasks.
In order to achieve the purpose, the invention adopts the following technical scheme:
in a first aspect, a method for performing priority task optimization is applied to a task scheduling system, and the method includes:
creating a plurality of priority queues with different priority levels;
creating a temporary super-priority queue;
judging whether a task needs to be executed in the temporary super-priority queue;
if so, a scheduler of the task scheduling system acquires the tasks from the temporary super-priority queue;
and if not, the scheduler of the task scheduling system sequentially acquires the tasks from the corresponding priority queues according to the priority levels.
The further technical scheme is as follows: the step of creating a temporary super-priority queue specifically includes the steps of:
receiving a task application which is submitted by a user and added into a temporary super-priority queue;
judging whether the task application meets the approval passing condition;
if so, approving the user to add the task meeting the approval passing condition to the temporary super-priority queue;
and if not, rejecting the user to add the task into the temporary super-priority queue, and submitting the task into the priority queue with the lowest priority level.
The further technical scheme is as follows: after the step of approving the user to add the task meeting the approval passing condition to the temporary super-priority queue, the method further comprises the following steps:
monitoring whether the time for waiting to be executed by the tasks in the temporary super-priority queue exceeds preset time or not;
if so, the task is deleted from the temporary super-priority queue.
The further technical scheme is as follows: the step of creating a plurality of priority queues with different priority levels specifically comprises the following steps:
setting queuing standard values of queues with different priorities;
receiving a task submitted by a user;
judging which priority queue requirement the task submitted by the current user meets according to the enqueue standard value;
acquiring whether the number of added tasks in a priority queue meeting the requirements of the tasks submitted by the current user reaches the maximum value or not;
if so, adding the task submitted by the current user into a priority queue with a lower level than the priority queue meeting the requirement of the task submitted by the current user;
and if not, adding the task submitted by the current user into the priority queue meeting the requirement.
In a second aspect, an optimization device for executing priority tasks, applied to a task scheduling system, includes a first creating unit, a second creating unit, a determining unit, a first obtaining unit, and a second obtaining unit;
the first creating unit is used for creating a plurality of priority queues with different priority levels;
the second creating unit is used for creating a temporary super-priority queue;
the judging unit is used for judging whether a task needs to be executed in the temporary super-priority queue;
the first obtaining unit is used for a scheduler of the task scheduling system to obtain tasks from the temporary super-priority queue;
and the second acquisition unit is used for acquiring the tasks from the corresponding priority queues in sequence according to the priorities of the tasks by the scheduler of the task scheduling system.
The further technical scheme is as follows: the second creating unit comprises a first receiving module, a first judging module, a first adding module and a submitting module;
the first receiving module is used for receiving a task application which is submitted by a user and added into the temporary super-priority queue;
the first judgment module is used for judging whether the task application meets the approval passing condition;
the first adding module is used for approving the user to add the tasks meeting the approval passing conditions into the temporary super-priority queue;
the submitting module is used for refusing the user to add the task to the temporary super-priority queue and submitting the task to the priority queue with the lowest priority level.
The further technical scheme is as follows: the second creating unit further comprises a monitoring module and a deleting module;
the monitoring module is used for monitoring whether the time for waiting to be executed by the tasks in the temporary super-priority queue exceeds preset time;
and the deleting module is used for deleting the task from the temporary super-priority queue.
The further technical scheme is as follows: the first creating unit comprises a setting module, a second receiving module, a second judging module, a third judging module, a second adding module and a third adding module;
the setting module is used for setting the queuing standard values of different priority queues;
the second receiving module is used for receiving tasks submitted by a user;
the second judgment module is used for judging which priority queue requirement the task submitted by the current user meets according to the enqueue standard value;
the third judging module is used for acquiring whether the number of the added tasks in the priority queue meeting the requirements submitted by the current user reaches the maximum value or not;
the second adding module is used for adding the tasks submitted by the current user into a priority queue with a lower grade than the priority queue meeting the requirements of the tasks submitted by the current user;
and the third adding module is used for adding the tasks submitted by the current user into the priority queue meeting the requirements.
In a third aspect, a computer device comprises a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the optimization method for performing priority tasks as described above when executing the computer program.
In a fourth aspect, a storage medium stores a computer program comprising program instructions which, when executed by a processor, cause the processor to perform the steps of the optimization method of performing priority tasks as described above.
Compared with the prior art, the invention has the beneficial effects that: according to the optimization method for executing the priority tasks, provided by the invention, the temporary super-priority queue is arranged besides the plurality of priority queues with different priority levels, when an urgent and important task needs to be executed preferentially, the urgent task can be added into the temporary super-priority queue after being approved, and a scheduler of a task scheduling system can acquire the task from the temporary super-priority queue preferentially and then acquire the task from the priority queue, so that the real urgent task can be executed preferentially.
The foregoing description is only an overview of the technical solutions of the present invention, and in order to make the technical means of the present invention more clearly understood, the present invention may be implemented according to the content of the description, and in order to make the above and other objects, features, and advantages of the present invention more apparent, the following detailed description will be given of preferred embodiments.
Drawings
FIG. 1 is a first flowchart of an embodiment of a method for optimizing execution of priority tasks according to the present invention;
FIG. 2 is a flowchart illustrating a second embodiment of a method for performing priority task optimization according to the present invention;
FIG. 3 is a flowchart III of an exemplary embodiment of a method for optimizing execution of priority tasks in accordance with the present invention;
FIG. 4 is a first block diagram illustrating the structure of an embodiment of an optimization apparatus for performing priority tasks according to the present invention;
FIG. 5 is a block diagram illustrating the structure of an exemplary embodiment of an optimization apparatus for performing priority tasks according to the present invention;
FIG. 6 is a block diagram illustrating a third exemplary embodiment of an optimization apparatus for performing priority tasks according to the present invention;
FIG. 7 is a schematic block diagram of a computer device of the present invention.
Detailed Description
In order to more fully understand the technical content of the present invention, the technical solution of the present invention will be further described and illustrated with reference to the following specific embodiments, but not limited thereto.
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It will be understood that the terms "comprises" and/or "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It is also to be understood that the terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the specification of the present invention and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
It should be further understood that the term "and/or" as used in this specification and the appended claims refers to and includes any and all possible combinations of one or more of the associated listed items.
The invention provides an optimization method for executing priority tasks, which is applied to a task scheduling system, please refer to fig. 1, and the method comprises the following steps:
s10, creating a plurality of priority queues with different priority levels.
Different levels of tasks are added to corresponding priority queues by creating different priority queues. In this embodiment, the different priority queues include a high priority queue, a medium priority queue, and a bottom priority queue. Of course, the priority queue may be classified according to actual requirements, for example, the priority queue may be classified into a high priority queue, a higher priority queue, a medium priority queue, a bottom priority queue, and a lower priority queue.
S20, creating a temporary super-priority queue.
Specifically, the temporary super-priority queue is used for placing a task which is particularly urgent, a scheduler of the task scheduling system can preferentially acquire the task of the temporary super-priority queue to execute, and only when no task exists in the temporary super-priority queue, the task can be acquired from the priority queue to execute, so that the priority processing permission of the temporary super-priority queue is higher than that of the priority queue, and the real urgent task can be timely executed.
S30, judging whether a task needs to be executed in the temporary super-priority queue, if so, S301, acquiring the task from the temporary super-priority queue by a scheduler of the task scheduling system; if not, S302, the scheduler of the task scheduling system sequentially acquires the tasks from the corresponding priority queues according to the priority levels.
Further, referring to fig. 2, step S20 specifically includes the following steps:
s201, receiving a task application which is submitted by a user and added into the temporary super-priority queue.
And S202, judging whether the task application meets the approval passing condition, if so, S2021, approving the user to add the task meeting the approval passing condition to the temporary super-priority queue, and if not, S2022, refusing the user to add the task to the temporary super-priority queue and submitting the task to the priority queue with the lowest priority level.
Specifically, in order to ensure that the task application submitted by the user is a particularly urgent task, a link for examining and approving the submitted task needs to be set, and only the particularly urgent task can be examined and approved. The task of particular urgency may be contingent on demand.
S20211, monitoring whether the time for the task in the temporary super-priority queue to wait to be executed exceeds a preset time, if yes, S202111, deleting the task from the temporary super-priority queue, and if not, repeating step S20211.
Specifically, in order to avoid that the time for the task to wait to be executed in the temporary super-priority queue is too long, which results in reducing the efficiency of executing the task, a preset time is set, in this embodiment, the preset time is 1 hour, and when it is detected that the time for the task in the temporary super-priority queue to wait to be executed exceeds one hour, the corresponding task is deleted from the temporary super-priority queue.
Further, referring to fig. 3, step S10 specifically includes the following steps:
s101, setting queuing standard values of different priority queues.
Specifically, different enqueue standard values are set for adding different tasks to different priority queues, and the enqueue standard values can be set according to requirements.
And S102, receiving a task submitted by a user.
S103, judging which priority queue requirement the task submitted by the current user meets according to the enqueue standard value.
Specifically, if the task submitted by the current user meets the requirement of the enqueuing standard value of the high-priority queue, the task is added into the high-priority queue; if the task submitted by the current user meets the requirement of the enqueue standard value of the medium priority queue, adding the task into the medium priority queue; and if the task submitted by the current user meets the requirement of the enqueue standard value of the low-priority queue, adding the task into the low-priority queue, and so on.
S104, acquiring whether the number of added tasks in a priority queue meeting the requirements of the tasks submitted by the current user reaches the maximum value, if so, S1041, adding the tasks submitted by the current user to a priority queue with a lower grade than the priority queue meeting the requirements of the tasks submitted by the current user, and if not, S1042, adding the tasks submitted by the current user to the priority queue meeting the requirements.
Specifically, since the number of tasks accommodated in each priority queue is limited, when the number of tasks in a certain priority queue reaches the maximum value, tasks that need to be added to the priority queue cannot be added at this time, but the tasks may be added to a priority queue lower than the priority queue.
It should be understood that, the sequence numbers of the steps in the foregoing embodiments do not imply an execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention.
Referring to fig. 4, the apparatus includes a first creating unit 1, a second creating unit 2, a determining unit 3, a first obtaining unit 4, and a second obtaining unit 5;
a first creating unit 1 for creating a plurality of priority queues having different priority levels;
a second creating unit 2 for creating a temporary super-priority queue;
the judging unit 3 is used for judging whether a task needs to be executed in the temporary super-priority queue;
a first obtaining unit 4, configured to obtain a task from the temporary super-priority queue by a scheduler of the task scheduling system;
and the second obtaining unit 5 is used for the scheduler of the task scheduling system to obtain the tasks from the corresponding priority queues in sequence according to the priority levels.
Further, referring to fig. 5, the second creating unit 2 includes a first receiving module 21, a first judging module 22, a first adding module 23, a submitting module 24, a monitoring module 25, and a deleting module 26;
a first receiving module 21, configured to receive a task application for joining a temporary super-priority queue, where the task application is submitted by a user;
the first judging module 22 is used for judging whether the task application meets the approval passing condition;
a first adding module 23, configured to approve the user to add a task meeting the approval passing condition to the temporary super-priority queue;
the submitting module 24 is configured to refuse the user to add the task to the temporary super-priority queue, and submit the task to the priority queue with the lowest priority level;
the monitoring module 25 is configured to monitor whether a waiting time for the task in the temporary super-priority queue to be executed exceeds a preset time;
a removal module 26 for removing the task from the temporary super-priority queue.
Further, referring to fig. 6, the first creating unit 1 includes a setting module 11, a second receiving module 12, a second determining module 13, a third determining module 14, a second adding module 15, and a third adding module 16;
the setting module 11 is used for setting queuing standard values of different priority queues;
the second receiving module 12 is used for receiving tasks submitted by users;
the second judging module 13 is used for judging which priority queue requirement the task submitted by the current user meets according to the enqueue standard value;
a third judging module 14, configured to obtain whether the number of added tasks in the priority queue meeting the requirement submitted by the current user reaches a maximum value;
a second adding module 15, configured to add the task submitted by the current user to a priority queue with a lower level than a priority queue meeting the requirement of the task submitted by the current user;
and a third adding module 16, configured to add the task submitted by the current user to the priority queue meeting the requirement.
As shown in fig. 7, the present embodiment further provides a computer device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and when the processor executes the computer program, the steps of the data storage method of the SSD are implemented.
The computer device 700 may be a terminal or a server. The computer device 700 includes a processor 720, memory, and a network interface 750, which are connected by a system bus 710, where the memory may include non-volatile storage media 730 and internal memory 740.
The non-volatile storage medium 730 may store an operating system 731 and computer programs 732. The computer programs 732, when executed, enable the processor 720 to perform any of the data storage methods of the SSD.
The processor 720 is used to provide computing and control capabilities, supporting the operation of the overall computer device 700.
The internal memory 740 provides an environment for the operation of the computer program 732 in the non-volatile storage medium 730, and when the computer program 732 is executed by the processor 720, the processor 720 can execute any data storage method of the SSD.
The network interface 750 is used for network communication such as sending assigned tasks and the like. Those skilled in the art will appreciate that the architecture shown in fig. 7 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing device 700 to which the disclosed aspects apply, as a particular computing device 700 may include more or less components than those shown, or may combine certain components, or have a different arrangement of components. Wherein the processor 720 is configured to execute the program code stored in the memory to perform the following steps:
creating a plurality of priority queues with different priority levels;
creating a temporary super-priority queue;
judging whether a task needs to be executed in the temporary super-priority queue;
if so, a scheduler of the task scheduling system acquires the tasks from the temporary super-priority queue;
and if not, the scheduler of the task scheduling system sequentially acquires the tasks from the corresponding priority queues according to the priority levels.
The further technical scheme is as follows: the step of creating a temporary super-priority queue specifically includes the steps of:
receiving a task application which is submitted by a user and added into a temporary super-priority queue;
judging whether the task application meets the approval passing condition;
if so, approving the user to add the task meeting the approval passing condition to the temporary super-priority queue;
and if not, rejecting the user to add the task into the temporary super-priority queue, and submitting the task into the priority queue with the lowest priority level.
The further technical scheme is as follows: after the step of approving the user to add the task meeting the approval passing condition to the temporary super-priority queue, the method further comprises the following steps:
monitoring whether the time for waiting to be executed by the tasks in the temporary super-priority queue exceeds preset time or not;
if so, the task is deleted from the temporary super-priority queue.
The further technical scheme is as follows: the step of creating a plurality of priority queues with different priority levels specifically comprises the following steps:
setting queuing standard values of queues with different priorities;
receiving a task submitted by a user;
judging which priority queue requirement the task submitted by the current user meets according to the enqueue standard value;
acquiring whether the number of added tasks in a priority queue meeting the requirements of the tasks submitted by the current user reaches the maximum value or not;
if so, adding the task submitted by the current user into a priority queue with a lower level than the priority queue meeting the requirement of the task submitted by the current user;
and if not, adding the task submitted by the current user into the priority queue meeting the requirement.
It should be understood that, in the embodiment of the present Application, the Processor 720 may be a Central Processing Unit (CPU), and the Processor 720 may also be other general-purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field-Programmable Gate arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components, and the like. Wherein a general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
Those skilled in the art will appreciate that the configuration of computer device 700 depicted in FIG. 7 is not intended to be limiting of computer device 700 and may include more or less components than those shown, or some components in combination, or a different arrangement of components.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the embodiments of the present invention may be implemented in the form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, a network device, or the like) or a processor (processor) to execute all or part of the steps of the methods according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions. Each functional unit and module in the embodiments may be integrated in one processing unit, or each unit may exist alone physically, or two or more units are integrated in one unit, and the integrated unit may be implemented in a form of hardware, or in a form of software functional unit. In addition, specific names of the functional units and modules are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working processes of the units and modules in the above-mentioned apparatus may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
In the embodiments provided in the present invention, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described device embodiments are merely illustrative, and for example, the division of the modules or units is only one logical functional division, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another device, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The technical contents of the present invention are further illustrated by the examples only for the convenience of the reader, but the embodiments of the present invention are not limited thereto, and any technical extension or re-creation based on the present invention is protected by the present invention. The protection scope of the invention is subject to the claims.
Claims (10)
1. The optimization method for executing the priority task is applied to a task scheduling system, and is characterized by comprising the following steps:
creating a plurality of priority queues with different priority levels;
creating a temporary super-priority queue;
judging whether a task needs to be executed in the temporary super-priority queue;
if so, a scheduler of the task scheduling system acquires the tasks from the temporary super-priority queue;
and if not, the scheduler of the task scheduling system sequentially acquires the tasks from the corresponding priority queues according to the priority levels.
2. The method according to claim 1, wherein the step of creating a temporary super-priority queue comprises the steps of:
receiving a task application which is submitted by a user and added into a temporary super-priority queue;
judging whether the task application meets the approval passing condition;
if so, approving the user to add the task meeting the approval passing condition to the temporary super-priority queue;
and if not, rejecting the user to add the task into the temporary super-priority queue, and submitting the task into the priority queue with the lowest priority level.
3. The method of optimizing execution priority tasks of claim 2, wherein after the step of approving the user to add the approval passing condition-compliant task to the temporary super-priority queue, further comprising the steps of:
monitoring whether the time for waiting to be executed by the tasks in the temporary super-priority queue exceeds preset time or not;
if so, the task is deleted from the temporary super-priority queue.
4. The method according to claim 1, wherein the step of creating a plurality of priority queues with different priority levels comprises the following steps:
setting queuing standard values of queues with different priorities;
receiving a task submitted by a user;
judging which priority queue requirement the task submitted by the current user meets according to the enqueue standard value;
acquiring whether the number of added tasks in a priority queue meeting the requirements of the tasks submitted by the current user reaches the maximum value or not;
if so, adding the task submitted by the current user into a priority queue with a lower level than the priority queue meeting the requirement of the task submitted by the current user;
and if not, adding the task submitted by the current user into the priority queue meeting the requirement.
5. The optimization device for executing the priority task is applied to a task scheduling system and is characterized by comprising a first creating unit, a second creating unit, a judging unit, a first acquiring unit and a second acquiring unit;
the first creating unit is used for creating a plurality of priority queues with different priority levels;
the second creating unit is used for creating a temporary super-priority queue;
the judging unit is used for judging whether a task needs to be executed in the temporary super-priority queue;
the first obtaining unit is used for a scheduler of the task scheduling system to obtain tasks from the temporary super-priority queue;
and the second acquisition unit is used for acquiring the tasks from the corresponding priority queues in sequence according to the priorities of the tasks by the scheduler of the task scheduling system.
6. The optimizing device for executing the priority task according to claim 5, wherein the second creating unit includes a first receiving module, a first judging module, a first adding module, and a submitting module;
the first receiving module is used for receiving a task application which is submitted by a user and added into the temporary super-priority queue;
the first judgment module is used for judging whether the task application meets the approval passing condition;
the first adding module is used for approving the user to add the tasks meeting the approval passing conditions into the temporary super-priority queue;
the submitting module is used for refusing the user to add the task to the temporary super-priority queue and submitting the task to the priority queue with the lowest priority level.
7. The priority task optimization device of claim 6, wherein the second creation unit further comprises a monitoring module and a deletion module;
the monitoring module is used for monitoring whether the time for waiting to be executed by the tasks in the temporary super-priority queue exceeds preset time;
and the deleting module is used for deleting the task from the temporary super-priority queue.
8. The optimizing device for executing the priority task according to claim 5, wherein the first creating unit includes a setting module, a second receiving module, a second judging module, a third judging module, a second adding module, and a third adding module;
the setting module is used for setting the queuing standard values of different priority queues;
the second receiving module is used for receiving tasks submitted by a user;
the second judgment module is used for judging which priority queue requirement the task submitted by the current user meets according to the enqueue standard value;
the third judging module is used for acquiring whether the number of the added tasks in the priority queue meeting the requirements submitted by the current user reaches the maximum value or not;
the second adding module is used for adding the tasks submitted by the current user into a priority queue with a lower grade than the priority queue meeting the requirements of the tasks submitted by the current user;
and the third adding module is used for adding the tasks submitted by the current user into the priority queue meeting the requirements.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the method steps of the optimization method of performing priority tasks according to any one of claims 1 to 4 when executing the computer program.
10. A storage medium, characterized in that it stores a computer program comprising program instructions which, when executed by a processor, cause the processor to carry out the steps of the optimization method of carrying out priority tasks according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911365886.9A CN111061556A (en) | 2019-12-26 | 2019-12-26 | Optimization method and device for executing priority task, computer equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911365886.9A CN111061556A (en) | 2019-12-26 | 2019-12-26 | Optimization method and device for executing priority task, computer equipment and medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111061556A true CN111061556A (en) | 2020-04-24 |
Family
ID=70303876
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911365886.9A Pending CN111061556A (en) | 2019-12-26 | 2019-12-26 | Optimization method and device for executing priority task, computer equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111061556A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111782295A (en) * | 2020-06-29 | 2020-10-16 | 珠海豹趣科技有限公司 | Application program running method and device, electronic equipment and storage medium |
| CN111858011A (en) * | 2020-07-31 | 2020-10-30 | 深圳大普微电子科技有限公司 | Multi-data-stream task processing method, device, equipment and storage medium |
| CN112215510A (en) * | 2020-10-21 | 2021-01-12 | 岭东核电有限公司 | Method, device, equipment and storage medium for generating work priority of nuclear power plant |
| CN112395057A (en) * | 2020-11-12 | 2021-02-23 | 苏宁云计算有限公司 | Data processing method and device based on timing task and computer equipment |
| CN114090208A (en) * | 2021-11-22 | 2022-02-25 | 南方电网电力科技股份有限公司 | Task scheduling method and device for electric energy meter operating system |
| CN114265798A (en) * | 2022-03-02 | 2022-04-01 | 北京得瑞领新科技有限公司 | Arbitration management method of task queue, storage medium and solid state disk |
| CN116366436A (en) * | 2023-04-21 | 2023-06-30 | 南京弘竹泰信息技术有限公司 | Method for providing various telecom value-added services based on wide area networking |
| CN117742923A (en) * | 2023-12-26 | 2024-03-22 | 上海数禾信息科技有限公司 | Distributed concurrency request control method, device, equipment and medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101536490A (en) * | 2006-11-17 | 2009-09-16 | 微软公司 | Swarm imaging |
| CN106502235A (en) * | 2016-10-31 | 2017-03-15 | 北京新能源汽车股份有限公司 | Test method and system of automobile controller |
| CN107491346A (en) * | 2016-06-12 | 2017-12-19 | 阿里巴巴集团控股有限公司 | A kind of task processing method of application, apparatus and system |
| CN109814988A (en) * | 2017-11-22 | 2019-05-28 | 深圳竹云科技有限公司 | Task processing method and system |
-
2019
- 2019-12-26 CN CN201911365886.9A patent/CN111061556A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101536490A (en) * | 2006-11-17 | 2009-09-16 | 微软公司 | Swarm imaging |
| CN107491346A (en) * | 2016-06-12 | 2017-12-19 | 阿里巴巴集团控股有限公司 | A kind of task processing method of application, apparatus and system |
| CN106502235A (en) * | 2016-10-31 | 2017-03-15 | 北京新能源汽车股份有限公司 | Test method and system of automobile controller |
| CN109814988A (en) * | 2017-11-22 | 2019-05-28 | 深圳竹云科技有限公司 | Task processing method and system |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111782295A (en) * | 2020-06-29 | 2020-10-16 | 珠海豹趣科技有限公司 | Application program running method and device, electronic equipment and storage medium |
| CN111782295B (en) * | 2020-06-29 | 2023-08-29 | 珠海豹趣科技有限公司 | Application program running method and device, electronic equipment and storage medium |
| CN111858011A (en) * | 2020-07-31 | 2020-10-30 | 深圳大普微电子科技有限公司 | Multi-data-stream task processing method, device, equipment and storage medium |
| CN112215510A (en) * | 2020-10-21 | 2021-01-12 | 岭东核电有限公司 | Method, device, equipment and storage medium for generating work priority of nuclear power plant |
| CN112395057A (en) * | 2020-11-12 | 2021-02-23 | 苏宁云计算有限公司 | Data processing method and device based on timing task and computer equipment |
| CN114090208A (en) * | 2021-11-22 | 2022-02-25 | 南方电网电力科技股份有限公司 | Task scheduling method and device for electric energy meter operating system |
| CN114090208B (en) * | 2021-11-22 | 2023-10-13 | 南方电网电力科技股份有限公司 | Task scheduling method and device for electric energy meter operating system |
| CN114265798A (en) * | 2022-03-02 | 2022-04-01 | 北京得瑞领新科技有限公司 | Arbitration management method of task queue, storage medium and solid state disk |
| CN116366436A (en) * | 2023-04-21 | 2023-06-30 | 南京弘竹泰信息技术有限公司 | Method for providing various telecom value-added services based on wide area networking |
| CN116366436B (en) * | 2023-04-21 | 2024-03-05 | 南京弘竹泰信息技术有限公司 | Method for providing various telecom value-added services based on wide area networking |
| CN117742923A (en) * | 2023-12-26 | 2024-03-22 | 上海数禾信息科技有限公司 | Distributed concurrency request control method, device, equipment and medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111061556A (en) | Optimization method and device for executing priority task, computer equipment and medium | |
| CN110727512B (en) | Cluster resource scheduling method, device, equipment and storage medium | |
| CN110096353B (en) | Task scheduling method and device | |
| CN107748696B (en) | Task scheduling method and terminal equipment | |
| US8424007B1 (en) | Prioritizing tasks from virtual machines | |
| CN109901918B (en) | Method and device for processing overtime task | |
| CN110928905B (en) | Data processing method and device | |
| CN108491304B (en) | electronic device, business system risk control method and storage medium | |
| CN109343972B (en) | Task processing method and terminal equipment | |
| CN112395067A (en) | Task scheduling method, system, device and medium | |
| CN111240864A (en) | Asynchronous task processing method, device, equipment and computer readable storage medium | |
| CN110781145A (en) | File system task scheduling method, device, equipment and readable storage medium | |
| CN111026552B (en) | Resource scheduling method and device, electronic equipment and computer readable storage medium | |
| CN112181645A (en) | Resource scheduling method, device, equipment and storage medium | |
| CN113961334B (en) | Task processing method, device, equipment and storage medium | |
| CN109684274B (en) | File archiving method, device and computer readable storage medium | |
| CN114979282B (en) | Task scheduling method, device, storage medium and electronic equipment | |
| CN110609758A (en) | Queue-based device operating method, computer device and readable storage medium | |
| CN115185685B (en) | Task scheduling method, device, computer equipment and storage medium | |
| CN114860397A (en) | Task scheduling method, device and equipment | |
| CN112130974B (en) | Cloud computing resource configuration method and device, electronic equipment and storage medium | |
| CN114995982A (en) | Task processing method and device and storage medium | |
| CN114253688A (en) | Method and application for rescheduling application load in cloud environment | |
| CN110851286B (en) | Thread management method and device, electronic equipment and storage medium | |
| CN114675954A (en) | Task scheduling method and device |
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 |