Task allocation method and task allocation device

A task allocation and task technology, applied in the computer field, can solve the problems of high labor cost and large manpower, and achieve the effect of avoiding repeated processing and saving labor cost

CN111190710APending Publication Date: 2020-05-22TAIKANG LIFE INSURANCE CO LTD +1
4 Cites 3 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Publication Date
2020-05-22

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention provides a task allocation method and a task allocation device. A distributed system can automatically allocate tasks to execution machines without human participation, so that the laborcost can be saved. Besides, the unique number of each execution machine in an execution machine set is different, the task numbers of different tasks are different, and under the condition that the total number of the execution machines is not changed, the remainder value of any task number to the total number of the execution machines is unique, so only the unique number of one execution machinecan be matched, the unique numbers of multiple different execution machines cannot be matched at the same time, the situation that the same task is distributed to the multiple different execution machines to be processed can be avoided, and the situation that the same task is repeatedly processed can be avoided.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The present application relates to the field of computer technology, in particular to a task allocation method and device. Background technique

[0002] In a distributed system, multiple executors can be assigned to process tasks.

[0003] Sometimes, multiple execution machines may process a task at the same time. In order to avoid this situation, for any execution machine, the technician can bind some tasks to the execution machine in advance so that the execution machine can only process For this part of the tasks, for each of the other execution machines, the above operations are also performed. And the tasks bound to each execution machine do not overlap, so that the situation that multiple execution machines process a task at the same time can be avoided.

[0004] However, in the case of a very large amount of tasks, the operation of binding an execution machine for each task will consume a lot of manpower, resulting in high labor costs. Conte...

Examples

Embodiment Construction

[0058] In order to make the above objects, features and advantages of the present application more obvious and comprehensible, the present application will be further described in detail below in conjunction with the accompanying drawings and specific implementation methods.

[0059] refer to figure 1 , shows a flow chart of the steps of a task allocation method of the present application, the method is applied in a distributed system, and the method may specifically include the following steps:

[0060] In step S101, obtain the total number of execution machines included in the execution machine set, and obtain the unique number of the target execution machine in the execution machine set;

[0061] In this application, multiple execution machines can be set in advance, and the execution machines are used to process tasks, and then multiple execution machines are formed into a collection of execution machines. Each execution machine in the collection of execution machines has ...