WO2017166630A1 - Procédé et dispositif de correction de priorités de tâches - Google Patents

Procédé et dispositif de correction de priorités de tâches Download PDF

Info

Publication number
WO2017166630A1
WO2017166630A1 PCT/CN2016/096773 CN2016096773W WO2017166630A1 WO 2017166630 A1 WO2017166630 A1 WO 2017166630A1 CN 2016096773 W CN2016096773 W CN 2016096773W WO 2017166630 A1 WO2017166630 A1 WO 2017166630A1
Authority
WO
WIPO (PCT)
Prior art keywords
task
priority
current
waiting
duration
Prior art date
Application number
PCT/CN2016/096773
Other languages
English (en)
Chinese (zh)
Inventor
鲍大磊
刘永华
Original Assignee
乐视控股（北京）有限公司
乐视云计算有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 乐视控股（北京）有限公司, 乐视云计算有限公司 filed Critical 乐视控股（北京）有限公司
Publication of WO2017166630A1 publication Critical patent/WO2017166630A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • 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
    • G06F9/4887—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues involving deadlines, e.g. rate based, periodic

Definitions

  • the present disclosure relates to the field of data processing, for example, to a task priority correction method and apparatus.
  • the video and audio source files need to be transcoded before they can be uploaded to the server and played on the player.
  • 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.
  • 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.
  • 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:
  • 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;
  • 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.
  • the task priority correction method and apparatus 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.
  • FIG. 1 is a flow chart of steps of a first embodiment of a task priority correction method according to the present disclosure
  • FIG. 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
  • Embodiment 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.
  • 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;
  • the task type may include: transcoding, uploading, downloading, storing, etc.
  • 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.
  • the embodiment of the present disclosure mainly uses transcoding as an example, and other task types may be referred to each other.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the first preset duration is 5 minutes
  • 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.
  • 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.
  • the task priority may be identified by a numerical value
  • 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.
  • 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;
  • the first preset amplitude may be set with multiple gradients, that is, different priorities correspond to different first preset amplitudes.
  • the priority of the task is adjusted, the current priority of the task is higher.
  • the corresponding first preset amplitude is smaller.
  • 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;
  • 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.
  • the processing order in the queue does not change, and the priority is under the new priority.
  • 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.
  • 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.
  • the task priority correction method 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.
  • 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.
  • the task is a transcoding task; wherein, the higher the resolution The lower the priority of the transcoding task.
  • 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.
  • 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;
  • 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.
  • 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.
  • transcoding task for the SD resolution of the video A in the current task queue 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.
  • 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.
  • 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.
  • 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.
  • the second preset amplitude may be set with multiple gradients, that is, different priorities correspond to different second preset amplitudes.
  • the priority of the task is adjusted, the current priority of the task is higher.
  • the corresponding second preset amplitude is larger.
  • 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;
  • 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.
  • 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.
  • 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.
  • 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;
  • 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.
  • 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. .
  • the above task is a transcoding task; wherein the higher the resolution, the lower the priority of the transcoding task.
  • 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.
  • 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:
  • 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.
  • 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.
  • 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 electronic device of the embodiment of the present application exists in various forms, including but not limited to:
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the task priority correction method and apparatus can avoid the problem that the task with a lower priority in the task queue is prone to timeout during the processing.

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
  • User Interface Of Digital Computer (AREA)

Abstract

L'invention concerne un procédé et un dispositif de correction de priorités de tâches, le procédé comportant les étapes consistant à: acquérir un temps d'attente d'une tâche courante dans une file d'attente de tâches à la priorité actuelle, le temps d'attente comportant un premier temps d'attente et/ou un deuxième temps d'attente, le premier temps d'attente désignant le temps pendant lequel la tâche courante a attendu, et le deuxième temps d'attente désignant le temps pendant lequel la tâche courante doit encore attendre (101); et régler la priorité de la tâche courante lorsque le temps d'attente satisfait une condition prédéfinie (102). Le problème d'expiration du délai de tâches à basse priorité dans la file d'attente de tâches, qui se produit facilement au cours du processus de traitement, peut être évité.
PCT/CN2016/096773 2016-03-31 2016-08-25 Procédé et dispositif de correction de priorités de tâches WO2017166630A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610202886.7 2016-03-31
CN201610202886.7A CN105824698A (zh) 2016-03-31 2016-03-31 一种任务优先级修正方法和装置

Publications (1)

Publication Number Publication Date
WO2017166630A1 true WO2017166630A1 (fr) 2017-10-05

Family

ID=56525497

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/096773 WO2017166630A1 (fr) 2016-03-31 2016-08-25 Procédé et dispositif de correction de priorités de tâches

Country Status (2)

Country Link
CN (1) CN105824698A (fr)
WO (1) WO2017166630A1 (fr)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110059902A (zh) * 2018-01-19 2019-07-26 招商局国际信息技术有限公司 场桥调度方法、装置、计算机设备和存储介质
CN110955502A (zh) * 2018-09-27 2020-04-03 北京国双科技有限公司 一种任务调度方法及装置
CN111401639A (zh) * 2020-03-18 2020-07-10 京东方科技集团股份有限公司 物料投送方法及装置
CN112000454A (zh) * 2020-08-27 2020-11-27 平安国际智慧城市科技股份有限公司 一种多媒体数据的处理方法及设备
CN112291068A (zh) * 2020-11-02 2021-01-29 西安博康硕达网络科技有限公司 一种基于云存储的多媒体数据处理方法
CN112463339A (zh) * 2020-12-11 2021-03-09 北京浪潮数据技术有限公司 一种多任务调度方法、系统、设备及存储介质
CN113312511A (zh) * 2021-06-11 2021-08-27 北京百度网讯科技有限公司 用于推荐内容的方法、装置、设备和计算机可读存储介质
CN114034493A (zh) * 2021-11-04 2022-02-11 杭州海康汽车软件有限公司 自动泊车调试方法、装置和系统
CN114697299A (zh) * 2022-04-21 2022-07-01 湖南快乐阳光互动娱乐传媒有限公司 一种音视频转码优先级确定方法、系统、装置及存储介质

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105824698A (zh) * 2016-03-31 2016-08-03 乐视控股（北京）有限公司 一种任务优先级修正方法和装置
CN107124635B (zh) * 2017-06-06 2021-01-22 北京奇艺世纪科技有限公司 一种视频的上线方法、视频管理系统和直播系统
CN107577523B (zh) * 2017-07-31 2021-01-05 创新先进技术有限公司 一种任务执行的方法及装置
CN108920264B (zh) * 2018-06-12 2020-08-28 深圳市德明利技术股份有限公司 一种命令超时处理方法及系统
CN111552548A (zh) * 2020-04-22 2020-08-18 北京金山云网络技术有限公司 一种任务处理方法、装置、电子设备及机器可读存储介质
CN115460154B (zh) * 2022-09-21 2024-05-10 北京东土军悦科技有限公司 一种优先级调整方法、装置及电子设备

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1648139A1 (fr) * 2004-10-07 2006-04-19 Schneider Electric Industries Sas Dispositif et procédé de communication à contrôle de priorité
CN101216783A (zh) * 2007-12-29 2008-07-09 中国建设银行股份有限公司 一种针对多事务进行优化排序处理的方法
CN101996099A (zh) * 2010-11-17 2011-03-30 山东中创软件工程股份有限公司 一种消息处理方法及系统
CN105824698A (zh) * 2016-03-31 2016-08-03 乐视控股（北京）有限公司 一种任务优先级修正方法和装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1648139A1 (fr) * 2004-10-07 2006-04-19 Schneider Electric Industries Sas Dispositif et procédé de communication à contrôle de priorité
CN101216783A (zh) * 2007-12-29 2008-07-09 中国建设银行股份有限公司 一种针对多事务进行优化排序处理的方法
CN101996099A (zh) * 2010-11-17 2011-03-30 山东中创软件工程股份有限公司 一种消息处理方法及系统
CN105824698A (zh) * 2016-03-31 2016-08-03 乐视控股（北京）有限公司 一种任务优先级修正方法和装置

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110059902A (zh) * 2018-01-19 2019-07-26 招商局国际信息技术有限公司 场桥调度方法、装置、计算机设备和存储介质
CN110059902B (zh) * 2018-01-19 2023-04-21 招商局国际信息技术有限公司 场桥调度方法、装置、计算机设备和存储介质
CN110955502B (zh) * 2018-09-27 2022-07-05 北京国双科技有限公司 一种任务调度方法及装置
CN110955502A (zh) * 2018-09-27 2020-04-03 北京国双科技有限公司 一种任务调度方法及装置
CN111401639A (zh) * 2020-03-18 2020-07-10 京东方科技集团股份有限公司 物料投送方法及装置
CN112000454A (zh) * 2020-08-27 2020-11-27 平安国际智慧城市科技股份有限公司 一种多媒体数据的处理方法及设备
CN112291068A (zh) * 2020-11-02 2021-01-29 西安博康硕达网络科技有限公司 一种基于云存储的多媒体数据处理方法
CN112291068B (zh) * 2020-11-02 2023-08-18 重庆捷旭科技有限公司 一种基于云存储的多媒体数据处理方法
CN112463339A (zh) * 2020-12-11 2021-03-09 北京浪潮数据技术有限公司 一种多任务调度方法、系统、设备及存储介质
CN112463339B (zh) * 2020-12-11 2024-07-02 北京浪潮数据技术有限公司 一种多任务调度方法、系统、设备及存储介质
CN113312511A (zh) * 2021-06-11 2021-08-27 北京百度网讯科技有限公司 用于推荐内容的方法、装置、设备和计算机可读存储介质
CN113312511B (zh) * 2021-06-11 2024-02-27 北京百度网讯科技有限公司 用于推荐内容的方法、装置、设备和计算机可读存储介质
CN114034493A (zh) * 2021-11-04 2022-02-11 杭州海康汽车软件有限公司 自动泊车调试方法、装置和系统
CN114697299A (zh) * 2022-04-21 2022-07-01 湖南快乐阳光互动娱乐传媒有限公司 一种音视频转码优先级确定方法、系统、装置及存储介质
CN114697299B (zh) * 2022-04-21 2024-05-10 湖南快乐阳光互动娱乐传媒有限公司 一种音视频转码优先级确定方法、系统、装置及存储介质

Also Published As

Publication number Publication date
CN105824698A (zh) 2016-08-03

Similar Documents

Publication Publication Date Title
WO2017166630A1 (fr) Procédé et dispositif de correction de priorités de tâches
WO2017177630A1 (fr) Procédé et dispositif destinés à recommander des informations personnalisées
WO2017185616A1 (fr) Procédé de stockage de fichiers et équipement électronique
US20170171278A1 (en) Method and electronic device for continuously playing video
WO2017107542A1 (fr) Procédé, dispositif, et système d'obtention de programme vidéo
US20170185454A1 (en) Method and Electronic Device for Determining Resource Consumption of Task
WO2017113840A1 (fr) Procédé et dispositif de recommandation d'informations
US20170195387A1 (en) Method and Electronic Device for Increasing Start Play Speed
US20170171571A1 (en) Push Video Documentation Methods and Appliances
WO2017197888A1 (fr) Procédé de partage d'informations, terminal intelligent et système
US20170195617A1 (en) Image processing method and electronic device
US10802939B2 (en) Method for scanning cache of application and electronic device
US20170195384A1 (en) Video Playing Method and Electronic Device
US20170237816A1 (en) Method and electronic device for identifying device
WO2017113708A1 (fr) Procédé et dispositif de lecture vidéo
US20170048586A1 (en) Methods and apparatuses for operating and playing a channel of a smart tv set
WO2017107531A1 (fr) Procédé de réglage de volume et dispositif terminal
US20170155739A1 (en) Advertisement data processing method and router
US20170171339A1 (en) Advertisement data transmission method, electrnoic device and system
CN106815042A (zh) 刷新页面的动态加载方法、装置及电子设备
US20220167043A1 (en) Method and system for playing streaming content
WO2017166640A1 (fr) Procédé et terminal d'appel d'application
US20170188214A1 (en) Method and electronic device for sharing multimedia information
US9251359B2 (en) Method and apparatus for managing crowd sourced content creation
US20170192750A1 (en) Numeric conversion method and electronic device

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16896400

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 16896400

Country of ref document: EP

Kind code of ref document: A1