Intelligent service scheduling method

A scheduling method and technology of intelligent services, applied in the field of operating systems, can solve the problems of computing delay, inability to satisfy local optimality and overall optimality at the same time, etc.
CN104765640AActive Publication Date: 2015-07-08ZHENGZHOU SEANET TECH CO LTD
5 Cites 16 Cited by

Patent Information

Authority / Receiving Office
CN · China
Current Assignee / Owner
ZHENGZHOU SEANET TECH CO LTD
Publication Date
2015-07-08

Smart Images

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

Abstract

The present invention relates to an intelligent service scheduling method, which is used for realizing the scheduling of a plurality of tasks on a server cluster. There is no time-sequence relationship among the plurality of tasks. The tasks comprise a plurality of subtasks having a time-sequence relationship. The method comprises: gathering a plurality of tasks into different task groups, and in each of the task groups, gathering subtasks which are at the same level in a time sequence into one new subtask; and taking the new subtask as a minimum scheduling unit to conduct parallel subtask scheduling in a server cluster. The present invention takes account of the problem of scheduling a plurality of subtasks, having a time-sequence dependency, contained inside one task and conducts task gathering at a subtask level, thereby obtaining the minimum scheduling unit of a suitable particle size. In addition, in the aspect of the selection of performance indexes, two performance indexes, i.e. timeliness and energy consumption, are comprehensively taken into account.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention relates to the field of operating systems, in particular to an intelligent service scheduling method. Background technique

[0002] Task scheduling is a common operation in an operating system. For a real-time operating system, task scheduling will directly affect its real-time performance.

[0003] A method for implementing task scheduling is called a task scheduling algorithm. There are many task scheduling algorithms in the prior art, but most of them are based on task-level scheduling. The task scheduling algorithms in the prior art are briefly introduced below.

[0004] The Min-Min algorithm first predicts the minimum completion time of each task in the current task queue on each processor, then assigns the task with the minimum completion time to the corresponding processor, and updates the ready time of the corresponding processor at the same time. Assigned tasks are removed from the task queue, and the remaining tasks are assign...

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