CN112579263A - Task execution method and device, storage medium and electronic equipment - Google Patents
Task execution method and device, storage medium and electronic equipment Download PDFInfo
- Publication number
- CN112579263A CN112579263A CN201910934408.9A CN201910934408A CN112579263A CN 112579263 A CN112579263 A CN 112579263A CN 201910934408 A CN201910934408 A CN 201910934408A CN 112579263 A CN112579263 A CN 112579263A
- Authority
- CN
- China
- Prior art keywords
- queue
- task
- current
- tasks
- executed
- 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 139
- 230000000875 corresponding effect Effects 0.000 claims abstract description 77
- 230000002596 correlated effect Effects 0.000 claims abstract description 14
- 230000008569 process Effects 0.000 claims description 30
- 238000004891 communication Methods 0.000 claims description 2
- 238000012545 processing Methods 0.000 abstract description 17
- 238000010586 diagram Methods 0.000 description 12
- 238000004590 computer program Methods 0.000 description 6
- 230000008901 benefit Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000003068 static 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/48—Indexing scheme relating to G06F9/48
- G06F2209/484—Precedence
Abstract
The invention discloses a task execution method, which is applied to a queue set, wherein the queue set is provided with a plurality of queues, each queue is provided with a priority corresponding to the queue, each task to be executed is distributed to the corresponding queue according to the task attribute of the task, and the method comprises the following steps: in a preset polling period, according to the sequence of the priority of each queue from high to low, tasks with the target number are sequentially executed in each queue, and the priority of each queue is positively correlated with the target number. By applying the method, a plurality of queues can be set in the queue set, each queue is polled and started according to the priority order of the queue, the number of tasks executed in each round of order is set for each queue according to the priority of each queue, the number of tasks executed by the queue with high priority is large, the execution of the tasks is accelerated by a mode of executing the tasks by multi-queue polling, the problem of queue congestion caused by the fact that a large number of tasks need to be executed is avoided, and the processing efficiency of the tasks is improved.
Description
Technical Field
The present invention relates to the field of task processing technologies, and in particular, to a method and an apparatus for executing a task, a storage medium, and an electronic device.
Background
With the development of science and technology, a plurality of application systems and application platforms are generated, each application system or application platform can generate a large number of tasks during working, and the tasks can be processes or threads in the systems or platforms; the application system and the application platform ensure the realization of the functions of the application system or the application platform by executing the generated tasks.
When the application system and the application platform execute tasks, the generated tasks are usually stored in the queue according to a certain placement rule, and the tasks stored in the queue are executed according to the execution rule, so that the ordered execution of the tasks is ensured, and the working efficiency of the application system and the application platform is improved.
The inventor researches and discovers that when a conventional method is used for executing tasks, the execution sequence of each task in a queue cannot be changed, a certain task cannot be executed for a long time, and when a large number of tasks are generated in an application program or an application platform in a batch manner, the quantity of the tasks in the queue is increased suddenly, the tasks in the queue are easy to be jammed, and the efficiency of the application system or the application platform for processing the tasks is reduced.
Disclosure of Invention
In view of the above problems, the present invention provides a task execution method and apparatus, a storage medium, and an electronic device, which overcome the above problems or at least partially solve the above problems, and the technical solutions are as follows:
a task execution method is applied to a queue set, wherein a plurality of queues are arranged in the queue set, each queue is provided with a priority corresponding to the queue, and each task to be executed is distributed to the corresponding queue according to the task attribute of the task; the method comprises the following steps:
in a preset polling period, according to the sequence of the priority of each queue from high to low, tasks with the target number are sequentially executed in each queue, and the priority of each queue is positively correlated with the target number.
Optionally, in the process of sequentially executing the target number of tasks in each queue, the method further includes:
when a priority execution instruction is received, determining a target task corresponding to the priority execution instruction;
judging whether the queue where the target task is located is the queue with the highest priority in the queue set;
and if the target task is not in the queue with the highest priority, copying the target task in the queue where the target task is located, and adding the copied target task to the queue with the highest priority.
The method above, optionally, wherein each of the queues has a task execution threshold;
the executing of the target number of tasks in each queue in turn comprises:
acquiring a task execution threshold corresponding to the polled current queue;
judging whether the number of the tasks in the current queue is smaller than the task execution threshold value;
if the number of the tasks in the current queue is not less than the task execution threshold, determining a plurality of tasks in each task in the current queue, and executing the determined plurality of tasks, wherein the number of the plurality of tasks is the task execution threshold;
and if the number of the tasks in the current queue is less than the task execution threshold, executing each task in the current queue.
In the foregoing method, optionally, the determining a plurality of tasks in each task in the current queue includes:
determining a queue attribute of the current queue;
if the queue attribute of the current queue represents that the current queue is a first-in first-out queue, sequentially selecting a plurality of tasks from the front end of the current queue to the rear end of the current queue;
and if the queue attribute of the current queue indicates that the current queue is a priority queue, determining the priority of each task in the current queue, and sequentially selecting a plurality of tasks according to the sequence from high to low of the priority of each task in the current queue.
The method, optionally, may execute a process of each task in the queue, including:
determining a current task to be executed;
judging whether the established configuration service records execution record information corresponding to the current task to be executed;
and if the configuration service records execution record information corresponding to the current task to be executed, not executing the current task to be executed, and determining a task next to the current task to be executed as a new current task to be executed.
The above method, optionally, further includes:
if the configuration service does not record execution record information corresponding to the current task to be executed, judging whether cancel indication information which is preset by a user and corresponds to the current task to be executed is set in the configuration service;
and if the configuration service is not provided with cancellation indication information which is preset by a user and corresponds to the current task to be executed, executing the current task to be executed.
The above method, optionally, further includes:
and if the configuration service is provided with cancellation indication information which is preset by a user and corresponds to the current task to be executed, skipping the execution process of the current task to be executed.
A task execution device is applied to a queue set, a plurality of queues are arranged in the queue set, each queue is provided with a priority corresponding to the queue, and each task to be executed is distributed to the corresponding queue according to the task attribute of the task; the device comprises:
and the execution unit is used for sequentially executing tasks with a target number in each queue according to the sequence of the priorities of the queues from high to low in a preset polling period, wherein the priorities of the queues are positively correlated with the target number.
The above apparatus, optionally, further comprises:
the device comprises a determining unit, a processing unit and a processing unit, wherein the determining unit is used for determining a target task corresponding to a priority execution instruction when the priority execution instruction is received;
the judging unit is used for judging whether the queue where the target task is located is the queue with the highest priority in the queue set;
and the adding unit is used for copying the target task in the queue where the target task is located and adding the copied target task to the queue with the highest priority if the target task is not in the queue with the highest priority.
The above apparatus, optionally, each of the queues has a task execution threshold, and the execution unit includes:
the acquiring subunit is used for acquiring a task execution threshold corresponding to the polled current queue;
the judging subunit is used for judging whether the number of the tasks in the current queue is smaller than the task execution threshold;
an execution subunit, configured to determine, in each task in the current queue, a plurality of tasks and execute the determined plurality of tasks if the number of tasks in the current queue is not less than the task execution threshold, where the number of the plurality of tasks is the task execution threshold; and if the number of the tasks in the current queue is less than the task execution threshold, executing each task in the current queue.
The above apparatus, optionally, the execution subunit includes:
the first determining module is used for determining the queue attribute of the current queue;
the first selection module is used for sequentially selecting a plurality of tasks from the front end of the current queue to the rear end of the current queue if the queue attribute of the current queue represents that the current queue is a first-in first-out queue;
and the second selection module is used for determining the priority of each task in the current queue if the queue attribute of the current queue indicates that the current queue is a priority queue, and sequentially selecting a plurality of tasks according to the sequence from high to low of the priority of each task in the current queue.
The above apparatus, optionally, the execution subunit further includes:
the second determining module is used for determining the current task to be executed;
the first judgment module is used for judging whether execution record information corresponding to the current task to be executed is recorded in the established configuration service;
and the third determining module is used for not executing the current task to be executed and determining the next task of the current task to be executed as the new current task to be executed if the execution record information corresponding to the current task to be executed is recorded in the configuration service.
The above apparatus, optionally, the execution subunit further includes:
the second judging module is used for judging whether cancel indication information which is preset by a user and corresponds to the current task to be executed is set in the configuration service or not if execution record information which corresponds to the current task to be executed is not recorded in the configuration service;
and the execution module is used for executing the current task to be executed if the configuration service is not provided with the cancellation indication information which is preset by the user and corresponds to the current task to be executed.
A storage medium comprising stored instructions, wherein the instructions, when executed, control a device on which the storage medium resides to perform a task execution method as described above.
An electronic device comprising a memory, and one or more instructions, wherein the one or more instructions are stored in the memory and configured to perform a task execution method as described above by one or more processors.
Compared with the prior art, the invention has the following advantages: the method provided by the invention is applied to a queue set, wherein a plurality of queues are arranged in the queue set, each queue is provided with a priority corresponding to the queue, and each task to be executed is distributed to the corresponding queue according to the task attribute of the task, and the method comprises the following steps: in a preset polling period, according to the sequence of the priority of each queue from high to low, tasks with the target number are sequentially executed in each queue, and the priority of each queue is positively correlated with the target number. By applying the method provided by the invention, a plurality of queues can be set in the queue set, each queue is polled and started according to the priority order of the queue, the number of tasks executed in each round order is set for each queue according to the priority of each queue, the number of tasks executed by the queue with high priority is large, the execution of the tasks is accelerated by a mode of executing the tasks by polling the queues, the problem of queue congestion caused by the fact that a large number of tasks need to be executed is avoided, and the processing efficiency of the tasks is further improved.
The foregoing description is only an overview of the technical solutions of the present invention, and the embodiments of the present invention are described below in order to make the technical means of the present invention more clearly understood and to make the above and other objects, features, and advantages of the present invention more clearly understandable.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to refer to like parts throughout the drawings. In the drawings:
fig. 1 is a flowchart of a method for executing a task according to an embodiment of the present invention;
FIG. 2 is a diagram illustrating a task execution method according to an embodiment of the present invention;
FIG. 3 is a flowchart of another method of a task execution method according to an embodiment of the present invention;
FIG. 4 is a diagram of another example of a task execution method according to an embodiment of the present invention;
FIG. 5 is a flowchart of another method of a task execution method according to an embodiment of the present invention;
FIG. 6 is a flowchart of another method of a task execution method according to an embodiment of the present invention;
FIG. 7 is a diagram illustrating an apparatus structure of a task execution apparatus according to an embodiment of the present invention;
fig. 8 is a structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
The embodiment of the invention provides a task execution method, which is applied to a queue set, wherein the queue set can be arranged in various system platforms, the bearing hardware of the system platforms can be a PC (personal computer), a terminal or other processing equipment, and the execution main body of the method can be a processor of the system platforms. The method comprises the following steps that a plurality of queues are arranged in the queue set, each queue is provided with a priority corresponding to the queue, and each task to be executed is distributed to the corresponding queue according to the task attribute of the task, and the method comprises the following steps:
in a preset polling period, according to the sequence of the priority of each queue from high to low, tasks with the target number are sequentially executed in each queue, and the priority of each queue is positively correlated with the target number.
Referring to fig. 1, a method flowchart of a task execution method provided by an embodiment of the present invention is shown, and a method execution process shown in fig. 1 is a feasible implementation scheme of the task execution method provided by the embodiment of the present invention, and specifically includes:
s101: acquiring the priority of each queue in a preset polling period;
s102: and executing tasks with the target number in each queue in sequence according to the sequence of the priority of each queue from high to low.
In the method provided by the embodiment of the invention, a queue set is preset in a system, the queue set at least comprises two queues, a corresponding priority is set for each queue in the queue set in the method, each queue is started in sequence from high to low according to the priority of each queue in a preset polling period, and the tasks with the target number in each queue are executed.
In the method provided by the embodiment of the present invention, in each polling cycle, a target number of executed tasks is set for each queue according to the priority of each queue, and the target number may be an upper threshold of the number of executed tasks in each queue in each polling cycle, or a quantity value determined in real time according to the upper threshold of the number of executed tasks. In the method, the priority of each queue is positively correlated with the target number.
In the method provided in the embodiment of the present invention, in each polling cycle, each queue is sequentially enabled according to the order of priority of each queue from high to low, and tasks of a target number in the queue are executed, where a queue with a higher priority has a larger target number set for the queue, and the process is understood from a feasible implementation perspective, and the process may be: in a polling period, the queue with the highest priority is started, a certain number of tasks are executed in the queue with the highest priority, and then the tasks in the queue with the second priority are started until the queue with the lowest priority. After the process is completed, the next polling cycle is entered. In the method, the priority of each queue can be acquired in real time in each polling cycle, or the priority of each queue can be read in advance, and the task with the target number in the queue is executed in the current polling cycle according to the read priority of each queue.
In the method provided by the embodiment of the present invention, each task generated in the system may be allocated to a corresponding queue according to the task attribute of each task, for example, each task of the main thread may be allocated to a queue with a higher priority, each task of the sub-thread may be allocated to a queue with a lower priority, and the attribute parameter in the task attribute of each task may represent the attribution of the task, and may also represent the characteristics of the task, such as the duration, occupied network bandwidth, and the like in the execution process.
It should be noted that, in general, the number of tasks in the queue with the highest priority in the queue set is 0 or less than the execution threshold of the queue with the highest priority.
By applying the method provided by the embodiment of the invention, a plurality of queues can be arranged in the queue set before the task is executed, each queue is enabled in turn according to the sequence of the priority of each queue from high to low in a preset polling period, the task with the target number is executed in each queue, and the priority of each queue is positively correlated with the target number; the higher the priority of the queue, the larger the number of targets corresponding to the queue. And when all the queues in the queue set are polled, ending the current polling period and entering the next polling period. According to the method provided by the embodiment of the invention, a multi-queue polling task execution mode is adopted, so that the task execution is accelerated, the problem of queue congestion caused by the fact that a large number of tasks need to be executed is avoided, and the task processing efficiency is further improved.
In the method provided by the embodiment of the invention, the tasks are distributed to the queues in the queue set, so that the ordered processing of the tasks is realized, the tasks in the queues are dynamically executed by periodically polling each queue in the queue set, the congestion of the tasks in the queues can be avoided, and the working efficiency of a system or a platform is improved. In the method provided by the embodiment of the invention, each queue in the queue set is polled periodically according to the sequence of the priority from high to low, and tasks with target number are executed in the current queue in sequence; the tasks in the queue can be orderly and periodically executed, so that the processing efficiency of the system on the tasks is improved.
In order to describe the implementation process of the above method more clearly, an embodiment of the present invention provides a specific example diagram, as shown in fig. 2, the queue set optionally includes four queues, which are a queue a, a queue b, a queue c, and a queue d, respectively, where the priority order of each queue is: queue d > queue c > queue b > queue a.
Setting the target number of the queue d to be 10 in one polling period; the target number of queue c is 7; the target number of queue b is 5; the target number of queue a is 2. And distributing each task generated in the system into a queue a, a queue b, a queue c and a queue d according to the task attribute of each task in the task pool. When each task needs to be processed, in the current polling cycle, according to the sequence from high priority to low priority, the queue d is firstly started, 10 tasks are executed in the queue d, then the queue c is started, 7 tasks are executed in the queue c, then the queue b is started, 5 tasks are executed in the queue b, finally the queue a is started, two tasks are executed in the queue a, after the execution of the two tasks in the queue a is finished, the current polling cycle is ended, the next polling cycle is entered, and the execution process is repeated, so that the execution of each task in the queue is realized.
In the method provided by the embodiment of the invention, each task generated in the system can be collected in the task pool in real time, then the enqueue operation is executed through the task pool, and the enqueue operation can be distributed to the corresponding queue according to the task attribute of each task, wherein the task attribute can comprehensively determine the queue corresponding to each task by referring to the execution time length, occupied bandwidth, the task type, parameter information and the like of the task in the execution process.
When the tasks in the task pool are allocated in real time, the tasks can be allocated in real time or at regular time, and when the tasks in the task pool are allocated in real time, if a new task is added into the task pool, the task attribute of the newly added task is determined, and the tasks newly added into the task pool are allocated to the corresponding queue according to the task attribute; when the tasks in the task pool are distributed regularly, if the preset time is reached, the tasks in the task pool are distributed to the corresponding queues.
In the method provided by the embodiment of the invention, in each polling cycle, in the process of executing the tasks in the queue, if a user needs to adjust the execution sequence of the tasks so that the tasks which are too long in waiting time and are not executed are executed, the tasks which need to be adjusted can be copied to the queue with the highest priority so as to realize that the tasks are preferentially executed in the next polling cycle. The specific implementation process is shown in fig. 3, and includes:
s201, when a priority execution instruction is received, determining a target task corresponding to the priority execution instruction.
In the method provided by the embodiment of the invention, the priority execution instruction is sent by a user, the priority execution instruction is analyzed to obtain the content in the priority execution instruction, and the corresponding target task is determined according to the content. The content can be an identification number of a task, a corresponding task is determined according to the identification number of the task, and the task corresponding to the identification number is determined as a target task.
S202, judging whether the queue where the target task is located is the queue with the highest priority in the queue set.
In the method provided by the embodiment of the invention, for the target task selected by the user, the queue where the target task is located is determined, and whether the queue where the target task is located is the queue with the highest priority in the queue set is judged.
S203, if the target task is not in the queue with the highest priority, copying the target task in the queue where the target task is located, and adding the copied target task to the queue with the highest priority.
In the method provided by the embodiment of the present invention, if the target task is not in the queue with the highest priority, the target task is copied in the queue with the target task, and the copied target task is added to the queue with the highest priority, so as to improve the probability that the target task is preferentially executed.
In the method provided by the embodiment of the present invention, if it is determined that the target task is in the queue with the highest priority, optionally, the priority execution instruction may be ignored, and the target task selected by the user is not processed.
On the basis of the example in fig. 2, referring to fig. 4 in the embodiment of the present invention, if a user needs to execute a task 103 preferentially, the user may send a preferential execution instruction, and when receiving the preferential execution instruction of the user, the processor determines that the task 103 is currently in a queue a, and the priority of the queue a is smaller than that of the queue d, so that the queue a is not the queue with the highest priority, duplicates the task 103 in the queue a, and randomly adds the task 103 obtained by duplication to the queue d.
In the method provided by the embodiment of the invention, if a user selects a plurality of tasks to be preferentially executed at the same time, each copied task can be added to the queue with the highest priority according to the sequence of the copy time stamp of each selected task, or each copied task can be randomly added to the queue with the highest priority after each task is obtained by copying.
In the method provided by the embodiment of the invention, the tasks needing to be executed preferentially are added into the queue with the highest priority in a mode of sending the preferentially-executing instruction, so that the dynamic adjustment of the task execution sequence is realized, the problem that the execution sequence cannot be changed once the tasks enter the queue in the prior art is solved, the emergency tasks can be executed preferentially, and the task execution efficiency is improved.
In the method provided in the embodiment of the present invention, each queue has a task execution threshold, and a specific process of sequentially executing a target number of tasks in each queue is described as follows with reference to fig. 5:
s401, acquiring a task execution threshold corresponding to the polled current queue.
In the method provided by the embodiment of the invention, a task execution threshold corresponding to a polled current queue is obtained, the task execution threshold is preset, and the task execution threshold is positively correlated with the queue priority; it should be noted that the priorities of the queues are different, the corresponding task execution thresholds are also different, and the maximum value of the target number of each queue is the task execution threshold of the queue.
S402, judging whether the number of the tasks in the current queue is smaller than the task execution threshold value.
In the method provided by the embodiment of the invention, the number of tasks in the current queue is determined, and the number of tasks is compared with a task execution threshold value to judge whether the number of tasks is smaller than the task execution threshold value.
And S403, if the number of the tasks in the current queue is not less than the task execution threshold, determining a plurality of tasks in each task in the current queue, and executing the determined tasks, wherein the number of the tasks is the task execution threshold.
In the method provided by the embodiment of the present invention, if the number of tasks in the current queue is not less than the task execution threshold, the number of tasks in the current queue exceeds or equals to the task execution threshold, a task is selected from each task in the current queue, and the selected number of tasks is equal to the task execution threshold. And if the number of the tasks in the current queue is smaller than the task execution threshold, determining the number of the tasks in the current queue as a target number, and executing each task in the current queue in sequence.
In the method provided by the embodiment of the invention, a task execution threshold is set for each queue, the task execution threshold represents the maximum number of tasks executed by each queue in a polling period, and if the number of the tasks in the currently polled queue is greater than the corresponding task execution threshold, the target number of the tasks executed in the currently polled queue is the corresponding task execution threshold.
S404, if the number of the tasks in the current queue is smaller than the task execution threshold, executing each task in the current queue.
In the method provided by the embodiment of the present invention, if the number of tasks in the queue polled currently is less than the task execution threshold of the queue, all tasks currently existing in the queue are executed.
It should be noted that the task execution threshold in the embodiment of the present invention is a maximum value of the tasks executed in the queue in one polling period, and in combination with the target number in the scheme shown in fig. 1, in the process of each execution, the target number is preferably the task execution threshold of the queue, and the value of the target number may also be determined according to the actual situation in the queue, and may also be smaller than the task execution threshold. In short, the determination of the target number may be performed according to a task execution threshold and an actual number of tasks in the queue, further, the target number may preferably be positively correlated with the priority of the queue, and if the number of tasks in the highest priority does not satisfy the task execution threshold, the target number may be adjusted according to an actual situation, for example, in the example of fig. 2, the task execution threshold of the queue d is 10, the task execution threshold of the task c is 7, and only two tasks in the queue d exist in one polling cycle, two tasks may be executed in the queue d, and 7 tasks may be executed in the queue c. The scheme is not limited to the target number being positively correlated with the priority.
The scheme provided in fig. 5 is described in detail with reference to the example of fig. 2, and specifically as follows:
if the current polled queue is queue a, 4 tasks currently exist in the queue a, and the task execution threshold corresponding to the queue a is 2, two tasks are selected from the queue a in the current polling period, a task 101 and a task 102 can be selected, and the task 101 and the task 102 are executed.
If the queue polled currently is a queue d, two tasks currently exist in the queue d, and the task execution threshold corresponding to the queue d is 10, the tasks 401 and 402 in the queue d are executed in the current polling period.
In the method provided by the embodiment of the present invention, preferably, the number of tasks existing in the queue with the highest priority is 0 or the number of tasks is smaller than the task execution threshold set by the queue, so that the task that the user requires to be executed preferentially can be executed in time in the current polling cycle or the next polling cycle.
It should be noted that, if there is no task in the currently polled queue, the queue next to the queue is sorted according to the priority order of the queue.
In the method provided by the embodiment of the present invention, determining a specific process of a plurality of tasks in each task in the current queue may include:
determining a queue attribute of the current queue;
if the queue attribute of the current queue represents that the current queue is a first-in first-out queue, sequentially selecting a plurality of tasks from the front end of the current queue to the rear end of the current queue;
and if the queue attribute of the current queue indicates that the current queue is a priority queue, determining the priority of each task in the current queue, and sequentially selecting a plurality of tasks according to the sequence from high to low of the priority of each task in the current queue.
In the method provided by the embodiment of the invention, each queue in the queue set has a corresponding queue attribute, and the queue type of the queue can be determined according to the queue attribute of each queue.
If the current queue is a first-in first-out queue, selecting the tasks in the current queue by combining the characteristics of the first-in first-out queue, because the first-in first-out queue outputs the tasks from the front end of the queue in sequence, a plurality of tasks need to be selected from the front end to the rear end of the queue in sequence, and the number of the tasks needs to be less than or equal to the task execution threshold corresponding to the queue.
If the current queue is a priority queue, when selecting tasks in the current queue, the tasks need to be selected according to the characteristics of the priority queue, each task in the priority queue has a corresponding priority, and the tasks can be dequeued according to the sequence of the priorities from high to low, therefore, when the current queue is the priority queue, a plurality of tasks can be selected according to the sequence of the priorities of the tasks in the queue from high to low, and the number of the selected tasks needs to be smaller than or equal to the task execution threshold of the queue.
In the embodiment of the present invention, all queues in the queue set may be first-in first-out queues or priority queues, and optionally, a part of each queue in the queue set may be first-in first-out queues and a part of each queue in the queue set may be priority queues.
In the method provided in the embodiment of the present invention, for each queue, a process of executing each task in the queue may specifically include, as shown in fig. 6 in the embodiment of the present invention:
s501, determining the current task to be executed.
In the method provided by the embodiment of the invention, for the currently polled queue, when each task in the queue is executed according to the target number, the task which needs to be executed currently is determined.
S502, judging whether execution record information corresponding to the current task to be executed is recorded in the established configuration service; if the configuration service records execution record information corresponding to the current task to be executed, executing S504; otherwise, S503 is executed.
In the method provided by the embodiment of the invention, a configuration service is pre-established, and the configuration service is used for recording data generated in the task execution process on one hand and storing some instructions set by a user on the other hand.
In the method provided by the embodiment of the present invention, after each task in the queue is executed, the processor records that the task has been executed, determines the information that the task has been executed as the execution record information corresponding to the task, and stores the execution record information in the configuration service. That is, in the method, the execution record information of the task in the configuration service is used for representing whether the task is executed.
In the method provided by the embodiment of the invention, when each task in the queue is executed, whether the execution record information corresponding to the current task to be executed exists in the configuration service needs to be judged, if yes, the task is indicated to be executed, in order to avoid repeated execution, the current task to be executed is not executed, and then the next task of the current task to be executed is determined as the new current task to be executed.
S503, judging whether cancel indication information which is preset by a user and corresponds to the current task to be executed is set in the configuration service; if the configuration service is provided with cancellation indication information which is preset by a user and corresponds to the current task to be executed, executing S504; otherwise, S505 is executed.
In the method provided by the embodiment of the present invention, if it is determined that the current task to be executed is not executed, it is further determined in the configuration service whether cancellation indication information corresponding to the current task to be executed, which is preset by a user, is set in the configuration service, where the cancellation indication information may be an instruction or a program. The cancel indication information is used for indicating the processor to skip executing the task when the current task to be executed needs to be executed, or indicating the processor to delete the current task to be executed in the queue.
Preferably, the cancellation indication information may include two instructions, one instruction is used to instruct the processor to skip execution of the current task to be executed, and the other instruction is used to instruct the processor to delete the current task to be executed, so as to cancel execution of the task to be executed subsequently.
In the method provided by the embodiment of the present invention, before any task in the queue is executed, it is required to check whether execution record information corresponding to the task exists in the configuration service, if the corresponding execution record information exists, it is characterized that the task has been executed, the task is not executed currently, if the corresponding execution record information does not exist, it is characterized that the task is not executed, and it is further checked whether cancel indication information corresponding to the task exists in the configuration service, if the corresponding cancel indication information exists, the task is operated according to the cancel indication information, and if the corresponding cancel indication information does not exist, the task is normally executed.
S504, the current task to be executed is not executed, and the next task of the current task to be executed is determined as the new current task to be executed.
And S505, executing the current task to be executed.
In the method provided by the embodiment of the present invention, the current task to be executed is executed according to an execution process set in the system, and it should be noted that, when the current task to be executed is executed, an execution record corresponding to the current task to be executed is written into a configuration service to represent that the current task to be executed is executed.
In the method provided by the embodiment of the present invention, for each task in the queue, execution record information corresponding to the task may be set in the configuration service, so as to indicate to skip executing the task or delete the task in the queue in a specific execution process, thereby realizing that a certain task may not be executed in the queue.
In the method provided by the embodiment of the invention, the process of setting the execution record information for a certain task in the configuration service can be preset, and the execution record information can be set for a certain task in real time according to the actual execution condition of the tasks in each queue so as to skip the execution of the task. Furthermore, if the user wants to preferentially execute a certain task in the queue with the highest priority, the user can skip each task before the task to preferentially execute the task.
In the method provided by the embodiment of the invention, corresponding cancellation indication information can be configured in the configuration service so as to dynamically delete and skip the tasks in the queue and dynamically adjust the queue where the tasks are located, so that the probability of executing the tasks is improved. By applying the method, the executable tasks in the blocked queue can be dynamically adjusted, the tasks in the queue are subjected to shunting processing, and the reasonable configuration of the tasks in the queue is realized, so that the blockage of the queue caused by a large amount of tasks is reduced, and the working efficiency of the system is improved.
An embodiment of the present invention further provides a task execution device corresponding to a task execution method, where the task execution device is configured to implement an application of the task execution method in practice, and a structure diagram of the task execution device may refer to fig. 7, where the task execution device includes:
the execution unit 701 is configured to execute a target number of tasks in each queue in sequence from high to low in priority of each queue in a predetermined polling period, where the priority of the queue is positively correlated with the target number.
The device provided by the embodiment of the invention can set a plurality of queues in the queue set, poll and start each queue according to the priority order of the queues, and set the number of tasks executed in each round sequence for each queue according to the priority of each queue, wherein the number of tasks executed by the queue with high priority is large, the execution of the tasks is accelerated by a multi-queue polling task execution mode, the problem of queue congestion caused by the fact that a large number of tasks need to be executed is avoided, and the task processing efficiency is further improved.
The device provided by the embodiment of the invention further comprises:
the device comprises a determining unit, a processing unit and a processing unit, wherein the determining unit is used for determining a target task corresponding to a priority execution instruction when the priority execution instruction is received;
the judging unit is used for judging whether the queue where the target task is located is the queue with the highest priority in the queue set;
and the adding unit is used for copying the target task in the queue where the target task is located and adding the copied target task to the queue with the highest priority if the target task is not in the queue with the highest priority.
In the apparatus provided in the embodiment of the present invention, each of the queues has a task execution threshold, and the execution unit includes:
the acquiring subunit is used for acquiring a task execution threshold corresponding to the polled current queue;
the judging subunit is used for judging whether the number of the tasks in the current queue is smaller than the task execution threshold;
an execution subunit, configured to determine, in each task in the current queue, a plurality of tasks and execute the determined plurality of tasks if the number of tasks in the current queue is not less than the task execution threshold, where the number of the plurality of tasks is the task execution threshold; and if the number of the tasks in the current queue is less than the task execution threshold, executing each task in the current queue.
In the apparatus provided in the embodiment of the present invention, the execution subunit includes:
the first determining module is used for determining the queue attribute of the current queue;
the first selection module is used for sequentially selecting a plurality of tasks from the front end of the current queue to the rear end of the current queue if the queue attribute of the current queue represents that the current queue is a first-in first-out queue;
and the second selection module is used for determining the priority of each task in the current queue if the queue attribute of the current queue indicates that the current queue is a priority queue, and sequentially selecting a plurality of tasks according to the sequence from high to low of the priority of each task in the current queue.
In the apparatus provided in the embodiment of the present invention, the execution subunit further includes:
the second determining module is used for determining the current task to be executed;
the first judgment module is used for judging whether execution record information corresponding to the current task to be executed is recorded in the established configuration service;
and the third determining module is used for not executing the current task to be executed and determining the next task of the current task to be executed as the new current task to be executed if the execution record information corresponding to the current task to be executed is recorded in the configuration service.
In the apparatus provided in the embodiment of the present invention, the execution subunit further includes:
the second judging module is used for judging whether cancel indication information which is preset by a user and corresponds to the current task to be executed is set in the configuration service or not if execution record information which corresponds to the current task to be executed is not recorded in the configuration service;
and the execution module is used for executing the current task to be executed if the configuration service is not provided with the cancellation indication information which is preset by the user and corresponds to the current task to be executed.
The task execution device provided by the embodiment of the invention comprises a processor and a memory, wherein the execution unit,
The determining unit, the judging unit, the adding unit, the acquiring subunit, the judging subunit, the executing subunit, the first determining module, the first selecting module, the second determining module, the first judging module, the third determining module, the second judging module and the executing module are all stored in the memory as program units, and the processor executes the program units stored in the memory to realize corresponding functions.
The processor comprises a kernel, and the kernel calls the corresponding program unit from the memory. One or more than one kernel can be set, and the tasks in the queue are dynamically executed by adjusting kernel parameters, so that the condition of task congestion in the queue is reduced, and the working efficiency of the system is improved.
An embodiment of the present invention provides a storage medium on which a program is stored, the program implementing the task execution method when executed by a processor.
The embodiment of the invention provides a processor, which is used for running a program, wherein the task execution method is executed when the program runs.
As shown in fig. 8, an embodiment of the present invention provides an electronic device, where the electronic device 80 includes at least one processor 801, at least one memory 802 connected to the processor 801, and a bus 803; the processor 801 and the memory 802 complete communication with each other through the bus 803; the processor 801 is used to call program instructions in the memory 802 to perform the task execution methods described above. The device herein may be a server, a PC, a PAD, a mobile phone, etc.
The present application further provides a computer program product adapted to perform a program for initializing, when executed on a data processing device, the method applied to a set of queues, wherein a plurality of queues are provided in the set of queues, each queue being provided with a priority corresponding to the queue, and each task to be executed being assigned to a corresponding queue according to its task attribute, the method comprising:
in a preset polling period, according to the sequence of the priority of each queue from high to low, tasks with the target number are sequentially executed in each queue, and the priority of each queue is positively correlated with the target number.
Optionally, in the process of sequentially executing the target number of tasks in each queue, the method further includes:
when a priority execution instruction is received, determining a target task corresponding to the priority execution instruction;
judging whether the queue where the target task is located is the queue with the highest priority in the queue set;
and if the target task is not in the queue with the highest priority, copying the target task in the queue where the target task is located, and adding the copied target task to the queue with the highest priority.
The method above, optionally, wherein each of the queues has a task execution threshold; the executing of the target number of tasks in each queue in turn comprises:
acquiring a task execution threshold corresponding to the polled current queue;
judging whether the number of the tasks in the current queue is smaller than the task execution threshold value;
if the number of the tasks in the current queue is not less than the task execution threshold, determining a plurality of tasks in each task in the current queue, and executing the determined plurality of tasks, wherein the number of the plurality of tasks is the task execution threshold;
and if the number of the tasks in the current queue is less than the task execution threshold, executing each task in the current queue.
Optionally, in the above method, determining a plurality of tasks in each task in the current queue includes:
determining a queue attribute of the current queue;
if the queue attribute of the current queue represents that the current queue is a first-in first-out queue, sequentially selecting a plurality of tasks from the front end of the current queue to the rear end of the current queue;
and if the queue attribute of the current queue indicates that the current queue is a priority queue, determining the priority of each task in the current queue, and sequentially selecting a plurality of tasks according to the sequence from high to low of the priority of each task in the current queue.
The method, optionally, may execute a process of each task in the queue, including:
determining a current task to be executed;
judging whether the established configuration service records execution record information corresponding to the current task to be executed;
and if the configuration service records execution record information corresponding to the current task to be executed, not executing the current task to be executed, and determining a task next to the current task to be executed as a new current task to be executed.
The above method, optionally, further includes:
if the configuration service does not record execution record information corresponding to the current task to be executed, judging whether cancel indication information which is preset by a user and corresponds to the current task to be executed is set in the configuration service;
and if the configuration service is not provided with cancellation indication information which is preset by a user and corresponds to the current task to be executed, executing the current task to be executed.
The above method, optionally, further includes:
and if the configuration service is provided with cancellation indication information which is preset by a user and corresponds to the current task to be executed, skipping the execution process of the current task to be executed.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a device includes one or more processors (CPUs), memory, and a bus. The device may also include input/output interfaces, network interfaces, and the like.
The memory may include volatile memory in a computer readable medium, Random Access Memory (RAM) and/or nonvolatile memory such as Read Only Memory (ROM) or flash memory (flash RAM), and the memory includes at least one memory chip. The memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in the process, method, article, or apparatus that comprises the element.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The above are merely examples of the present application and are not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (10)
1. A task execution method is characterized in that the method is applied to a queue set, a plurality of queues are arranged in the queue set, each queue is provided with a priority corresponding to the queue, and each task to be executed is distributed to the corresponding queue according to the task attribute of the task; the method comprises the following steps:
in a preset polling period, according to the sequence of the priority of each queue from high to low, tasks with the target number are sequentially executed in each queue, and the priority of each queue is positively correlated with the target number.
2. The method of claim 1, wherein executing the target number of tasks in each queue in turn further comprises:
when a priority execution instruction is received, determining a target task corresponding to the priority execution instruction;
judging whether the queue where the target task is located is the queue with the highest priority in the queue set;
and if the target task is not in the queue with the highest priority, copying the target task in the queue where the target task is located, and adding the copied target task to the queue with the highest priority.
3. The method of claim 1, wherein each of said queues has a task execution threshold;
the executing of the target number of tasks in each queue in turn comprises:
acquiring a task execution threshold corresponding to the polled current queue;
judging whether the number of the tasks in the current queue is smaller than the task execution threshold value;
if the number of the tasks in the current queue is not less than the task execution threshold, determining a plurality of tasks in each task in the current queue, and executing the determined plurality of tasks, wherein the number of the plurality of tasks is the task execution threshold;
and if the number of the tasks in the current queue is less than the task execution threshold, executing each task in the current queue.
4. The method of claim 3, wherein determining a plurality of tasks among the tasks in the current queue comprises:
determining a queue attribute of the current queue;
if the queue attribute of the current queue represents that the current queue is a first-in first-out queue, sequentially selecting a plurality of tasks from the front end of the current queue to the rear end of the current queue;
and if the queue attribute of the current queue indicates that the current queue is a priority queue, determining the priority of each task in the current queue, and sequentially selecting a plurality of tasks according to the sequence from high to low of the priority of each task in the current queue.
5. A method according to claim 1 or 3, wherein the process of executing each task in the queue comprises:
determining a current task to be executed;
judging whether the established configuration service records execution record information corresponding to the current task to be executed;
and if the configuration service records execution record information corresponding to the current task to be executed, not executing the current task to be executed, and determining a task next to the current task to be executed as a new current task to be executed.
6. The method of claim 5, further comprising:
if the configuration service does not record execution record information corresponding to the current task to be executed, judging whether cancel indication information which is preset by a user and corresponds to the current task to be executed is set in the configuration service;
and if the configuration service is not provided with cancellation indication information which is preset by a user and corresponds to the current task to be executed, executing the current task to be executed.
7. The method of claim 6, further comprising:
and if the configuration service is provided with cancellation indication information which is preset by a user and corresponds to the current task to be executed, skipping the execution process of the current task to be executed.
8. A task execution device is characterized in that the device is applied to a queue set, a plurality of queues are arranged in the queue set, each queue is provided with a priority corresponding to the queue, and each task to be executed is distributed to the corresponding queue according to the task attribute of the task; the device comprises:
and the execution unit is used for sequentially executing tasks with a target number in each queue according to the sequence of the priorities of the queues from high to low in a preset polling period, wherein the priorities of the queues are positively correlated with the target number.
9. A storage medium comprising stored instructions, wherein the instructions, when executed, control a device on which the storage medium resides to perform a task execution method according to any one of claims 1 to 7.
10. An electronic device comprising at least one processor, and at least one memory, bus connected to the processor; the processor and the memory complete mutual communication through a bus; the processor is used for calling the program instructions in the memory to execute the task execution method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910934408.9A CN112579263A (en) | 2019-09-29 | 2019-09-29 | Task execution method and device, storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910934408.9A CN112579263A (en) | 2019-09-29 | 2019-09-29 | Task execution method and device, storage medium and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112579263A true CN112579263A (en) | 2021-03-30 |
Family
ID=75111304
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910934408.9A Pending CN112579263A (en) | 2019-09-29 | 2019-09-29 | Task execution method and device, storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112579263A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20210075745A1 (en) * | 2019-09-10 | 2021-03-11 | GigaIO Networks, Inc. | Methods and apparatus for improved polling efficiency in network interface fabrics |
| CN113723892A (en) * | 2021-09-13 | 2021-11-30 | 北京沃东天骏信息技术有限公司 | Data processing method and device, electronic equipment and storage medium |
| CN114116184A (en) * | 2022-01-28 | 2022-03-01 | 腾讯科技（深圳）有限公司 | Data processing method and device in virtual scene, equipment and medium |
| CN115550280A (en) * | 2022-11-24 | 2022-12-30 | 云账户技术(天津)有限公司 | Multi-level message queue implementation method, system, electronic device and readable storage medium |
| US11593291B2 (en) | 2018-09-10 | 2023-02-28 | GigaIO Networks, Inc. | Methods and apparatus for high-speed data bus connection and fabric management |
| US11593288B2 (en) | 2019-10-02 | 2023-02-28 | GigalO Networks, Inc. | Methods and apparatus for fabric interface polling |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101458634A (en) * | 2008-01-22 | 2009-06-17 | 中兴通讯股份有限公司 | Load equilibration scheduling method and device |
| CN101510164A (en) * | 2009-03-25 | 2009-08-19 | 北京中星微电子有限公司 | Multi-service scheduling method, apparatus and system |
| US20100211954A1 (en) * | 2009-02-17 | 2010-08-19 | International Business Machines Corporation | Practical contention-free distributed weighted fair-share scheduler |
| CN102799475A (en) * | 2012-06-29 | 2012-11-28 | 东南大学 | Multi-replication fault-tolerant parallel task scheduling method based on task replication |
| CN107423120A (en) * | 2017-04-13 | 2017-12-01 | 阿里巴巴集团控股有限公司 | Method for scheduling task and device |
| CN107943686A (en) * | 2017-10-30 | 2018-04-20 | 北京奇虎科技有限公司 | A kind of test dispatching method, apparatus, server and storage medium |
| CN108762896A (en) * | 2018-03-26 | 2018-11-06 | 福建星瑞格软件有限公司 | One kind being based on Hadoop cluster tasks dispatching method and computer equipment |
| CN109224440A (en) * | 2018-08-24 | 2019-01-18 | 广州要玩娱乐网络技术股份有限公司 | Mission Objective queue processing method and storage medium, computer equipment |
| CN110096353A (en) * | 2019-05-14 | 2019-08-06 | 厦门美图之家科技有限公司 | Method for scheduling task and device |
-
2019
- 2019-09-29 CN CN201910934408.9A patent/CN112579263A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101458634A (en) * | 2008-01-22 | 2009-06-17 | 中兴通讯股份有限公司 | Load equilibration scheduling method and device |
| US20100211954A1 (en) * | 2009-02-17 | 2010-08-19 | International Business Machines Corporation | Practical contention-free distributed weighted fair-share scheduler |
| CN101510164A (en) * | 2009-03-25 | 2009-08-19 | 北京中星微电子有限公司 | Multi-service scheduling method, apparatus and system |
| CN102799475A (en) * | 2012-06-29 | 2012-11-28 | 东南大学 | Multi-replication fault-tolerant parallel task scheduling method based on task replication |
| CN107423120A (en) * | 2017-04-13 | 2017-12-01 | 阿里巴巴集团控股有限公司 | Method for scheduling task and device |
| CN107943686A (en) * | 2017-10-30 | 2018-04-20 | 北京奇虎科技有限公司 | A kind of test dispatching method, apparatus, server and storage medium |
| CN108762896A (en) * | 2018-03-26 | 2018-11-06 | 福建星瑞格软件有限公司 | One kind being based on Hadoop cluster tasks dispatching method and computer equipment |
| CN109224440A (en) * | 2018-08-24 | 2019-01-18 | 广州要玩娱乐网络技术股份有限公司 | Mission Objective queue processing method and storage medium, computer equipment |
| CN110096353A (en) * | 2019-05-14 | 2019-08-06 | 厦门美图之家科技有限公司 | Method for scheduling task and device |
Non-Patent Citations (1)
| Title |
|---|
| 冯径;徐攀;王锦洲;黄伟;: "一种多策略要素的数据访问调度算法", 东南大学学报(自然科学版), no. 05, 20 September 2012 (2012-09-20) * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11593291B2 (en) | 2018-09-10 | 2023-02-28 | GigaIO Networks, Inc. | Methods and apparatus for high-speed data bus connection and fabric management |
| US20210075745A1 (en) * | 2019-09-10 | 2021-03-11 | GigaIO Networks, Inc. | Methods and apparatus for improved polling efficiency in network interface fabrics |
| US11593288B2 (en) | 2019-10-02 | 2023-02-28 | GigalO Networks, Inc. | Methods and apparatus for fabric interface polling |
| CN113723892A (en) * | 2021-09-13 | 2021-11-30 | 北京沃东天骏信息技术有限公司 | Data processing method and device, electronic equipment and storage medium |
| CN114116184A (en) * | 2022-01-28 | 2022-03-01 | 腾讯科技（深圳）有限公司 | Data processing method and device in virtual scene, equipment and medium |
| CN114116184B (en) * | 2022-01-28 | 2022-04-29 | 腾讯科技（深圳）有限公司 | Data processing method and device in virtual scene, equipment and medium |
| CN115550280A (en) * | 2022-11-24 | 2022-12-30 | 云账户技术(天津)有限公司 | Multi-level message queue implementation method, system, electronic device and readable storage medium |
| CN115550280B (en) * | 2022-11-24 | 2023-03-31 | 云账户技术(天津)有限公司 | Multi-level message queue implementation method, system, electronic device and readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112579263A (en) | Task execution method and device, storage medium and electronic equipment | |
| CN110096353B (en) | Task scheduling method and device | |
| CN107682417B (en) | Task allocation method and device for data nodes | |
| US11915042B2 (en) | Techniques for behavioral pairing in a task assignment system | |
| CN109710414B (en) | Job scheduling method, device, equipment and storage medium | |
| US10884667B2 (en) | Storage controller and IO request processing method | |
| CN108874324B (en) | Access request processing method, device, equipment and readable storage medium | |
| CN110213128B (en) | Service port detection method, electronic device and computer storage medium | |
| CN108304272B (en) | Data IO request processing method and device | |
| CN111309644A (en) | Memory allocation method and device and computer readable storage medium | |
| CN105677744A (en) | Method and apparatus for increasing service quality in file system | |
| CN110750350B (en) | Large resource scheduling method, system, device and readable storage medium | |
| CN111190541B (en) | Flow control method of storage system and computer readable storage medium | |
| CN111538629A (en) | Round-robin method and system of server sensor and related device | |
| CN112306827A (en) | Log collection device, method and computer readable storage medium | |
| CN110968420A (en) | Scheduling method and device for multi-crawler platform, storage medium and processor | |
| CN112685158B (en) | Task scheduling method and device, electronic equipment and storage medium | |
| CN115202842A (en) | Task scheduling method and device | |
| CN114090409A (en) | Message processing method and device | |
| CN107544760B (en) | Distributed storage request issuing method, device, equipment and storage medium | |
| CN114945005B (en) | Message processing method and related equipment | |
| CN110012053B (en) | System calling method, device and equipment under SOA system architecture and SOA system architecture | |
| CN112685180B (en) | Computing unit distribution method, computing unit distribution device and computing unit distribution system | |
| CN110968406A (en) | Method, device, storage medium and processor for processing task | |
| CN113381941B (en) | Task scheduling method and device, electronic equipment and computer storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |