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.

Active Publication Date: 2015-07-08
ZHENGZHOU SEANET TECH CO LTD
View PDF5 Cites 16 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0010] The purpose of the present invention is to overcome the shortcomings of the task scheduling method in the prior art, which tends to cause calculation delay when the total number o

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
  • Intelligent service scheduling method
  • Intelligent service scheduling method
  • Intelligent service scheduling method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0054] The present invention will be further described now in conjunction with accompanying drawing.

[0055] The method of the present invention is mainly aimed at the phenomenon that a large number of tasks appear at the same time and multiple subtasks of the same level exist at the same time. There is no time sequence between the tasks to be processed by the method of the present invention, but there is time sequence between subtasks in the same task. refer to figure 1 , the method of the present invention comprises the following steps:

[0056] Step 1), task aggregation. The aggregation involved in this step is divided into two, refer to figure 2 , one is the aggregation of tasks, that is, multiple tasks are randomly assigned to different task groups, and the second is the aggregation of subtasks, which aggregates the subtasks at the same level in the same task group in time sequence into a new Subtask, the new subtask will be the smallest scheduling unit. The necess...

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 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.

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

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F9/48G06F9/38
CPCG06F9/46G06F9/5066Y02D10/00
Inventor 尤佳莉乔楠楠卓煜
Owner ZHENGZHOU SEANET 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

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap