A Static Simplification Method of Concurrent Program Execution Trajectory Based on Weighted Dependency Graph
A program execution and dependency graph technology, applied in program synchronization, multi-program device, instrument, etc., can solve the problem that the optimal simplified trajectory cannot be obtained quickly and effectively
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0045] In order to better understand the technical content of the present invention, specific embodiments are given together with the attached drawings for description as follows.
[0046] figure 1 It is a flowchart of a method for statically simplifying concurrent program execution paths based on a weighted dependency graph according to an embodiment of the present invention.
[0047] A method for statically simplifying concurrent program execution paths based on weighted dependency graphs, comprising the following steps:
[0048] 1) The calculation of event dependencies, by judging whether two adjacent events in the original trajectory are in the same thread, divides two adjacent events into local dependencies and remote dependencies, and further according to the types of two adjacent events that belong to remote dependencies, Two adjacent events are divided into conflict dependencies and synchronization dependencies. Conflict dependencies include read-write dependencies, w...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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