Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Quick task allocation method avoiding deadlock on heterogeneous resource system

A deadlock-avoiding and heterogeneous technology, applied in the direction of resource allocation, multi-program device, etc., can solve the problem of communication dependencies without considering the priority of tasks, minimize total overhead, improve efficiency, and avoid loops produced effect

Active Publication Date: 2013-06-12
CHONGQING UNIV
View PDF4 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Some existing techniques are used to minimize task overhead, but they do not consider the dependencies of tasks, the communication dependencies between tasks, and the security of local scheduling to avoid deadlocks

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
  • Quick task allocation method avoiding deadlock on heterogeneous resource system
  • Quick task allocation method avoiding deadlock on heterogeneous resource system
  • Quick task allocation method avoiding deadlock on heterogeneous resource system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0016] The idea of ​​the present invention is to merge the nodes of the task data flow graph into node clusters. But if there is a cycle in the new task data flow graph composed of node clusters, deadlock may occur in the task scheduling process. In the directed acyclic task data flow graph, the necessary condition for generating a cycle after merging two nodes into a node cluster is that there is a path greater than or equal to 2 between the above two nodes. After performing geometric operations on the adjacency matrix, a new matrix can be obtained, and whether there is a path with a certain length between nodes can be determined through the matrix elements in the new matrix. In this regard, we give a series of definitions, theories, and mathematical proofs.

[0017] It is an existing technical means to represent an application task using a task data flow graph. References include: Shao ZL, Zhuge QF, Xue C, Sha HM. Research on Efficient Allocation and Scheduling on Heterogen...

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 quick task allocation method avoiding deadlock on a heterogeneous resource system. The quick task allocation method comprises the following steps of: (1) representing a specific application by using a task data flow diagram, and geometrically calculating by using an adjacent matrix of the task data flow diagram to acquire a new matrix, wherein the new matrix is used for representing whether the length of the longest path between nodes is greater than or equal to 2; (2) selecting node pairs with the longest path length between nodes smaller than 2 and greatest communication data volume according to the new matrix, merging the node pairs into a node cluster, updating the new matrix, repeating the node merging process, and reducing the scale of the task data flow diagram to an intended target; and (3) allocating the task data flow diagram to a heterogeneous resource set by using an integral linear programming equation set. The quick task allocation method has the advantages of being provided with task execution sequence dependency relationship and communication dependency relationship among tasks and has the characteristic of avoiding deadlock, and the total expense of the heterogeneous resource system is minimized.

Description

technical field [0001] The invention relates to a large-scale task allocation on a heterogeneous computer cluster, in particular to a fast task allocation method for avoiding deadlocks on a heterogeneous resource system. Background technique [0002] Modern high-performance scientific computer systems and common commercial computer systems are almost all based on the computer system structure of heterogeneous clusters. In a heterogeneous computer system, processors of the same type are interconnected to form a cluster, and different clusters are connected through heterogeneous communication links. Heterogeneous clusters can provide very high computational efficiency at the cost of huge overhead. [0003] In the heterogeneous resource system, large-scale tasks are completed on various types of heterogeneous resources, and a large-scale task must be completed with a large number of different types of heterogeneous resources. figure 1 Shown is a schematic diagram of a heterog...

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/50
Inventor 沙行勉诸葛晴凤孙群燕刘铎
Owner CHONGQING UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap 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