Method for acquiring process task block dependency based on matrixes

A technology of dependencies and matrices, applied in the fields of instruments, electrical digital data processing, calculations, etc., can solve problems such as time-consuming and labor-intensive, and achieve the effect of easy expression

Active Publication Date: 2018-05-01
哈尔滨中逻智科技有限公司
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] The purpose of the present invention is to solve the problem that the existing exhaustive method search needs to traverse all possible sequences, and als

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
  • Method for acquiring process task block dependency based on matrixes
  • Method for acquiring process task block dependency based on matrixes
  • Method for acquiring process task block dependency based on matrixes

Examples

Experimental program
Comparison scheme
Effect test

specific Embodiment approach 1

[0029] Specific implementation mode one: combine figure 1 Description of the stupid implementation mode, a method for acquiring process task block dependencies based on a matrix in this implementation mode The specific process is as follows:

[0030] Step 1, input correct and incorrect test cases, the test cases include all process task blocks;

[0031] Step 2, convert the test case into a relationship matrix;

[0032] A matrix is ​​used to store the relationship between two task blocks, and the matrix corresponds to the relationship set of each test case; in the matrix, there are three values ​​-1, 0, 1 respectively.

[0033] "-1" is not discussed, "0" means that the execution order of the i-th task block is behind the j-th task block, and "1" means that the execution order of the i-th task block is ahead of the j-th task block; that is:

[0034] "0" indicates that the execution order of i is behind j;

[0035] "1" indicates that the execution order of i is prior to j;

...

specific Embodiment approach 2

[0056] Specific implementation mode two: the difference between this implementation mode and specific implementation mode one is: the test case is converted into a relationship matrix in the second step; the specific process is:

[0057]The relationship matrix includes correct relationship matrix, wrong relationship matrix, relationship compatibility matrix and dependency matrix;

[0058] a1 task block has A and B subtask blocks; a2 task block has C and D subtask blocks;

[0059] Among them, the correct test cases are A, B, C, D; A, C, B, D, and the wrong test cases are ACDB, CDAB;

[0060] Construct the correct relationship matrix A1, A2 according to the correct test case;

[0061] Construct error relationship matrix B1, B2 according to the error test case;

[0062] At the same time, according to two correct test cases, it is concluded that there is no sequence relationship between the two task blocks C and B, and the relationship compatibility matrix C1 is constructed;

...

specific Embodiment approach 3

[0069] Specific embodiment three: the difference between this embodiment and specific embodiment one or two is that: in the step four, the matrix subtraction operation is performed on the β correct relationship matrices and wrong relationship matrices to obtain new matrices B1' and B2', according to B1' and B2' determine that several of the correct test cases are different from the wrong test cases; the specific process is:

[0070] After converting the dependency relationship into a matrix expression, mathematical operations in set theory can be used to operate on numerous matrices to simplify the number of matrices and obtain the final required dependency matrix.

[0071] matrix subtraction

[0072] Matrix subtraction is the core part of matrix operations. According to the idea of ​​reduction, the present invention uses the subtraction operation in set theory to subtract the wrong relationship matrix from the correct relationship matrix to obtain a new matrix;

[0073] Und...

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 method for acquiring process task block dependency based on matrixes. The method aims to solve the problem that in existing exhaustion method search, it is needed to traverse all possibly occurring orders and meanwhile continuously construct test cases, and consequently time and labor are wasted. According to the method, first, test cases are input; second, the test cases are converted into a relation matrix; third, when alpha is greater than or equal to beta, the fourth step is turned to, and when alpha is smaller than beta, the ninth step is turned to; fourth, correct test cases different from wrong test cases are determined, and the fifth step is turned to; fifth, when alpha is greater than beta, the sixth step is turned to, and when alpha is equal to beta, the seventh step is turned to; sixth, a relation compatibility matrix is obtained, and the eighth step is turned to; seventh, a dependency matrix is obtained, and the thirteenth step is turned to; eighth, a dependency matrix is obtained, and the thirteenth step is turned to; ninth, correct test cases different from wrong test cases are determined, and the tenth step is executed; tenth, a complementary relation matrix is obtained, and the eleventh step is turned to; eleventh, a new complementary relation matrix is obtained; twelfth, a dependency matrix is obtained, and the thirteenth step is turned to; and thirteenth, dependency is obtained and output. The method is applied to the field of task block dependency determination.

Description

technical field [0001] The invention relates to a matrix-based method for acquiring process task block dependencies. Background technique [0002] Several concurrently executed tasks have the same priority. Each task can be split into several blocks. The concurrent execution order of associated blocks (which affect each other) in the task will affect the final result. It is assumed that some test cases can be generated for Some combinations of these associated blocks are tested sequentially and give either true or false results. According to the execution sequence and results of the associated blocks, inference is made, and the execution sequence of the associated blocks is deduced. Using the exhaustive search method requires traversing all possible sequences, and also needs to continuously build test cases. Therefore, this method is time-consuming and laborious, and is not suitable for optimizing process synchronization problems. Therefore, a robust algorithm is needed t...

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): G06F11/36
CPCG06F11/3684G06F11/3688
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
Try Eureka
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap