Multi-timing-sequence task scheduling method and system

A task scheduling, multi-sequence technology, applied in multi-programming devices, resource allocation and other directions, can solve the problem of uneven resource allocation by FIFO algorithm or Fair algorithm, affecting computing efficiency, etc.

Active Publication Date: 2015-07-22
OCEAN UNIV OF CHINA
View PDF6 Cites 17 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] The technical problem to be solved by the present invention is to provide a multi-sequence task scheduling method and system, which solves the

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
  • Multi-timing-sequence task scheduling method and system
  • Multi-timing-sequence task scheduling method and system
  • Multi-timing-sequence task scheduling method and system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0045] The principles and features of the present invention are described below in conjunction with the accompanying drawings, and the examples given are only used to explain the present invention, and are not intended to limit the scope of the present invention.

[0046] The method of the present invention improves the computing efficiency of the spark by studying the way of spark task scheduling. In this method, the basic idea of ​​dynamic programming algorithm is mainly borrowed, and the problem can be abstracted into a simple mathematical model.

[0047] Model assumption: First, assume that there are n computers with different computing capabilities, and set their computing capabilities as a 1 、a 2 ,...a n . Suppose there are m tasks, each task has a certain size, and the task size is represented by the number of grids, and the size of these m tasks is set as b 1 , b 2 ,...b m .

[0048] Goal: Assume that the sum of tasks of the i-th point is C i , then the objecti...

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 relates to a task scheduling method and system, in particular to a multi-timing-sequence task scheduling method and system. The method comprises the steps that node information is collected, and according to the node information, the operational capability of each node is set; task information is collected, and according to the task information, the grid number of each task is set; according to operational capability, all nodes are sorted; according to the grid number of each task, all tasks are sorted; and according to the load state of each node, a greedy algorithm is used, and according to the mode that nodes with high operational capability process tasks with the large grid numbers, the tasks are distributed to the nodes. Resource distribution on a current platform and the loading capacity and states of the nodes in the platform are considered, during task scheduling, tasks with high calculated quantity are distributed to node with high computing capacity, the problems of starvation states and the low system resource using rate can be effectively avoided, overall operational efficiency is improved, and operation time is optimized.

Description

technical field [0001] The present invention relates to a task scheduling method and system, in particular to a multi-sequence task scheduling method and system. Background technique [0002] When studying the processing of spatial data fields under long-term sequences, especially in the case of asymmetric node computing capabilities, the Spark task scheduling mode is very beneficial to improve data processing efficiency. Spark includes a total of two task scheduling algorithms, one is the FIFO (first-in, first-out) algorithm, and the other is the Fair (fair scheduling) algorithm. The FIFO algorithm is the default scheduling algorithm under the Spark framework. The biggest feature of this algorithm is its good usability, simple and easy-to-understand principle, and strong adaptability. It is a set of algorithms specially designed for single-user single-type data processing jobs. The disadvantage of FIFO is that the first-in-first-out method similar to queuing is relatively...

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/46G06F9/50
Inventor 秦勃景辉刘健健夏海涛朱勇韩卫灵
Owner OCEAN UNIV OF CHINA
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