Priority differentiated subtree locking

Details Priority differentiated subtree locking Priority differentiated subtree locking

2007-04-17

2007-04-17

Gaffin, Jeffrey (Department: 2165)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C709S223000

Reexamination Certificate

active

10222953

ABSTRACT:
A locking arrangement for data structures is provided that prevents deadlocks, but still allows different threads to simultaneously obtain locks on different nodes of a data structure for both read and write operations. The locking system will fail a request to lock one or more resources in a data structure if access to those resources has already been restricted by a conflicting lock of an equal or higher priority. The locking system may also employ preemptable and non-preemptable locks such that, if a preemptable lock with a lower priority has restricted access to resources, then the locking system will preempt the lower priority lock in favor of a conflicting higher priority lock. Alternately, if a non-preemptable lock with a lower priority has restricted access to resources, then the locking system will wait until the lower priority lock is removed before implementing a requested conflicting higher priority lock.

REFERENCES:
patent: 5414839 (1995-05-01), Joshi
patent: 5761659 (1998-06-01), Bertoni
patent: 6029190 (2000-02-01), Oliver
patent: 6105057 (2000-08-01), Kuftedjian et al.
patent: 6480918 (2002-11-01), McKenney et al.

Affiliated with

Also associated with

Rating

Priority differentiated subtree locking does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Priority differentiated subtree locking, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Priority differentiated subtree locking will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3727380