Unlock instant, AI-driven research and patent intelligence for your innovation.

A multi-task scheduling method and server

A scheduling method and multitasking technology, applied in the directions of multiprogramming device, resource allocation, etc., can solve the problems of inability to flexibly control task startup time, inability to control task type, inability to control task operation mode, etc.

Active Publication Date: 2020-08-11
TENCENT TECH (SHENZHEN) CO LTD
View PDF9 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] However, the traditional multi-task scheduling method has the following defects: 1) in the polling process, it is impossible to flexibly control the start time of each task; 2) it is impossible to control the operation mode between tasks, whether it is parallel or serial; 3) Unable to accurately control the current state of the task; 4) Unable to control the type of task, whether it is a single task or multiple tasks
[0004] To sum up, the traditional multi-task scheduling method can only sequentially execute each task reaching the polling time slice in the way of polling time slice, and cannot realize flexible scheduling among multiple tasks.

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
  • A multi-task scheduling method and server
  • A multi-task scheduling method and server
  • A multi-task scheduling method and server

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0059] figure 1 It is a schematic diagram of the implementation flow of a multi-task scheduling method in an embodiment of the present invention, as figure 1 As shown, the method includes:

[0060] Step S101: Obtain a current task among N tasks, where N is a natural number greater than 1;

[0061] Specifically, during the multi-task polling process, the server can randomly obtain a current task among the N tasks to be executed, or obtain a higher priority task among the N tasks to be executed in order of priority. task, as the current task. In practical applications, when there is no priority restriction among the N tasks, that is, the execution sequence among the tasks is random, the server randomly obtains a task from the N tasks as the current task; When a priority order is preset among the N tasks, the server may obtain a task with a higher priority from the N tasks according to the preset priority order as the current task.

[0062] Step S102: Detect the current state...

Embodiment 2

[0077] figure 2 It is a schematic diagram of the implementation flow of a multi-task scheduling method in an embodiment of the present invention, as figure 2 As shown, the method includes:

[0078] Step S201: Obtain a current task among N tasks, where N is a natural number greater than 1;

[0079] Specifically, during the multi-task polling process, the server can randomly obtain a current task among the N tasks to be executed, or obtain a higher priority task among the N tasks to be executed in order of priority. task, as the current task. In practical applications, when there is no priority restriction among the N tasks, that is, the execution sequence among the tasks is random, the server randomly obtains a task from the N tasks as the current task; When a priority order is preset among the N tasks, the server may obtain a task with a higher priority from the N tasks according to the preset priority order as the current task.

[0080] Step S202: Initialize the running...

Embodiment 3

[0101] image 3 It is a schematic diagram of the implementation flow of the third multi-task scheduling method in the embodiment of the present invention, such as image 3 As shown, the method includes:

[0102] Step S301: setting a task structure corresponding to N tasks;

[0103] Wherein, the structure instances in the task structure are in one-to-one correspondence with the N tasks, and the N is a natural number greater than 1.

[0104] Here, the structure instance in the task structure may include information such as the current state of the corresponding task, pre-configured configuration parameters of the corresponding task, and the scheduling mode of the task. Wherein, the configuration parameters may include the type of the task, the number of failed attempts or the number of schedulable times, etc.; the scheduling mode of the task may include parallel scheduling or serial scheduling.

[0105] Step S302: Obtain a current task among the N tasks;

[0106] Specificall...

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 multi-task scheduling method and a server. The method comprises the steps that a current task in N tasks is acquired, wherein N is a natural number larger than 1; a current state of the current task is detected, and a detection result is obtained; whether the current task is a target task meeting a preset condition or not is judged according to the detection result, and a judgment result is obtained; when the judgment result is used for representing that the current task is the target task meeting the preset condition, configuration parameters configured for the current task are acquired, the current task is operated according to the configuration parameters to obtain an operation result, and the current state of the current task is updated according to the operation result.

Description

technical field [0001] The invention relates to scheduling technology, in particular to a multi-task scheduling method and server. Background technique [0002] At present, traditional multi-task scheduling methods usually implement multi-task scheduling based on round-robin time slices. The traditional multi-task scheduling method includes: first, define a round-robin time slice for each task, and initialize the running schedule of each task; after that, after waiting for the minimum task time slice, detect the round-robin time slice of the current task Whether it arrives; when the polling time slice of the current task arrives, start to run the task, and reset the running schedule of the task. [0003] However, the traditional multi-task scheduling method has the following defects: 1) in the polling process, it is impossible to flexibly control the startup time of each task; 2) it is impossible to control the operation mode between tasks, whether it is parallel or serial;...

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 Patents(China)
IPC IPC(8): G06F9/50
Inventor 尤辉
Owner TENCENT TECH (SHENZHEN) CO LTD