DEADLOCK DETECTION METHOD AND SYSTEM FOR PARALLEL PROGRAMS
First Claim
Patent Images
1. A computer implemented method for deadlock detection of parallel programs, comprising:
- determining that a lock of the parallel programs is no longer used in a running procedure of the parallel programs;
deleting a node corresponding to the lock that is no longer used, and edges relating to the lock that is no longer used, from a lock graph corresponding to the running procedure of the parallel programs to acquire an updated lock graph, wherein the lock graph is constructed according to lock operation of the parallel programs; and
performing deadlock detection on the updated lock graph.
1 Assignment
0 Petitions
Accused Products
Abstract
A deadlock detection method and computer system for parallel programs. A determination is made that a lock of the parallel programs is no longer used in a running procedure of the parallel programs. A node corresponding to the lock that is no longer used, and edges relating to the lock that is no longer used, are deleted from a lock graph corresponding to the running procedure of the parallel programs in order to acquire an updated lock graph. The lock graph is constructed according to a lock operation of the parallel programs. Deadlock detection is then performed on the updated lock graph.
-
Citations
20 Claims
-
1. A computer implemented method for deadlock detection of parallel programs, comprising:
-
determining that a lock of the parallel programs is no longer used in a running procedure of the parallel programs; deleting a node corresponding to the lock that is no longer used, and edges relating to the lock that is no longer used, from a lock graph corresponding to the running procedure of the parallel programs to acquire an updated lock graph, wherein the lock graph is constructed according to lock operation of the parallel programs; and performing deadlock detection on the updated lock graph. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A computer system for deadlock detection of parallel programs, comprising:
-
first programming instructions configured to determine that a lock of the parallel programs is no longer used in a running procedure of the parallel programs; second programming instructions configured to delete a node corresponding to the lock that is no longer used, and edges relating to the lock that is no longer used, from a lock graph corresponding to the running procedure of the parallel programs to acquire an updated lock graph, wherein the lock graph is constructed according to lock operation of the parallel programs; and third programming instructions configured to perform deadlock detection on the updated lock graph. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20)
-
Specification