WO2012088766A1 - Procédé et dispositif de programmation dynamique de tâches de traitement par lots - Google Patents

Procédé et dispositif de programmation dynamique de tâches de traitement par lots Download PDF

Info

Publication number
WO2012088766A1
WO2012088766A1 PCT/CN2011/002208 CN2011002208W WO2012088766A1 WO 2012088766 A1 WO2012088766 A1 WO 2012088766A1 CN 2011002208 W CN2011002208 W CN 2011002208W WO 2012088766 A1 WO2012088766 A1 WO 2012088766A1
Authority
WO
WIPO (PCT)
Prior art keywords
task
execution
node
nodes
information
Prior art date
Application number
PCT/CN2011/002208
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 WO2012088766A1 publication Critical patent/WO2012088766A1/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/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061—Partitioning or combining of resources
    • G06F9/5066—Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs

Definitions

  • the present invention relates to the field of computer technology, and in particular to dynamic scheduling of batch tasks. Background technique
  • a batch task is an operation that performs a series of programs in a computer system without human intervention.
  • the existing batch task scheduling system pays attention to the scheduled scheduling of tasks, but when the execution time of some tasks exceeds the expected time, multiple tasks will be executed in parallel. If the task consumes too much system resources, it may lead to deadlock or even system crash. .
  • the traditional sequential scheduling on time can guarantee the abundance of available resources for lightweight batch tasks, but it may cause waste of system resources and inefficient work.
  • the scheduling of large tasks lacks controllability, and it is difficult to suspend in time. Schedule operations such as restart and sequel.
  • the present invention provides a method for dynamically scheduling a batch task, the task comprising a first task and a second task, wherein the method comprises the following steps: first step, first task and second task Decomposing a task into a plurality of task nodes, and grouping the plurality of task nodes into a first process corresponding to the first task and a second process corresponding to the second task;
  • the execution of the first process and the second process, the execution state of the information task node, and the execution component are controlled in units of task nodes according to the information of each task node.
  • the method further comprises the step of acquiring system resource information; the second step further comprising controlling the execution of each task node based on the system resource information.
  • the first step further comprises setting priorities of the first process and the second process; the second step further comprises controlling execution of the first process and the second process according to the priority.
  • a device for dynamically scheduling a batch task comprising a first task and a second task, the device comprising a setting module and a control module, wherein
  • the setting module is configured to decompose the first task and the second task into a plurality of task nodes, and to form the plurality of task nodes into a first process corresponding to the first task and a second process corresponding to the second task;
  • the control module is configured to control execution of the first process and the second process in units of task nodes according to information of each task node, where the information includes an execution state and an execution condition of each of the plurality of task nodes.
  • the apparatus further comprises a resource monitoring module for acquiring system resource information; and the control module is further configured to control the execution of each task node according to the system resource letter.
  • the setting module is further configured to set a priority of the first process and the second process; the control module is further configured to control the execution of the first process and the second process according to the priority.
  • the task node is the smallest program unit with data integrity.
  • the invention provides the resource utilization rate of the system through the above technical solution. By analyzing the dependency relationship, when a task node fails, the corresponding processing will be performed in time, thereby improving the fault tolerance capability of the system.
  • the scheduling of the batch processing task of the invention is based on the dynamic change of the system resources and the static resource characteristics of the task nodes, and has strong flexibility. In addition, because the task is serialized into task nodes, the scheduling and tasks are separated from each other, and the tasks are scheduled in the form of a process, which can be well adapted to business changes.
  • FIG. 1 is a flow chart of a method of dynamically scheduling a batch task according to an embodiment of the present invention
  • FIG. 2 is a diagram of a method of dynamically scheduling a batch task according to an embodiment of the present invention
  • FIG. 3 is a dynamic diagram according to an embodiment of the present invention. Schematic diagram of a device that schedules batch tasks. detailed description
  • FIG. 1 it is a flowchart of a method of dynamically scheduling a batch task according to an embodiment of the present invention, wherein:
  • step S1 the batch task is serialized into a process consisting of task nodes.
  • the task can be disassembled into multiple node units with data integrity, and then these node units are spliced into a process that can be scheduled by the configuration, and the generated process corresponds to the original task.
  • step S2 the flow is dynamically scheduled according to the information of the task node.
  • the information of the task node may include an execution state and an execution condition of the task node.
  • the execution status of each independently executable task node may include preparation for execution, execution, and execution completion.
  • Execution conditions may include performing corresponding resource consumption data for the task node to describe its resource demand status or may also include execution time of the task node and dependencies of the task node with other task nodes in the process.
  • Fig. 2 is an illustration of a method of dynamically scheduling a batch task, in accordance with an embodiment of the present invention.
  • the first process and the second process may be composed of a plurality of such task nodes A, B, C, D, E, F in a serial-parallel manner.
  • the start, pause and sequel of the process are implemented by the task node, and the data integrity of the node ensures that the process scheduling can be freely performed among multiple tasks, which greatly increases the flexibility of the call.
  • example PT/CN2011/002208 For example, in FIG.
  • the dependency relationship between the task node D and other nodes, such as nodes B and C can be known that the execution condition of the task node D in the first process is that the task nodes B and C are executed, then
  • the execution condition of the task node D can be set accordingly, for example, the execution time of the task node D can be set after the execution time of the task nodes B and C.
  • the execution of the task node D can also be triggered by judging the execution states of the task node task nodes B and C.
  • the task node to be released may be determined according to resource consumption data of the task node, and thus the task node information also provides a prerequisite for resource release of operations such as suspension.
  • the device comprises a setting module, a control module and a resource monitoring module, wherein the setting module is used for decomposing tasks into a plurality of task nodes, and the plurality of task nodes are grouped into a process 1-4.
  • the control module is configured to control the process 1-4 in units of task nodes according to the information of each task node.
  • the information of the task node may include an execution state and an execution condition of the task node.
  • the resource monitoring module is configured to acquire system resource information, and then the control module controls execution of each task node according to system resource information.
  • system resource information can be obtained through the API of the operating system and provided as a reference condition for process scheduling. For example, priority can be set for the process. When the available resources of the system exceed the warning line, the process with low priority is suspended. When the system resources are sufficient, the suspended process is resumed in time.
  • the resource information can be used as a scheduling decision for the process, and a pre-judgment can be made for the real-time scheduling of the process. Resolve resource conflicts between tasks while ensuring efficient operation of the program.
  • the resource consumption data for a task node is described in Table 1 below:
  • control module will make a scheduling decision based on the process priority, and the suboptimal process will be suspended.

Landscapes

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

Abstract

L'invention concerne un procédé et un dispositif de programmation dynamique de tâches de traitement par lots, lesquelles tâches comprennent une première tâche et une deuxième tâche, le procédé comprenant les étapes consistant à : diviser la première tâche et la deuxième tâche en une pluralité de nœuds de tâche, et regrouper la pluralité de nœuds de tâche pour former un premier flux correspondant à la première tâche et un deuxième flux correspondant à la deuxième tâche ; et commander l'exécution du premier flux et du deuxième flux en considérant un nœud de tâche individuel comme une unité individuelle compte tenu d'informations relatives à chaque nœud de tâche, lesquelles informations comprennent l'état d'exécution et la condition d'exécution de chaque nœud de tâche parmi la pluralité de nœuds de tâche.
PCT/CN2011/002208 2010-12-29 2011-12-29 Procédé et dispositif de programmation dynamique de tâches de traitement par lots WO2012088766A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201010619141.3 2010-12-29
CN2010106191413A CN102541648A (zh) 2010-12-29 2010-12-29 一种用于动态调度批处理任务的方法和装置

Publications (1)

Publication Number Publication Date
WO2012088766A1 true WO2012088766A1 (fr) 2012-07-05

Family

ID=46348604

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/002208 WO2012088766A1 (fr) 2010-12-29 2011-12-29 Procédé et dispositif de programmation dynamique de tâches de traitement par lots

Country Status (2)

Country Link
CN (1) CN102541648A (fr)
WO (1) WO2012088766A1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109117359A (zh) * 2017-06-22 2019-01-01 深圳市中兴微电子技术有限公司 序列化测试方法和装置
CN112230572B (zh) * 2019-06-30 2021-09-03 比亚迪股份有限公司 集成控制芯片及其控制方法，存储介质，车辆

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0613085A2 (fr) * 1993-02-26 1994-08-31 Nippondenso Co., Ltd. Unité de traitement multi-tâche
CN101566957A (zh) * 2008-04-25 2009-10-28 恩益禧电子股份有限公司 信息处理系统及任务执行控制方法
CN101593088A (zh) * 2008-05-28 2009-12-02 鸿富锦精密工业（深圳）有限公司 集群式打印系统及方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0613085A2 (fr) * 1993-02-26 1994-08-31 Nippondenso Co., Ltd. Unité de traitement multi-tâche
CN101566957A (zh) * 2008-04-25 2009-10-28 恩益禧电子股份有限公司 信息处理系统及任务执行控制方法
CN101593088A (zh) * 2008-05-28 2009-12-02 鸿富锦精密工业（深圳）有限公司 集群式打印系统及方法

Also Published As

Publication number Publication date
CN102541648A (zh) 2012-07-04

Similar Documents

Publication Publication Date Title
US7441240B2 (en) Process scheduling apparatus, process scheduling method, program for process scheduling, and storage medium recording a program for process scheduling
US8739171B2 (en) High-throughput-computing in a hybrid computing environment
US8185903B2 (en) Managing system resources
US8141079B2 (en) Dynamic application scheduler in a polling system
US9875145B2 (en) Load based dynamic resource sets
WO2009147802A1 (fr) Contrôleur de priorité et procédé de contrôle de priorité
KR101686010B1 (ko) 실시간 멀티코어 시스템의 동기화 스케쥴링 장치 및 방법
WO2017080273A1 (fr) Procédés et système de gestion de tâches, et support de stockage informatique
CN111367679A (zh) 人工智能算力资源复用方法及装置
CN112087503A (zh) 集群任务调度方法、系统、计算机和计算机可读存储介质
US8869154B1 (en) Controlling processor usage on a computing device
CN106776395B (zh) 一种共享集群的任务调度方法及装置
CN111026519A (zh) 基于分布式的任务优先级调度方法和系统及存储介质
US8132171B2 (en) Method of controlling thread access to a synchronization object
US9128754B2 (en) Resource starvation management in a computer system
US8977752B2 (en) Event-based dynamic resource provisioning
US9229716B2 (en) Time-based task priority boost management using boost register values
CN109766168B (zh) 任务调度方法和装置、存储介质以及计算设备
WO2012088766A1 (fr) Procédé et dispositif de programmation dynamique de tâches de traitement par lots
US9766940B2 (en) Enabling dynamic job configuration in mapreduce
CN111989651A (zh) 在多核系统中管理内核服务的方法和装置
JP2015121963A (ja) 情報処理システム、監視方法、及び、プログラム
JPWO2018211865A1 (ja) 車両制御装置
JP2010186347A (ja) ジョブスケジューリングシステム、ジョブスケジューリング方法及びプログラム
Belagali et al. Implementation and validation of dynamic scheduler based on LST on FreeRTOS

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: 11853809

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 1205N DATED 04/09/2013)

122 Ep: pct application non-entry in european phase

Ref document number: 11853809

Country of ref document: EP

Kind code of ref document: A1