Method and system for reducing message passing for contention detection in distributed SIP server environments

Patent metadata

Field	Value
Publication number	US-8977730-B2
Application number	US-94915110-A
Country	US
Kind code	B2
Filing date	Nov 18, 2010
Priority date	Nov 18, 2010
Publication date	Mar 10, 2015
Grant date	Mar 10, 2015

Abstract

A method, a system, and a computer program product are provided for reducing message passing for contention detection in distributed SIP server environments. The method is implemented in a computer infrastructure having computer executable code tangibly embodied on a computer readable storage medium having programming instructions operable to determine that a first site is waiting for a first object locked by a second site. The programming instructions are further operable to determine that a third site is waiting for a second object locked by the first site, and to send a first probe to the second site to determine whether the second site is waiting. A second probe is received and indicates that a site is waiting for an object locked by the first site. The second probe further indicates a deadlock in a distributed server environment to be resolved.

First claim

What is claimed is:

1. A method comprising:
obtaining, by a computer processor, a local Wait-For Graph (WFG) at a first site of a distributed server environment;
determining, by the computer processor, that the first site is waiting for a first object locked by a second site of the distributed server environment based on the local WFG at the first site;
determining, by the computer processor, that a third site of the distributed server environment is waiting for a second object locked by the first site;
sending, by the computer processor, a first probe to the second site to determine whether the second site is waiting;
receiving, by the computer processor, a second probe at the first site indicating that another site of the distributed server environment is waiting for an object locked by the first site, wherein the second probe further indicates to the first site a deadlock in the distributed server environment to be resolved; and
resolving, by the computer processor, the deadlock in the distributed server environment by victimizing a first transaction at the first site that is waiting for the first object.

2. The method of claim 1 , wherein the programming instructions are further operable to receive a reverse probe indicating that the second site is not waiting, wherein the reverse probe further indicates an absence of deadlocks in the distributed server environment.

3. The method of claim 1 , wherein the programming instructions are further operable to generate a set of all transactions and objects in the distributed server environment.

4. The method of claim 3 , wherein the programming instructions are further operable to:
count a deadlock query reference count for each of the objects in the set of all transactions and objects; and
count a transaction query reference count for each of the transactions and objects in the set of all transactions and objects.

5. The method of claim 4 , wherein the programming instructions are further operable to select at least the first transaction and the first object as a candidate for detecting and resolving the deadlock in the distributed server environment based on the counting of the deadlock query reference counts and the counting of the transaction query reference counts.

6. The method of claim 1 , wherein a service provider at least one of creates, maintains, deploys and supports the computer infrastructure.

7. The method of claim 1 , wherein steps of claim 1 are provided by the service provider on a subscription, advertising, and/or fee basis.

8. The method of claim 1 , further comprising:
generating a set of all transactions and objects in the distributed server environment; and
selecting at least one transaction and a first object from the set of all transactions and objects as candidates for detecting and resolving the deadlock in the distributed server environment.

9. A system implemented in hardware, comprising:
a transaction manager operable to:
obtain a local Wait-For Graph (WFG) at a first site of a distributed server environment;
select at least a first transaction and a first object as a candidate for detecting and resolving a deadlock in the distributed server environment;
determine that the first site is waiting for the first object locked by a second site based on the WFG at the first site;
determine that a third site is waiting for a second object locked by the first site;
send a first probe to the second site to determine whether the second site is waiting;
receive a second probe indicating that a site is waiting for an object locked by the first site, wherein the second probe further indicates the deadlock in the distributed server environment to be resolved, and
resolve the deadlock in the distributed server environment by victimizing the first transaction at the first site that is waiting for the first object.

10. The system of claim 9 , wherein the transaction manager is further operable to receive a reverse probe indicating that the second site is not waiting, wherein the reverse probe further indicates an absence of deadlocks in the distributed server environment.

11. The system of claim 9 , wherein the transaction manager is further operable to generate a set of all transactions and objects in the distributed server environment.

12. The system of claim 11 , wherein the transaction manager is further operable to:
count a deadlock query reference count for each of the objects in the set of all transactions and objects; and
count a transaction query reference count for each of the transactions and objects in the set of all transactions and objects.

13. The system of claim 12 , wherein the transaction manager is further operable to select at least the first transaction and the first object as the candidate for detecting and resolving the deadlock in the distributed server environment based on the counting of the deadlock query reference counts and the counting of the transaction query reference counts.

14. The system of claim 9 , wherein the transaction manager is further operable to:
generate a set of all transactions and objects in the distributed server environment; and
select at least one transaction and one object from the set of all transactions and objects as candidates for detecting and resolving the deadlock in the distributed server environment.

15. A computer program product comprising a computer readable hardware storage device having readable program code stored on the computer readable hardware storage device, the program code comprising:
program code to obtain a local Wait-For Graph (WFG) at a first site;
program code to determine that a first transaction at the first site is waiting for a first object locked by a second transaction at a second site based on the local WFG at the first site;
program code to determine that a third transaction at a third site is waiting for a second object locked by the first transaction at the first site;
program code to receive a first probe from the first site to determine whether a second site is waiting for an object locked by a third site;
program code to determine that the second site is waiting for the object locked by the third site;
program code to send a second probe to the third site to determine whether the third site is waiting, wherein the second probe further indicates the deadlock in the distributed server environment to be resolved; and
program code to resolve the deadlock in the distributed server environment by victimizing the first transaction at the first site that is waiting for the first object.

16. The computer program product of claim 15 , wherein the at least one component is further operable to:
determine that the second site is not waiting for the object locked by the third site; and
send a reverse probe to the first site indicating that the second site is not waiting for the object locked by the third site, wherein the reverse probe further indicates an absence of deadlocks in a distributed server environment.

17. The computer program product of claim 15 , wherein the program code further comprises:
program code to generate a set of all transactions and objects in the distributed server environment; and
program code to select at least one transaction and one object from the set of all transactions and objects as candidates for detecting and resolving the deadlock in the distributed server environment.

18. A computer system for detecting and resolving a deadlock in a distributed server environment, the system comprising:
one or more computer processors;
a computer readab

Assignees

• Nagpal Abhinay R
• Patil Sandeep R
• Ramanathan Sri
• Sivakumar Gandhi
• Trevathan Matthew B
• IBM

Inventors

• Nagpal Abhinay R
• Patil Sandeep R
• Ramanathan Sri
• Sivakumar Gandhi
• Trevathan Matthew B

Classifications

• H04L65/1006 Primary

  Electricity · mapped topic

• H04L69/40

  for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection (management of faults, events, alarms or notifications in data switching networks H04L41/06) · CPC title

• H04L65/1104 Primary

  Session initiation protocol [SIP] · CPC title

• H04L41/0816

  the condition being an adaptation, e.g. in response to network events · CPC title

• G06F9/524 Primary

  Deadlock detection or avoidance · CPC title