Lock acquisition among nodes of divided cluster

Data processing: database and file management or data structures – Data integrity – Concurrent read/write management using locks

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S226000

Reexamination Certificate

active

07991753

ABSTRACT:
The acquisition of a lock among nodes of a divided cluster is disclosed. A method is performable by each of at least one node of the cluster. A node waits for a delay corresponding to its identifier. The node asserts intent to acquire the lock by writing its identifier to X and Y variables where another node has failed to acquire the lock. The node waits for another node to acquire the lock where the other node has written to X, and proceeds where Y remains equal to its own identifier. The node waits for another node to acquire the lock where the other node has written to a Z variable, and writes its own identifier to Z and proceeds where the other node has failed. The node writes a value to Y indicating that it is acquiring the lock, and maintains acquisition by periodically writing to Z.

REFERENCES:
patent: 5673384 (1997-09-01), Hepner et al.
patent: 6279032 (2001-08-01), Short et al.
patent: 6314526 (2001-11-01), Arendt et al.
patent: 2003/0078996 (2003-04-01), Baldwin
patent: 2005/0010838 (2005-01-01), Davies et al.
patent: 2005/0015657 (2005-01-01), Sugiura et al.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Lock acquisition among nodes of divided cluster does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Lock acquisition among nodes of divided cluster, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lock acquisition among nodes of divided cluster will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2779572

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.