A parallel task energy-saving scheduling method based on linear programming

A scheduling method and linear programming technology, applied in energy-saving computing, climate sustainability, program startup/switching, etc., can solve problems such as easy to fall into local optimum, without considering the impact of the overall scheduling of a single task, and expand the solution space Effect

Inactive Publication Date: 2019-02-01
SOUTHEAST UNIV
View PDF1 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0016] (1) The objective function only considers the energy consumption optimization of a single task, and realizes the overall energy consumption optimization through the cumulative method. However, due to the correlation of DAG tasks, the above method does not

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 parallel task energy-saving scheduling method based on linear programming
  • A parallel task energy-saving scheduling method based on linear programming
  • A parallel task energy-saving scheduling method based on linear programming

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0045] The technical solutions provided by the present invention will be described in detail below in conjunction with specific embodiments. It should be understood that the following specific embodiments are only used to illustrate the present invention and not to limit the scope of the present invention.

[0046] The energy-saving scheduling method for parallel tasks (LP-DVFS) based on linear programming of the present invention does not make any assumptions about the initial scheduling sequence, and can be used as an energy-saving re-optimization process of the existing performance-priority scheduling method. The following are the basic symbols used in the LP-DVFS method:

[0047] p: the number of processor nodes;

[0048] n: the number of tasks;

[0049] p i : The i-th processor node;

[0050] n k : The kth task;

[0051] n entry : Entry task, there is no parent node task in the DAG graph;

[0052] n exit : Export tasks, tasks with no child nodes in the DAG graph;

[0053] F i : Pro...

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 parallel task energy-saving scheduling method based on linear programming, including the following steps: firstly, the initial scheduling sequence of tasks and the mapping relationship between tasks and processor nodes are obtained by the existing performance-first task scheduling methods; then the execution process of the task is divided into time slices according to thefrequency of the processor, and a linear energy-saving objective function and constraints are constructed; finally, a linear programming tool is used to solve the reasonable time slice value. The invention does not limit the number and range of frequencies to be selected from the overall consideration, and has lower energy consumption, and is suitable for a plurality of performance-first task scheduling methods, and does not increase the scheduling length.

Description

Technical field [0001] The present invention relates to the technical field of computer parallel task scheduling, and relates to a parallel task scheduling method, and more specifically, to a parallel DAG task energy-saving scheduling method in a cluster computing environment. Background technique [0002] With the development of parallel computing technology, large-scale applications are generally executed in parallel by multiple processor nodes of the cluster system to obtain a shorter completion time. In order to achieve parallel computing, the application is decomposed into multiple tasks with dependencies and communication requirements, usually represented by a directed acyclic graph DAG. Application completion time refers to the completion time makespan of the last task in a given application. The problem of parallel task scheduling research is how to optimally allocate the task set to a group of processor nodes in time and space to obtain the best parallel effect. Studie...

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/48
CPCG06F9/4881Y02D10/00
Inventor 汪芸张玉建
Owner SOUTHEAST UNIV
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