Task scheduling method and device

A task scheduling and task technology, applied in the computer field, can solve problems such as not considering the processing performance of each executor, idle high-performance machines, and endless processing by low-performance machines

Pending Publication Date: 2019-11-22
BEIJING JINGDONG SHANGKE INFORMATION TECH CO LTD +1
View PDF0 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] In view of this, the embodiment of the present invention provides a method and device for task scheduling, which can at least solve the situation in the prior art that the processing performance of each executor is not considered, resulting in "high-performance machines are idle and low-performance machines cannot finish processing"

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Task scheduling method and device
  • Task scheduling method and device
  • Task scheduling method and device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment approach

[0072] 1) If the method of rounding up is adopted, the remaining tasks can be allocated to the task executor with the lowest work efficiency to improve the overall task processing efficiency;

[0073] 2) If the method of rounding down is adopted, the remaining tasks can be allocated to the task executor with the highest work efficiency, which can also improve the overall task processing efficiency;

[0074] 3) There is no need to sort based on the performance of each machine, and the order is directly allocated according to the list of task executors, and the remaining tasks are allocated to the last task executor in the table.

[0075] The method provided by the above embodiments provides an idea of ​​intelligently allocating tasks based on the task processing performance of the machine, so as to give full play to the processing capabilities of high-performance task executors, realize "more work for those who can", and then improve the overall task processing speed.

[0076]...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a task scheduling method and device, and relates to the technical field of computers. A specific embodiment of the task scheduling method comprises the steps: determining taskactuators, and sending a workload calculation instruction to each task actuator; receiving a result value fed back by each task executor, and determining the time required for feeding back the resultvalue by each task executor so as to calculate the working efficiency of each task executor; and determining a to-be-processed task amount, and performing task allocation according to the working efficiency of each task executor. According to the embodiment, the processing capacity of each task executor is accurately evaluated in a workload proving mode, and intelligent task allocation is achievedaccording to the processing capacity of each task executor and the to-be-processed task amount, and the task processing speed is increased.

Description

technical field [0001] The present invention relates to the field of computer technology, in particular to a task scheduling method and device. Background technique [0002] Existing distributed task scheduling systems, such as TBSchedule and Clover, realize the function of evenly distributing tasks, and can detect the current effective number of executors to ensure that tasks can be allocated correctly. For example, TBSchedule uses QUEUEID to distinguish executors and the tasks to be processed by each executor, which can ensure that each executor can get the same number of tasks fairly. [0003] In the process of realizing the present invention, the inventor finds that there are at least the following problems in the prior art: [0004] 1) Although the executors currently assigning tasks are machines with uniform performance through artificial allocation, due to network jitter, number of tasks, etc., the performance of each machine cannot be exactly the same; [0005] 2) ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F9/50
CPCG06F9/5038
Inventor 王宇
Owner BEIJING JINGDONG SHANGKE INFORMATION TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products