WO2019041824A1 - Procédé de planification de tâches, et serveur - Google Patents

Procédé de planification de tâches, et serveur Download PDF

Info

Publication number
WO2019041824A1
WO2019041824A1 PCT/CN2018/083048 CN2018083048W WO2019041824A1 WO 2019041824 A1 WO2019041824 A1 WO 2019041824A1 CN 2018083048 W CN2018083048 W CN 2018083048W WO 2019041824 A1 WO2019041824 A1 WO 2019041824A1
Authority
WO
WIPO (PCT)
Prior art keywords
task
executed
tasks
executed tasks
priority
Prior art date
Application number
PCT/CN2018/083048
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 WO2019041824A1 publication Critical patent/WO2019041824A1/fr

Links

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

Definitions

  • the present application belongs to the technical field of task scheduling, and in particular, to a task scheduling method and a server.
  • the quartz function in the spring software is generally used to complete. If the dependencies between the various tasks are involved, it needs to be controlled indirectly through some identification records. At this time, the tasks are basically isolated, which makes the system unable to conveniently control and manage each task.
  • the embodiment of the present application provides a task scheduling method and a server, so as to solve the problem that the isolation between tasks in the prior art can not easily control and manage each task.
  • a task scheduling method provided by the application includes:
  • the low priority pending task is not sent to the corresponding task performer.
  • the embodiment of the present application has the beneficial effects that: in the embodiment of the present application, each task to be executed sent by each task requester is first obtained, each task to be executed is detected, and the current priority order of each task to be executed is obtained. Sending each to-be-executed task to the corresponding task performer in order of priority level, so that the corresponding task performer executes each to-be-executed task; and the high-priority pending task is not executed by the corresponding task performer When successful, the low-priority tasks to be executed are not sent to the corresponding task executors, and the tasks to be executed are uniformly controlled and scheduled by each task requester, so that the scheduled execution of the tasks to be executed can be performed more safely and accurately. .
  • FIG. 1 is a flowchart of an implementation of a task scheduling method provided by an embodiment of the present application
  • step S102 in FIG. 1 is a flowchart of an implementation of step S102 in FIG. 1;
  • FIG. 3 is a flowchart of an implementation of step S103 in FIG. 1;
  • FIG. 4 is a schematic diagram of an operating environment of a task scheduler according to an embodiment of the present application.
  • FIG. 5 is a block diagram of a program of a task scheduler according to an embodiment of the present application.
  • FIG. 1 is a flowchart showing an implementation process of a task scheduling method according to Embodiment 1 of the present application, which is described in detail as follows:
  • Step S101 Acquire each to-be-executed task sent by each task requester.
  • the task requester is the party that initiates the task to be executed, and is opposite to the task performer in the subsequent step, and the task performer is the party that executes each task to be executed.
  • the tasks to be executed may include real-time tasks, quasi-real-time tasks, and other tasks.
  • Real-time tasks mainly refer to tasks with high urgency requirements and immediate execution by task performers.
  • Quasi-real-time tasks mainly mean that the urgency requirements are not high, but the task execution instructions must also be forwarded to the task executor within a limited time (for example, within 10 minutes).
  • Other tasks are tasks with low urgency requirements and no requirements for execution time or long time.
  • Step S102 Detect each of the to-be-executed tasks, and obtain a current priority order of each of the to-be-executed tasks.
  • the step S102 is specifically: detecting each of the to-be-executed tasks once every preset time, and acquiring a current priority order of each of the to-be-executed tasks.
  • step S101 the task to be executed sent by the task requester is continuously acquired in step S101, and therefore the acquired task to be executed needs to be updated.
  • each of the acquired tasks to be executed is detected once every preset time, and then the current priority order of each task to be executed is determined.
  • the to-be-executed task may include task execution time information, task performer information, task requester information, and the like.
  • the to-be-executed task includes task execution time information, and step S102 may include the following steps:
  • Step S201 Detect task execution time of each of the to-be-executed tasks.
  • the task to be executed corresponds to a task execution time, and the task execution time may be a time segment or a time point.
  • the task execution time may be a time segment or a time point.
  • two pending tasks are acquired at 16:00, the task execution time in the first pending task is 16:05, and the task execution time of the second pending task is 16:10 ⁇ 16:20. That is, the task execution time of the first task to be executed is the time point, and the task execution time of the second task to be executed is the time period.
  • Step S202 Determine a current priority order of each of the to-be-executed tasks according to a task execution time of each of the to-be-executed tasks.
  • the current priority order of each task to be executed is determined by the task execution time of each task to be executed.
  • the priority sequence of the task execution time may be taken as the priority order of each task to be executed, that is, the priority of the task to be executed with the task execution time being higher is higher, and the priority of the task to be executed after the task execution time is later. low.
  • each of the to-be-executed tasks is sent to the corresponding one according to the determined priority order of each to-be-executed task.
  • the task executor is such that the respective task executor executes each of the to-be-executed tasks. Specifically, when the high priority pending task is not successfully executed by the corresponding task performer, the low priority pending task is not sent to the corresponding task performer.
  • the three tasks to be executed are the first task to be executed, the second task to be executed, and the third task to be executed.
  • the task execution time of the first task to be executed is 16:05
  • the task execution time of the second task to be executed is For 16:10 ⁇ 16:20
  • the task execution time of the third task to be executed is 16:40
  • the priority order of the three tasks to be executed is the first task to be executed and the second task to be executed in descending order.
  • the third task to be performed is the third task to be performed.
  • Step S103 Send each of the to-be-executed tasks to the corresponding task performers in order according to the priority level, so that the corresponding task performers execute each of the to-be-executed tasks.
  • the low priority pending task is not sent to the corresponding task performer.
  • the three tasks to be executed are the first task to be executed, the second task to be executed, and the third task to be executed.
  • the task execution time of the first task to be executed is 16:05
  • the task execution time of the second task to be executed is For 16:10 ⁇ 16:20
  • the task execution time of the third task to be executed is 16:40
  • the priority order of the three tasks to be executed is the first task to be executed and the second task to be executed in descending order.
  • the third task to be performed is the third task to be performed.
  • the second to-be-executed task and the third-generation execution task are not sent to the corresponding task execution party; until the first to-be-executed task is successfully executed, The second task to be executed is sent to the corresponding task performer to execute; when the second task to be executed is executed or not executed successfully, the third task to be executed is not sent to the corresponding task performer until the second task to be executed When the execution is successful, the third pending task is sent to the corresponding task performer for execution.
  • step S103 may include the following steps:
  • Step S301 sequentially send each of the to-be-executed tasks to a client corresponding to the corresponding task executor in order of priority.
  • the number of the client is multiple, and one client corresponds to one task performer.
  • Each client is deployed on the host of the task executor and can execute the shell script of the task executor.
  • the deployment mode of each client in the task executor can be a single point deployment mode, HA (Hadoop) deployment mode, cluster (cluster) deployment mode or component deployment mode.
  • each to-be-executed task may be sequentially sent to the client corresponding to the corresponding task executor in order of priority, so that the client causes the task executor to execute the to-be-executed task.
  • each of the to-be-executed tasks may be sequentially sent to the client corresponding to the corresponding task executor in order of the task execution time of each task to be executed, so that the client causes the task executor to execute the to-be-executed task.
  • Step S302 The client controls the corresponding task performer to execute the to-be-executed task by using a shell script according to the to-be-executed task.
  • the task scheduling method in this embodiment is applicable to a task management center, and the task management center includes a task scheduling center and a plurality of clients.
  • the task scheduling center initiates a call instruction to the task performer according to the task requester or the established policy; the task dispatch center is responsible for controlling each pending task, for example, monitoring the task execution time, and executing the task in the previous zone before the task execution time is not executed or When the execution is not successful, the execution instruction of the next execution task after the execution time is not sent to the corresponding task execution agent, until the execution of the previous execution task is successful, and then the execution instruction of the next execution task is generated and sent to The corresponding client executes the task to be executed through the client control task executive. Through the task management center to control each task to be executed, the scheduling execution of each task to be executed can be performed more safely and accurately.
  • the data interaction process between the task requester, the task scheduling center, the client, and the task performer is as follows:
  • the task requester sends the real-time task request to the task dispatching center.
  • the real-time task is directly requested by the task initiator to the task dispatching center, and the task executing party is immediately called to perform the task to be executed.
  • the task scheduling center After obtaining the real-time task request, the task scheduling center generates a real-time task execution instruction according to the task execution party and the like in the real-time task request, and sends the command to the corresponding client through the interface;
  • the client controls the corresponding task performer to execute the real-time task in the real-time task execution instruction according to the real-time task execution instruction.
  • the data interaction process between the task requester, the task scheduling center, the client, and the task performer is as follows:
  • the task requester sends the quasi-real-time task request to the task dispatching center, and the quasi-real-time task is the request directly from the task requesting party to the dispatching center, and the dispatching center initiates an execution instruction to the task executing party within a certain time according to the actual situation;
  • the task scheduling center After obtaining the quasi-real-time task request, the task scheduling center generates a quasi-real-time task execution instruction according to the task name, the task execution time, and the client corresponding to the task in the quasi-real-time task request, and passes the interface at a certain time according to the actual situation. Send to the corresponding client.
  • the quasi-real-time task may forward the instruction to invoke the task to the servant within 10 minutes after receiving the requestor system call instruction;
  • the client controls the task performer to execute the quasi-real-time task in the quasi-real-time task execution instruction according to the quasi-real-time task execution instruction.
  • the task scheduling method firstly acquires each to-be-executed task sent by each task requester, detects each to-be-executed task, and obtains the current priority order of each to-be-executed task, and sequentially sends each to-be-executed task to the corresponding one according to the priority level.
  • the task executor so that the corresponding task executor executes each task to be executed; and when the high priority task to be executed is not successfully executed by the corresponding task executor, the low priority task to be executed is not sent to the corresponding task
  • the task executor performs unified control scheduling on each task to be executed of each task requester, so that the scheduling execution of the task to be executed can be performed more safely and accurately.
  • FIG. 4 is a schematic diagram showing an operating environment of the task scheduling program provided by the embodiment of the present application. For the convenience of explanation, only the parts related to the present embodiment are shown.
  • the task scheduler 400 is installed and runs in the server 40.
  • the server 40 can include, but is not limited to, a memory 401 and a processor 402.
  • Figure 4 shows only server 40 with components 401-402, but it should be understood that not all illustrated components may be implemented, and more or fewer components may be implemented instead.
  • the memory 401 includes at least one type of computer readable storage medium, which in some embodiments may be an internal storage unit of the server 40, such as a hard disk or memory of the server 40.
  • the memory 401 may also be an external storage device of the server 40 in other embodiments, such as a plug-in hard disk equipped on the server 40, a smart memory card (SMC), and a secure digital number (Secure). Digital, SD) cards, flash cards, etc.
  • the memory 401 may also include both an internal storage unit of the server 40 and an external storage device.
  • the memory 401 is configured to store application software and various types of data installed in the server 40, such as program codes of the task scheduler 400.
  • the memory 401 can also be used to temporarily store data that has been output or is about to be output.
  • the processor 402 can be a central processor (Central) A processing unit (CPU), a microprocessor or other data processing chip for running program code or processing data stored in the memory 401, such as executing the task scheduler 400 and the like.
  • Central central processor
  • CPU central processor
  • microprocessor or other data processing chip for running program code or processing data stored in the memory 401, such as executing the task scheduler 400 and the like.
  • server 40 may also include a display.
  • the display may be an LED display, a liquid crystal display, a touch liquid crystal display, and an OLED (Organic) in some embodiments. Light-Emitting Diode, organic light-emitting diodes, etc.
  • the display is for displaying information processed in the server 40 and a user interface for displaying visualizations, such as a task scheduling interface or the like.
  • the components 401-42 of the server 40 communicate with one another via a system bus.
  • FIG. 5 is a program module diagram of the task scheduler 400 provided by the embodiment of the present application.
  • the task scheduler 400 may be divided into one or more modules, and the one or more modules are stored in the memory 401 and executed by one or more processors (this implementation)
  • the processor 402 is executed to complete the application.
  • the task scheduler 400 can be divided into a task acquisition module 501, a detection module 502, and an execution module 503 to be executed.
  • a module referred to in this application refers to a series of computer readable instruction instruction segments capable of performing a particular function, and is more suitable than the program to describe the execution of the task scheduler 400 in the server 40. The following description will specifically describe the functions of the program modules 501-503.
  • the task to be executed 501 is configured to acquire each task to be executed sent by each task requester.
  • the detecting module 502 is configured to detect each of the to-be-executed tasks, and obtain a current priority order of each of the to-be-executed tasks.
  • the executing module 503 is configured to sequentially send each of the to-be-executed tasks to the corresponding task performers in order of priority, so that the corresponding task performers execute the respective to-be-executed tasks. Wherein, when the high priority pending task is not successfully executed by the corresponding task performer, the low priority pending task is not sent to the corresponding task performer.
  • the detecting module 502 is configured to: detect each of the to-be-executed tasks once every preset time, and obtain a current priority order of each of the to-be-executed tasks.
  • the detecting module 502 can include a time detecting unit and a priority determining unit.
  • the time detecting unit is configured to detect a task execution time of each of the to-be-executed tasks.
  • the priority determining unit is configured to determine a current current priority order of each of the to-be-executed tasks according to a task execution time of each of the to-be-executed tasks.
  • the execution module 503 can include a sending unit and an executing unit.
  • the sending unit is configured to sequentially send each of the to-be-executed tasks to an execution unit corresponding to a corresponding task executor according to a priority level; each execution unit corresponds to one client, and the number of the client is multiple One of the clients corresponds to a task performer.
  • the execution unit is configured to execute, by using a shell script, a corresponding task execution party to execute the to-be-executed task according to the to-be-executed task.
  • the to-be-executed task includes task execution time information and task performer identification information; each task performer identification information corresponds to one of the clients.
  • the sending unit is specifically configured to: send each of the to-be-executed tasks to a client corresponding to the task performer identification information in each of the to-be-executed tasks according to a priority level.
  • each functional unit and module in the foregoing system may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit, and the integrated unit may be implemented by hardware.
  • Formal implementation can also be implemented in the form of software functional units.
  • the specific names of the respective functional units and modules are only for the purpose of facilitating mutual differentiation, and are not intended to limit the scope of protection of the present application.

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Debugging And Monitoring (AREA)

Abstract

La présente invention relève du domaine technique de la planification de tâches, et concerne un de planification de tâches, et un serveur. Le procédé consiste à : obtenir des tâches à exécuter envoyées par des demandeurs de tâches ; détecter les tâches à exécuter, et obtenir un ordre de priorité actuel des tâches à exécuter ; et envoyer séquentiellement les tâches à exécuter à des exécuteurs de tâches correspondants selon un ordre décroissant de priorités de sorte à permettre aux exécuteurs de tâches correspondants d'exécuter les tâches à exécuter, sachant que si une tâche de haute priorité à exécuter n'est pas exécutée avec succès par l'exécuteur de tâches correspondant, aucune tâche de faible priorité à exécuter n'est envoyée à l'exécuteur de tâches correspondant. Selon le procédé de planification de tâches et le serveur décrits dans l'invention, les tâches à exécuter des demandeurs de tâches sont commandées et programmées de manière unifiée de sorte que l'exécution planifiée des tâches à exécuter peut être exécutée de manière plus sûre et précise.
PCT/CN2018/083048 2017-08-29 2018-04-13 Procédé de planification de tâches, et serveur WO2019041824A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710756348.7A CN108255589A (zh) 2017-08-29 2017-08-29 任务调度方法及服务器
CN201710756348.7 2017-08-29

Publications (1)

Publication Number Publication Date
WO2019041824A1 true WO2019041824A1 (fr) 2019-03-07

Family

ID=62721189

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/083048 WO2019041824A1 (fr) 2017-08-29 2018-04-13 Procédé de planification de tâches, et serveur

Country Status (2)

Country Link
CN (1) CN108255589A (fr)
WO (1) WO2019041824A1 (fr)

Families Citing this family (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110750341B (zh) * 2018-07-24 2022-08-02 深圳市优必选科技有限公司 任务调度方法、装置、系统、终端设备及存储介质
CN109213586A (zh) * 2018-08-23 2019-01-15 北京奇虎科技有限公司 一种任务的调度方法及装置
CN111381956B (zh) * 2018-12-28 2024-02-27 杭州海康威视数字技术股份有限公司 一种任务处理的方法、装置及云分析系统
CN109816338A (zh) * 2019-01-03 2019-05-28 深圳壹账通智能科技有限公司 企业奖惩处理方法、装置、计算机设备和存储介质
CN110083712A (zh) * 2019-03-12 2019-08-02 平安科技（深圳）有限公司 一种数据读取方法、系统及终端设备
CN110162388A (zh) * 2019-04-26 2019-08-23 深圳智链物联科技有限公司 一种任务调度方法、系统及终端设备
CN110334011B (zh) * 2019-05-31 2023-03-17 浙江口碑网络技术有限公司 一种执行测试用例的方法及装置
CN110347602B (zh) * 2019-07-11 2023-08-22 中国工商银行股份有限公司 多任务脚本执行方法及装置、电子设备及可读存储介质
CN110489217A (zh) * 2019-07-11 2019-11-22 新华三大数据技术有限公司 一种任务调度方法及系统
CN111124566A (zh) * 2019-11-29 2020-05-08 苏州浪潮智能科技有限公司 一种bmc用户界面操作的管理方法、设备及可读介质
CN111309475B (zh) * 2020-01-21 2022-12-02 上海万物新生环保科技集团有限公司 一种检测任务执行方法及设备
CN111338967B (zh) * 2020-03-09 2023-12-05 京东科技控股股份有限公司 一种分流测试方法、装置、电子设备及存储介质
CN111400005A (zh) * 2020-03-13 2020-07-10 北京搜狐新媒体信息技术有限公司 一种数据处理方法、装置及电子设备
CN111651272B (zh) * 2020-05-28 2023-02-03 苏州大学 一种嵌入式实时操作的线程时间管理方法及装置
CN114095487B (zh) * 2020-07-30 2024-03-19 中移(苏州)软件技术有限公司 一种远程任务执行方法、装置及存储介质
CN111858012A (zh) * 2020-08-05 2020-10-30 杭州安恒信息技术股份有限公司 一种任务调度方法、装置、设备及介质
CN113177680A (zh) * 2021-03-10 2021-07-27 广州明珞自动化有限公司 一种任务执行系统、任务执行方法及生产系统
CN113641493A (zh) * 2021-08-11 2021-11-12 杭州安恒信息技术股份有限公司 一种任务推送方法、装置、设备及计算机可读存储介质
CN113723936B (zh) * 2021-10-12 2023-11-14 国网安徽省电力有限公司宿州供电公司 一种电力工程质量监督管理方法及系统
CN114253683B (zh) 2021-11-26 2022-11-01 北京百度网讯科技有限公司 任务处理方法、装置、电子设备及存储介质
CN114418282A (zh) * 2021-12-08 2022-04-29 交控科技股份有限公司 车站场景管理方法、装置、设备及计算机程序产品
WO2023225938A1 (fr) * 2022-05-26 2023-11-30 Citrix Systems, Inc. Systèmes et procédés de planification de tâches à participants multiples
CN114896050B (zh) * 2022-07-12 2022-09-30 北京云枢创新软件技术有限公司 一种基于集群资源的任务调度方法及系统

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101063947A (zh) * 2006-04-27 2007-10-31 国际商业机器公司 便于确定作业的调度优先级的方法和系统
CN101169741A (zh) * 2006-10-25 2008-04-30 国际商业机器公司 确定作业的调度优先级的方法和系统
CN101452399A (zh) * 2007-12-05 2009-06-10 中兴通讯股份有限公司 任务二级调度模块及方法
CN102395108A (zh) * 2011-11-28 2012-03-28 苏州迈普信息技术有限公司 基于移动定位的联动救援方法
CN102421060A (zh) * 2011-11-28 2012-04-18 苏州迈普信息技术有限公司 基于gis的旅游团队突发情况管理系统

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH02311932A (ja) * 1989-05-29 1990-12-27 Oki Electric Ind Co Ltd 優先制御方式
CN101202761B (zh) * 2007-12-04 2010-11-03 赵晓宇 一种分布式资源调度系统及其方法
CN101561768A (zh) * 2008-04-18 2009-10-21 北京闻言科技有限公司 一种通用的调度多个任务的方法
CN101741885A (zh) * 2008-11-19 2010-06-16 珠海市西山居软件有限公司 分布式系统及分布式系统处理任务流的方法
CN102023895A (zh) * 2010-11-25 2011-04-20 广东雅达电子股份有限公司 一种具有优先级任务切换的单片机编程方法
CN104346215A (zh) * 2013-08-07 2015-02-11 中兴通讯股份有限公司 一种任务调度服务系统及方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101063947A (zh) * 2006-04-27 2007-10-31 国际商业机器公司 便于确定作业的调度优先级的方法和系统
CN101169741A (zh) * 2006-10-25 2008-04-30 国际商业机器公司 确定作业的调度优先级的方法和系统
CN101452399A (zh) * 2007-12-05 2009-06-10 中兴通讯股份有限公司 任务二级调度模块及方法
CN102395108A (zh) * 2011-11-28 2012-03-28 苏州迈普信息技术有限公司 基于移动定位的联动救援方法
CN102421060A (zh) * 2011-11-28 2012-04-18 苏州迈普信息技术有限公司 基于gis的旅游团队突发情况管理系统

Also Published As

Publication number Publication date
CN108255589A (zh) 2018-07-06

Similar Documents

Publication Publication Date Title
WO2019041824A1 (fr) Procédé de planification de tâches, et serveur
CN107957903B (zh) 异步任务调度方法、服务器及存储介质
US9513962B2 (en) Migrating a running, preempted workload in a grid computing system
EP3230860B1 (fr) Technologies pour des barrières de synchronisation efficaces avec support de vol de travail
US8424007B1 (en) Prioritizing tasks from virtual machines
US9778962B2 (en) Method for minimizing lock contention among threads when tasks are distributed in multithreaded system and apparatus using the same
US11630692B2 (en) Efficient worker utilization
US9262220B2 (en) Scheduling workloads and making provision decisions of computer resources in a computing environment
KR101332840B1 (ko) 병렬 컴퓨팅 프레임워크 기반의 클러스터 시스템, 호스트 노드, 계산 노드 및 어플리케이션 실행 방법
WO2019179026A1 (fr) Dispositif électronique, procédé de génération automatique d'un nom de domaine d'accès de groupe, et support de stockage
US20110161976A1 (en) Method to reduce queue synchronization of multiple work items in a system with high memory latency between processing nodes
JP2014123365A (ja) ＭａｐＲｅｄｕｃｅフレームワークにおけるデータ処理の最適化のためのデバイスおよび方法
WO2017107843A1 (fr) Procédé et appareil de traitement de tâches périodiques, programme informatique et support lisible
US9229716B2 (en) Time-based task priority boost management using boost register values
CN109791502B (zh) 针对异构设备类型的对等分布式计算系统
WO2020026010A2 (fr) Procédé de contrôle d'exécution de tâches, dispositif, équipement/terminal/ serveur et support d'informations
US9170839B2 (en) Method for job scheduling with prediction of upcoming job combinations
US11301304B2 (en) Method and apparatus for managing kernel services in multi-core system
EP3401784A1 (fr) Système de traitement multicore
US9430338B2 (en) Method and computing device for recording log entries
US8327378B1 (en) Method for gracefully stopping a multi-threaded application
KR101674324B1 (ko) 실시간 제어 응용에 적용되는 태스크 스케쥴링 장치 및 방법
CN115599507A (zh) 数据处理方法、执行工作站、电子设备和存储介质
EP3428785A1 (fr) Procédé d'affichage pour commande d'indication de réseau, dispositif électronique, support de stockage lisible par ordinateur et système
Lee et al. Interrupt handler migration and direct interrupt scheduling for rapid scheduling of interrupt-driven tasks

Legal Events

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

Ref document number: 18850929

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205 DATED 24/09/2020)

122 Ep: pct application non-entry in european phase

Ref document number: 18850929

Country of ref document: EP

Kind code of ref document: A1