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

Deadlock detection method suitable for generalized models

A deadlock detection and model technology, applied in the field of distributed systems, can solve problems such as deadlocks, achieve the effect of reducing computing pressure and solving common local deadlocks

Active Publication Date: 2016-06-01
PEKING UNIV SHENZHEN GRADUATE SCHOOL
View PDF3 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] In order to solve the problems in the prior art, the present invention provides a deadlock detection method applicable to the generalized model, which solves the problem that the process on the site in the distributed system constitutes a local deadlock in the prior art

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
  • Deadlock detection method suitable for generalized models
  • Deadlock detection method suitable for generalized models
  • Deadlock detection method suitable for generalized models

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0020] The present invention will be further described below in conjunction with the accompanying drawings and specific embodiments.

[0021] WFGWait-forGragh wait graph

[0022] RMResourceManager resource management node

[0023] A deadlock detection method suitable for generalized models, including the following steps: (A) ordinary nodes save output edge information; (B) ordinary nodes detect and resolve local deadlocks and send reduction information to initial nodes; (C) initial Point-reduce detects global deadlocks.

[0024] The dependencies of the processes involved in an algorithm execution are saved on the common nodes.

[0025] In the step (B), the resource management node RM r When receiving a resource request, first put the process that sent the request into request_Q r Queue; if the resource management node assigns this resource to this process and sends a grant(r) message to the process, the process becomes a holder; if RM r After receiving the resource releas...

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 the field of distributed systems, and discloses a deadlock detection method suitable for generalized models, comprising the following steps: (A) a regular node stores output side information; (B) the regular node detects and solves a local deadlock and transmits reduction information to an initial node; (C) the initial node performs reduction and checks overall deadlocks. The present invention is advantageous in effectively reducing the computation pressure of the initial node and solving to a certain degree the problem of common local deadlocks.

Description

【Technical field】 [0001] The invention relates to the field of distributed systems, in particular to a deadlock detection method suitable for generalized models. 【Background technique】 [0002] In a distributed system, a deadlock refers to a phenomenon in which a group of processes wait for each other due to competition for resources during the execution process. If there is no external force, they will not be able to advance. There are two kinds of graph theory models of deadlock: waiting graph (WFG) and resource waiting graph. The waiting graph only includes process nodes, while the resource waiting graph also includes resource nodes, and the resource waiting graph can be transformed into a waiting graph, such as figure 1 shown. When distributed systems adopt different request models, the topology of locks will also be different. When using the AND model, the process can only continue to execute when it obtains all the required resources. When there is a loop in the wait...

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/52
CPCG06F9/46G06F9/524
Inventor 李挥陶智汪允敏
Owner PEKING UNIV SHENZHEN GRADUATE SCHOOL
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