WO2017166630A1

WO2017166630A1 - Task priority correctingon method and device

Info

Publication number: WO2017166630A1
Application number: PCT/CN2016/096773
Authority: WO
Inventors: 鲍大磊; 刘永华
Original assignee: 乐视控股（北京）有限公司; 乐视云计算有限公司
Priority date: 2016-03-31
Filing date: 2016-08-25
Publication date: 2017-10-05
Also published as: CN105824698A

Abstract

A task priority correcting method and device, wherein the method comprises: acquiring a waiting time of a current task in a task queue at the current priority, the waiting time comprising a first waiting time, and/or a second waiting time, wherein the first waiting time refers to the time the current task has waited, and the second waiting time refers to the time the current task still has to wait (101); and adjusting the priority of the current task when the waiting time meets a preset condition (102). The time-out problem of tasks with low priority in the task queue, easily occurring during the processing process, can be avoided.

Description

Task priority correction method and device

The present application claims priority to Chinese Patent Application No. 2016102028867, entitled "A Task Priority Correction Method and Apparatus", filed on March 31, 2016, the entire contents of which is incorporated by reference. In this application.

Technical field

The present disclosure relates to the field of data processing, for example, to a task priority correction method and apparatus.

Background technique

The video and audio source files need to be transcoded before they can be uploaded to the server and played on the player. However, the transcoding device has limited resources and cannot handle multiple transcoding tasks at the same time.

A related method of processing a task by a transcoding device is to process a transcoding task according to a priority of a task in the task queue, and prioritize a task with a high priority.

However, there will always be new task insertions in the task queue, which will cause the following problems: Task A exists in the current task queue, and its priority is lower. If the task queue is continuously inserted with tasks with higher priority than task A, The code device will preferentially process the newly inserted task with the priority higher than the task A, then the task A will always be in the state of waiting for the processing, and the task A fails to complete the transcoding within the specified time, which in turn causes the task A to correspond. The video was not available to the user for viewing within the specified time, causing the task A to time out.

Summary of the invention

The embodiment of the present disclosure provides a task priority correction method and apparatus for avoiding the problem that a timeout problem is likely to occur during a process in which a task with a lower priority in a task queue is processed.

The embodiment of the present disclosure provides a task priority correction method, including:

Obtaining a waiting duration of the current task in the task queue under the current priority; the waiting duration includes: a first waiting duration, and/or a second waiting duration; wherein the first waiting duration is that the current task has been waiting The duration of the second waiting period is that the current task still needs to wait for a duration;

When the waiting duration meets the preset condition, the priority of the current task is adjusted.

The embodiment of the present disclosure further provides a task priority correction apparatus, including:

The obtaining unit is configured to obtain a waiting duration of the current task in the task queue at the current priority, where the waiting duration includes: a first waiting duration, and/or a second waiting duration; wherein the first waiting duration is The duration of the current task has been waiting, and the second waiting duration is the length of time that the current task still needs to wait;

The first adjusting unit is configured to adjust a priority of the current task when the waiting time length satisfies a preset condition.

Embodiments of the present disclosure also provide a non-transitory computer readable storage medium storing computer executable instructions that, when executed by an electronic device, cause the electronic device to perform the task priority correction method described above.

Embodiments of the present disclosure also provide a computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions, when the program instructions are executed by a computer The computer is caused to perform the above-described task priority correction method.

Embodiments of the present disclosure also provide an electronic device including at least one processor and a memory communicatively coupled to the at least one processor, the memory configured to store instructions executable by the at least one processor, the instructions When executed by the at least one processor, the at least one processor is caused to perform the task priority correction method described above.

In summary, the task priority correction method and apparatus provided by the embodiments of the present disclosure can adjust the priority of the current task when the current task is under the current priority and the waiting time in the task queue satisfies the preset condition. And coordinate the processing order of the tasks in the task queue, so that the tasks with lower priority can be processed within the specified time after adjusting the priorities, thereby avoiding that the tasks with lower priorities are always waiting for the processed state, and The problem of the task timeout caused, so that the tasks in the task queue can be processed within the specified time.

BRIEF abstract

The one or more embodiments are exemplified by the accompanying drawings in the accompanying drawings, and FIG. The figures in the drawings do not constitute a scale limitation unless otherwise stated.

1 is a flow chart of steps of a first embodiment of a task priority correction method according to the present disclosure;

2 is a flow chart of steps of a second embodiment of a task priority correction method according to the present disclosure;

FIG. 3 is a schematic structural diagram of Embodiment 1 of a task priority correction apparatus according to the present disclosure;

4 is a schematic structural diagram of Embodiment 2 of a task priority correction apparatus according to the present disclosure;

FIG. 5 is a schematic diagram of a hardware structure of an electronic device with task priority correction according to the present disclosure.

Embodiments of the invention

The technical solutions in the embodiments of the present disclosure will be clearly and completely described in conjunction with the drawings in the embodiments of the present disclosure. Some embodiments are disclosed, rather than all of the embodiments. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments of the present disclosure without departing from the inventive scope are the scope of the disclosure.

Method embodiment 1

Referring to FIG. 1 , a flow chart of the steps of the first embodiment of the task priority correction method of the present disclosure is shown, which may include:

Step 101: Obtain a waiting duration of the current task in the task queue according to the current priority; the waiting duration may include: a first waiting duration, and/or a second waiting duration; wherein the first waiting duration is the The current task has been waiting for a duration, and the second waiting duration is a waiting time for the current task;

In the embodiment of the present disclosure, the task type may include: transcoding, uploading, downloading, storing, etc., and the task priority correction method may be used to perform priority modification on a type of task, that is, the embodiment of the present disclosure may be applied. In the process of transcoding, uploading, downloading, and storing video, and/or audio, the embodiment of the present disclosure mainly uses transcoding as an example, and other task types may be referred to each other.

In the embodiment of the present disclosure, the priority of the task is used to indicate the order in which the tasks are processed, and the higher the priority The task will be processed first; the priority of the task can be identified by a numerical value. For example, 0, 100, 200, 300, 400 can be used to identify different priorities from low to high, that is, tasks identified by 0. The lowest priority, the 400 identified task has the highest priority.

It can be understood that the above-mentioned priority is used to identify the priority of the task, which is only a way of identifying the priority of the above task in the embodiment of the present disclosure, and is not understood as a limitation on the priority identifier of the present disclosure. In fact, The task priority may be identified by other means, for example, by using the characters A, B, C, D, E, etc., or by first, second, third, fourth, fifth, etc. to identify the task priority; The method for identifying the priority of the task is not limited in the embodiment of the present disclosure. The embodiment of the present disclosure is mainly described by using a numerical identifier as an example, and other identifiers may be referred to each other.

In the embodiment of the present disclosure, the first waiting duration is the waiting duration of the current task in the task queue, for example, the current task is a transcoding task of the video A, and the current priority of the task is 200. The transcoding task has entered the task queue for 5 minutes, and the first waiting time of the transcoding task is 5 minutes; the second waiting time is the current task at the current priority, and the waiting time is still processed after processing, for example, The current task is the transcoding task of video B. The current priority of the task is 200. Before the transcoding task, there are tasks C and D with priority higher than the transcoding task, and task C and task D transcoding. The total waiting time is 18 minutes, and the second waiting time of the above video B is 18 minutes.

Step 102: When the waiting duration meets a preset condition, adjust a priority of the current task.

In the embodiment of the present disclosure, the preset condition may include: the waiting duration of the current task reaches a preset duration, and the process of adjusting the priority of the current task when the waiting duration meets the preset condition may include When the waiting duration includes the first waiting duration, if the current task is at the current priority, and the waiting duration in the queue reaches the first preset duration, the priority of the current task is adjusted, or when the waiting duration includes the first When the waiting time is long, if the current task is at the current priority, and the current task remains to be processed for a longer duration than the second preset duration, the priority of the current task is adjusted.

For example, if the first preset duration is 5 minutes, the priority of the current task is adjusted when the waiting duration of the current task reaches 5 minutes; or, if the second preset duration is 30 minutes, the current task is still processed until When the waiting time is longer than 30 minutes, the priority of the current task is adjusted so that the priority of the current task is changed to reduce the waiting time for the current task to be processed.

It can be understood that the first preset duration is 5 minutes, and the second preset duration is 30 minutes. An example of the first preset duration and the second preset duration in the embodiment of the present disclosure is not understood as a limitation on the first preset duration and the second preset duration in the embodiment of the present disclosure, and actually The first preset duration and the second preset duration may be determined by a person skilled in the art according to the task requirements. The first preset duration and the second preset duration are not limited herein.

In an optional embodiment of the disclosure, the step of adjusting the priority of the current task may include:

Step A1: The priority of the current task is increased by a first preset amplitude to obtain a new priority of the current task.

Step A2: The new priority of the current task is used as the current priority of the current task, and returns to the acquisition waiting duration.

In the embodiment of the present disclosure, the task priority may be identified by a numerical value, and the first preset amplitude may also be identified by a numerical value, for example, if the priority of the current task is 300, the first preset amplitude is 50, and the current task is If the waiting time in the queue has met the preset condition, the priority of the current task is adjusted, that is, the first preset amplitude 50 is added to the current priority 300 to obtain a new priority 350, and the process returns to step 101. If the current task is still not processed within the preset duration, the priority of the current task is adjusted again, that is, the first preset amplitude 50 is added to the current priority 350 to obtain a new priority 400, and again Return to step 101 until the current task is processed.

In an optional embodiment of the present disclosure, the first preset amplitude may be set with multiple gradients; the first preset amplitude is related to the current priority of the task to be adjusted; the higher the priority, the first The smaller the preset amplitude is;

In the embodiment of the present disclosure, the first preset amplitude may be set with multiple gradients, that is, different priorities correspond to different first preset amplitudes. When the priority of the task is adjusted, the current priority of the task is higher. The corresponding first preset amplitude is smaller.

For example, when the priority of the task is identified by a value of 0 to 400, the gradient of the first preset amplitude can be set as follows: when the priority is in the range of 0 to 100 (including 100), the corresponding first preset amplitude is 100. When the priority is in the range of 100 to 200 (including 200), the corresponding first preset amplitude is 80, and when the priority is in the range of 200 to 300 (including 300), the corresponding first preset amplitude is 60, and priority is given. When the level is in the range of 300 to 400 (including 400), the first preset amplitude of the corresponding priority is 30;

Suppose the current task 3 has a priority of 200, and its waiting time in the queue satisfies the preset condition. The current task is prioritized. If the priority is in the range of 200 to 300, the corresponding first preset amplitude is 60. Therefore, if the priority 200 is increased by 60, the current task 3 has a new priority. The level is 260. It is assumed that there are still tasks 1 and 2 in the current task queue. The corresponding priorities are: 300 and 400. After the current task is adjusted, the processing order in the queue does not change, and the priority is under the new priority. When the waiting time length meets the preset condition again, the priority is adjusted again to obtain a new priority 320. At this time, the priority of the task 3 is higher than the task 2, that is, the task 3 is executed before the task 2. Therefore, the waiting time for task 3 in the task queue is shortened.

That is, in the embodiment of the present disclosure, the first preset amplitude may be a fixed value or a gradient value, which may be determined by a person skilled in the art, and the embodiment of the present disclosure does not apply whether the first preset amplitude is a fixed value. limit.

In summary, the task priority correction method provided by the embodiment of the present disclosure may adjust the priority of the current task when the current task is under the current priority and the waiting time in the task queue satisfies the preset condition, and then Coordinating the processing order of the tasks in the task queue, so that the tasks with lower priority can be processed within the specified time after adjusting the priorities, thereby avoiding that the tasks with lower priorities are always waiting to be processed, thereby causing The problem of task timeout, which in turn allows tasks in the task queue to be processed within a specified time.

Method embodiment two

Referring to FIG. 2, a flow chart of the steps of the second embodiment of the task priority correction method of the present disclosure is shown, which may include:

Step 201: Obtain a waiting duration of the current task in the task queue under the current priority; the waiting duration includes: a first waiting duration, and/or a second waiting duration; wherein the first waiting duration is the current duration The duration of the task has been waited for, and the second waiting duration is the length of time that the current task still needs to wait;

Step 202: When the waiting duration meets a preset condition, adjust a priority of the current task;

Step 203: When a task is completed, search for whether there are other tasks in the task queue that have the same specific attribute identifier and have a lower priority than the completed task.

Step 204: When it is found that there are other tasks in the task queue with the same specific attribute identifier and lower priority than the completed task, the priority of the other tasks is decreased by the second preset range.

In an optional embodiment of the present disclosure, the task is a transcoding task; wherein, the higher the resolution The lower the priority of the transcoding task.

In the embodiment of the present disclosure, the scenario in which the task of the same attribute identifies the same task in the task queue may include: a transcoding task with different resolutions for the same video, where the specific attribute identifier is used to identify the video corresponding to the transcoding task, for example, : transcoding task for SD resolution of video A, transcoding task of HD resolution 2, transcoding task 3 of 1080 resolution, etc., since the above task 1, task 2 and task 3 correspond to transcoding of the same video A The tasks, that is, the specific attribute identifiers of Task 1, Task 2, and Task 3 above are the same.

When the task is processed according to the traditional task queue priority, it is assumed that the priority of the above three tasks is 400, 300 and 200, then the task 1 is processed first, and then the task 2 and the task 3 are processed, because of the tasks 2 and 3. The resolution is higher, so the transcoding takes up more resources, and the transcoding takes longer. If Task 2 and Task 3 always occupy resources, other tasks in the task queue are always waiting to be processed, so it may Causes other tasks not to be processed within the specified time, and will affect the efficiency of the transcoding equipment;

Since task 1 and task 2 and task 3 correspond to the transcoding task of the same video, for the video playing website, it can play a certain video on time, that is, the video of any resolution can be provided to the user on time, other resolutions. The video can be provided to the user at a subsequent time. Based on this, the embodiment of the present disclosure can ensure that one task corresponding to multiple transcoding tasks of the same video A can be completed first, and can be adjusted by other tasks corresponding to the same video A. The priority is such that the priority of other tasks is lowered to give resources to the transcoding tasks of other videos until the resources are idle, and then the other tasks of the video A are processed.

For example, there is a transcoding task for the SD resolution of the video A in the current task queue, a transcoding task of the HD resolution 2, a transcoding task 3 of the 1080 resolution, and a transcoding task 4 for the video B. The priority of each is: 400, 300, 200, 200, then the task 1 is processed first. When the task 1 is completed, the other tasks with the same attribute identifier as the task 1 are searched in the task queue, and the search results are task 2 and task 3. Then, the priorities of task 2 and task 3 are respectively reduced by the second preset amplitude, and if the second preset amplitude is 80, the current priorities of task 2 and task 3 are respectively: 220 and 120, and task 4 at this time If the priority is higher than the task 3, the task 4 can be processed in priority over the task 3. Therefore, all the transcoding tasks of the video A are always processed, and the transcoding task of the video B is always waiting, resulting in the video B. It is not possible to transcode on time, which causes the problem that Video B cannot be delivered to the user on time.

In an optional embodiment of the present disclosure, the second preset amplitude may be set with multiple gradients; The second preset amplitude is related to a current priority of a task to be adjusted; the higher the priority, the larger the second preset amplitude.

In the embodiment of the present disclosure, the second preset amplitude may be set with multiple gradients, that is, different priorities correspond to different second preset amplitudes. When the priority of the task is adjusted, the current priority of the task is higher. The corresponding second preset amplitude is larger.

For example, when the priority of the task is identified by a value of 0 to 400, the gradient of the second preset amplitude can be set as follows: when the priority is in the range of 0 to 100 (including 100), the corresponding second preset amplitude is 30. When the priority is in the range of 100 to 200 (including 200), the corresponding second preset amplitude is 60, and when the priority is in the range of 200 to 300 (including 300), the corresponding second preset amplitude is 80, and priority is given. When the level is in the range of 300 to 400 (including 400), the second preset amplitude of the corresponding priority is 100;

Assume that when task 1 is completed, task 2 and task 3 that are the same as task 1 specific attribute identifiers are found in the task queue, and tasks 2 and 3 correspond to priorities of 300 and 200 respectively. The level is reduced by 80, the new priority of task 2 is 220, the priority of task 3 is reduced by 60, and the new priority of task 3 is 140. If it is assumed that there is a task with priority 200 in the queue at this time, the task is It can be processed before task 3 to be able to shorten the waiting time of the task in the task queue.

That is, in the embodiment of the present disclosure, the second preset amplitude may be a fixed value or a gradient value, which may be determined by a person skilled in the art, and the embodiment of the present disclosure does not apply whether the second preset amplitude is a fixed value. limit.

For the method embodiments, for the sake of brevity, they are all described as a series of action combinations, but those skilled in the art should understand that the embodiments of the present application are not limited by the described action sequence, because the embodiment according to the present application Some steps can be performed in other orders or at the same time. Secondly, those skilled in the art should also understand that the actions involved in the embodiments described in the specification are not necessarily required in the embodiments of the present application.

Device embodiment 1

Referring to FIG. 3, a schematic structural diagram of a first embodiment of a task priority correction apparatus according to the present disclosure is shown, which may include: an obtaining unit 301 and a first adjusting unit 302, where

The obtaining unit 301 may be configured to acquire a waiting duration of the current task in the task queue according to the current priority; the waiting duration may include: a first waiting duration, and/or a second waiting duration; The first waiting duration is a duration of waiting for the current task, and the second waiting duration is a waiting duration of the current task.

The first adjusting unit 302 may be configured to adjust a priority of the current task when the waiting duration meets a preset condition.

In an optional embodiment of the present disclosure, the foregoing first adjusting unit 302 may include:

The first adjustment subunit may be configured to increase the priority of the current task by a first preset amplitude to obtain a new priority of the current task;

Returning to the subunit, the new priority of the current task may be configured as the current priority of the current task, and returned to the acquisition waiting duration.

Device embodiment 2

Referring to FIG. 4, a schematic structural diagram of a second embodiment of a task priority modification apparatus according to the present disclosure is shown, which may include: an obtaining unit 401, a first adjusting unit 402, a searching unit 403, and a second adjusting unit 404, where

The obtaining unit 401 may be configured to acquire a waiting duration of the current task in the task queue according to the current priority; the waiting duration may include: a first waiting duration, and/or a second waiting duration; wherein the first The waiting time is the length of time that the current task has been waiting, and the second waiting time is the length of time that the current task still needs to wait;

The first adjusting unit 402 may be configured to adjust a priority of the current task when the waiting duration meets a preset condition;

The searching unit 403 may be configured to: when a task is completed, find, in the task queue, whether there are other tasks whose specific attribute identifiers are the same and whose priority is lower than the completed task;

The second adjusting unit 404 may be configured to reduce the priority of the other tasks by a second preset range when searching for other tasks in the task queue that have the same specific attribute identifier and lower priority than the completed task. .

In an optional embodiment of the present disclosure, the above task is a transcoding task; wherein the higher the resolution, the lower the priority of the transcoding task.

In an optional embodiment of the present disclosure, the first preset amplitude may be set with multiple gradients;

The first preset amplitude is related to a current priority of a task to be adjusted; the higher the priority, the first The smaller the preset amplitude; or,

The second preset amplitude may be set with a plurality of gradients; the second preset amplitude is related to a current priority of a task to be adjusted; the higher the priority, the larger the second preset amplitude.

For the device embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the description of the method embodiment.

The embodiment of the present application provides a non-volatile computer storage medium storing computer-executable instructions for performing a task priority correction method according to any one of the embodiments of the present application.

FIG. 5 is a schematic diagram of a hardware structure of an electronic device with task priority correction according to the present disclosure. As shown in FIG. 5, the electronic device includes:

One or more processors 510 and memory 520, one processor 510 is taken as an example in FIG.

The apparatus for performing the method of task priority correction may further include: an input device 530 and an output device 540.

The processor 510, the memory 520, the input device 530, and the output device 540 may be connected by a bus or other means, as exemplified by a bus connection in FIG.

The memory 520 is a non-volatile computer readable storage medium, and is applicable to a non-volatile software program, a non-volatile computer-executable program, and a module, as in the task priority correction method in the embodiment of the present application. Program instructions/modules (for example, acquisition unit 401, first adjustment unit 402, lookup unit 403, and second adjustment unit 404 shown in FIG. 4). The processor 510 executes various functional applications of the server and data processing by executing non-volatile software programs, instructions, and modules stored in the memory 520, that is, a method of implementing priority correction of the above-described method embodiments.

The memory 520 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application required for at least one function; the storage data area may store data created by use of the device modified according to the priority, and the like. In addition, the memory 520 may include high speed random access memory. The memory may also include a non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some embodiments, memory 520 can optionally include memory remotely located relative to processor 510 that can be connected to the device for priority correction via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

Input device 530 can receive input numeric or character information, as well as generate key signal inputs related to user settings and function control of the device with priority correction. The output device 540 can include a display device such as a display screen.

The one or more modules are stored in the memory 520, and when executed by the one or more processors 510, perform a method of priority correction in any of the method embodiments described above.

The above products can perform the methods provided by the embodiments of the present application, and have the corresponding functional modules and beneficial effects of the execution method. For technical details that are not described in detail in this embodiment, reference may be made to the method provided by the embodiments of the present application.

The electronic device of the embodiment of the present application exists in various forms, including but not limited to:

(1) Mobile communication devices: These devices are characterized by mobile communication functions and are mainly aimed at providing voice and data communication. Such terminals include: smart phones (such as iPhone), multimedia phones, functional phones, and low-end phones.

(2) Ultra-mobile personal computer equipment: This type of equipment belongs to the category of personal computers, has computing and processing functions, and generally has mobile Internet access. Such terminals include: PDAs, MIDs, and UMPC devices, such as the iPad.

(3) Portable entertainment devices: These devices can display and play multimedia content. Such devices include: audio, video players (such as iPod), handheld game consoles, e-books, and smart toys and portable car navigation devices.

(4) Server: A device that provides computing services. The server consists of a processor, a hard disk, a memory, a system bus, etc. The server is similar to a general-purpose computer architecture, but because of the need to provide highly reliable services, processing power and stability High reliability in terms of reliability, security, scalability, and manageability.

(5) Other electronic devices with data interaction functions.

The device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separate, and the components displayed as units may or may not be physical units, ie may be located A place, or it can be distributed to multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the embodiment. Those of ordinary skill in the art can understand and implement without deliberate labor.

Through the description of the above embodiments, those skilled in the art can clearly understand that the various embodiments can be implemented by means of software plus a general hardware platform, and of course, by hardware. Based on such understanding, the above technical solutions may be embodied in the form of software products in essence or in the form of software products, which may be stored in a computer readable storage medium such as a ROM/RAM or a disk. , an optical disk, etc., includes instructions for causing a computer device (which may be a personal computer, server, or network device, etc.) to perform the methods described in various embodiments or portions of the embodiments.

The above embodiments are only used to illustrate the technical solutions of the present disclosure, and are not intended to be limiting; although the present disclosure has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that The technical solutions are described as being modified, or equivalent to some of the technical features are replaced; and such modifications or substitutions do not depart from the scope of the technical solutions of the embodiments of the present disclosure.

Industrial applicability

The task priority correction method and apparatus provided by the embodiments of the present disclosure can avoid the problem that the task with a lower priority in the task queue is prone to timeout during the processing.

Claims

A task priority correction method is applied to an electronic device, and the method includes:

Obtaining a waiting duration of the current task in the task queue under the current priority; the waiting duration includes: a first waiting duration, and/or a second waiting duration; wherein the first waiting duration is that the current task has been waiting The duration of the second waiting period is that the current task still needs to wait for a duration;

When the waiting duration meets the preset condition, the priority of the current task is adjusted.
The method of claim 1 wherein the method further comprises:

When a task is completed, it is found whether there are other tasks in the task queue that have the same specific attribute identifier and lower priority than the completed task;

When it is found that there are other tasks in the task queue with the same attribute identifier and lower priority than the completed task, the priority of the other tasks is reduced by the second preset range.
The method of claim 2, wherein the task is a transcoding task; wherein the higher the resolution, the lower the priority of the transcoding task.
The method of claim 1, wherein the adjusting the priority of the current task comprises:

Adding a priority of the current task to a first preset amplitude to obtain a new priority of the current task;

The new priority of the current task is taken as the current priority of the current task, and is returned to the acquisition waiting time.
The method according to claim 2 or 4, wherein said first preset amplitude is set with a plurality of gradients;

The first preset amplitude is related to a current priority of a task to be adjusted; the higher the priority, the smaller the first preset amplitude;

or,

The second preset amplitude is set with a plurality of gradients;

The second preset amplitude is related to a current priority of a task to be adjusted; the higher the priority, the larger the second preset amplitude.
A task priority correction device, wherein the device comprises:

The obtaining unit is configured to obtain a waiting duration of the current task in the task queue at the current priority, where the waiting duration includes: a first waiting duration, and/or a second waiting duration; wherein the first waiting duration is The duration of the current task has been waiting, and the second waiting duration is the length of time that the current task still needs to wait;

The first adjusting unit is configured to adjust a priority of the current task when the waiting time length satisfies a preset condition.
The apparatus of claim 6 wherein said apparatus further comprises:

The searching unit is configured to: when a task is completed, find whether there are other tasks in the task queue that have the same specific attribute identifier and have a lower priority than the completed task;

The second adjusting unit is configured to reduce the priority of the other tasks by a second preset range when searching for other tasks in the task queue that have the same specific attribute identifier and lower priority than the completed task.
The apparatus of claim 7, wherein the task is a transcoding task; wherein the higher the resolution, the lower the priority of the transcoding task.
The apparatus of claim 6, wherein the first adjustment unit comprises:

a first adjustment subunit, configured to increase a priority of the current task by a first preset amplitude to obtain a new priority of the current task;

Returning to the subunit, configured to use the new priority of the current task as the current task Pre-priority, return to get waiting time.
The apparatus according to claim 7 or 9, wherein said first preset amplitude is provided with a plurality of gradients;

The first preset amplitude is related to a current priority of a task to be adjusted; the higher the priority, the smaller the first preset amplitude;

or,

The second preset amplitude is set with a plurality of gradients;

The second preset amplitude is related to a current priority of a task to be adjusted; the higher the priority, the larger the second preset amplitude.
A non-transitory computer readable storage medium storing computer executable instructions that, when executed by an electronic device, cause the electronic device to perform the method of any of claims 1-5.
A computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions, when the program instructions are executed by a computer, causing the computer The method of any of claims 1-5.
An electronic device comprising at least one processor and a memory communicatively coupled to the at least one processor, the memory for storing instructions executable by the at least one processor, the instructions being processed by the at least one When executed, the at least one processor is caused to perform the method of any of claims 1-5.