Browse Prior Art Database

Method and System for Dead Peer Detection among Peer Processes Using a Simulated Deadlock

IP.com Disclosure Number: IPCOM000235731D
Publication Date: 2014-Mar-24
Document File: 2 page(s) / 49K

Publishing Venue

The IP.com Prior Art Database

Abstract

A method and system is disclosed for dead peer detection among two or more peer processes using a simulated deadlock.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 59% of the total text.

Page 01 of 2

Method and System for Dead Peer Detection among Peer Processes Using a Simulated Deadlock

Disclosed is a method and system for dead peer detection among two or more peer processes using a simulated deadlock. The method and system relies on file system locking mechanisms to create a simulated deadlock scenario among a group of peers. The two or more peer processes have access to the same file system. The file system can have network mapping involved as long as the network layer is transparent with respect to one or more file locks. Thereafter, the method and system detects a peer death and a remainder of the two or more peer processes reacts to the detection in different ways. For example, in a self-healing system, work

assigned to the dead peer can be redistributed among the remainder of the two or more peer processes. In another example, the remainder of the two or more peer processes can be gracefully terminated.

The figure illustrates a program flow executed by the method and system for graceful termination of the remainder of the two or more peer processes during the peer death.

Figure

1


Page 02 of 2

The method and system disclosed herein consists of two main parts. In the first part, each peer in a peer group provides one or more locks to one or more sections of a file that are considered to be "alive" sections. As long as the two or more peer

processes have not crashed, the locking of the one or more sections signifies that the two or more peer processes a...