Deadlock detection for parallel programs

• US 8,661,450 B2
• Filed: 04/02/2012
• Issued: 02/25/2014
• Est. Priority Date: 06/30/2009
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Qi, Yao, Zheng, Yong, Luo, Zhi D.
• Primary Examiner(s): Rines, David
• Application Number:
  US13/437,339
• Publication Number:
  US 20120198460A1
• Time in Patent Office: 694 Days
• Field of Search: 717101-178, 718101-108
• US Class Current: 718/106
• CPC Class Codes: G06F 11/3604 Software analysis for verifying properties of programs byte-code verification G06F9/44589
• CPC Class Codes: G06F 11/3612 by runtime analysis performance monitoring G06F11/3466
• CPC Class Codes: G06F 9/524 Deadlock detection or avoidance

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.

Claims

1. A computer implemented method for deadlock detection of parallel programs, comprising:

identifying a set of locations where the lock of the parallel programs may be finally used in the running procedure of the parallel programs;

adding marks in the vicinity of locations that the lock of the parallel programs may be finally used, wherein the marks are used to trigger, in the running procedure of the parallel programs, event notifications that the lock of the parallel programs may no longer be used;

in response to receiving all event notifications that the lock of the parallel programs may no longer be used as triggered by the marks, determining, by the computer, that a lock of the parallel programs is no longer used in a running procedure of the parallel programs;

deleting, by the computer, 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 operations of the parallel programs; and

performing deadlock detection on the updated lock graph by the computer.

2. The computer implemented method according to claim 1, wherein determining that a lock of the parallel programs is no longer used in the running procedure of the parallel programs further comprising:

in response to receiving an event notification that a lock of the parallel programs is no longer used, determining that a lock of the parallel programs is no longer used.

3. The computer implemented method according to claim 2, wherein determining a lock of the parallel programs is no longer used in the running procedure of the parallel programs further comprising:

analyzing a lifecycle of the lock of the parallel programs by scanning code of the parallel programs.

4. The computer implemented method according to claim 3, wherein analyzing the lifecycle of the lock of the parallel programs further comprising:

in response to detecting that there is a function call in the parallel programs that destroys a lock, identifying a location where the lock of the parallel programs is finally used in the running procedure of the parallel programs.

5. The computer implemented method according to claim 4, further comprising:

adding marks in the vicinity of the location where the lock of the parallel programs is finally used, wherein the marks are used to trigger, in the running procedure of the parallel programs, event notifications that the lock of the parallel programs is no longer used.

6. The computer implemented method according to claim 1, wherein identifying the set of locations where the lock of the parallel programs may be finally used in the running procedure of the parallel programs further comprising:

in response to detecting that there is no function call in the parallel programs that destroys a lock, analyzing a data stream of the parallel programs, determining a location where the lock of the parallel programs is defined and used in order to identify the set of locations where the lock of the parallel programs may be finally used in the running procedure of the parallel programs.

7. The computer implemented method according to claim 1, wherein determining that the lock of the parallel programs is no longer used in the running procedure of the parallel programs further comprising:

in response to detecting that the lock of the parallel programs is reclaimed by a garbage collection process in the running procedure of the parallel programs, identifying that the lock of the parallel programs is no longer used.