Eureka AIR delivers breakthrough ideas for toughest innovation challenges, trusted by R&D personnel around the world.

Dependence-based parallel task packet scheduling method used on multi-core cluster server

A cluster server and group scheduling technology, which is applied in the field of high-performance computing, can solve problems such as the inability to realize parallel energy-saving scheduling of homogeneous multi-core processors, and achieve the effects of reducing task duplication, low hardware requirements, and improving utilization efficiency

Active Publication Date: 2013-08-07
济南云腾智能科技有限公司
View PDF4 Cites 45 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] In order to solve the problem that existing scheduling technologies cannot realize parallel energy-saving scheduling on homogeneous multi-core processors considering task duplication, the present invention provides a parallel task group scheduling method based on task dependencies in homogeneous multi-core cluster servers

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
  • Dependence-based parallel task packet scheduling method used on multi-core cluster server
  • Dependence-based parallel task packet scheduling method used on multi-core cluster server
  • Dependence-based parallel task packet scheduling method used on multi-core cluster server

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0033] The following first gives the relevant definitions of the present invention, then lists the relevant algorithms, and finally gives a specific example, and further describes the present invention with reference to the accompanying drawings.

[0034] The present invention proposes a task assignment algorithm based on task dependency. By calculating the dependency between execution paths, the execution paths are assigned to the execution paths without increasing the maximum load of the execution paths and conforming to the predecessor-successor constraint relationship between execution tasks. Compared with the original algorithm, the paths with high dependence are merged, which can make the processor load more balanced, reduce unnecessary task duplication, reduce the communication overhead between processors, and reduce the idle time energy consumption of the processor, so as to achieve the overall Reduced energy consumption.

[0035] The initial task execution path is obt...

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 particularly discloses a dependence-based parallel task packet scheduling method used on an isomorphic multi-core cluster server. Through calculating the dependence between execution paths and under the premise of not increasing the maximum loads of the execution paths, execution paths with large dependence are combined, compared with the original algorithm, the method can reduce unnecessary task duplication expenditure, communication expenditure between processors and the idle time energy consumption of the processors are reduced, the load of the processors is more balanced, and the overall energy consumption is lowered. The dependence-based parallel task packet scheduling method has the greatest features that the number of the processors is effectively reduced, the resource utilization efficiency is improved, the load of the processors is more balanced, and accordingly, the overall energy consumption is reduced.

Description

technical field [0001] The invention belongs to the field of high-performance computing, and specifically relates to a parallel scheduling method for multiple tasks in an operating system on a cluster server, that is, assigning multiple parallel tasks to multiple processors for execution, so that the overall execution time of all tasks or the use of The number of processors meets the requirements. Background technique [0002] With the rapid development of high-performance computers, the energy consumption of large-scale multi-processor cluster systems is increasing, and high-efficiency energy saving has become one of the important factors that must be considered in high-performance computing. Cluster systems often consist of hundreds to tens of thousands of computing nodes, and each node includes multiple homogeneous multi-core processors. A cluster system can run multiple applications at the same time and provide services to multiple users. How to speed up the running sp...

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 Applications(China)
IPC IPC(8): G06F9/50
CPCY02B60/142Y02B60/167Y02D10/00
Inventor 李新贾智平赵衍恒谢帅
Owner 济南云腾智能科技有限公司
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
Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com