Appeal No. 1996-1243
Application No. 08/226,224
entry of the amendment by the examiner. This petition was
granted on February 17, 1999 [Paper #32]. Accordingly, claims
27-30, 32, 33, 35-43 and 45-55 are now the claims on appeal in
this application.
The disclosed invention pertains to the field of shared
resources among a plurality of users. Competing requests by
users for shared resources which may be “owned” by other users
can cause conditions of deadlock to occur. A lock wait matrix
is created which represents a hierarchy of transactions
waiting to access a resource. The invention is concerned with
reducing the search time through such a lock wait matrix in
determining potential deadlock conditions.
Representative claim 27 is reproduced as follows:
27. A method of reducing search time through a lock wait
matrix representing a hierarchy of transactions waiting to
access a resource, each of said transactions which waits on
another transaction descends from said other transaction in
said hierarchy, said method comprising the computer
implemented steps of:
searching in said hierarchy a path of transactions including a
parent transaction and all descendants of said parent
transaction, and recording transactions encountered in the
search, said parent transaction not being deadlocked; and
subsequently searching, generally downwardly through said
hierarchy, another path of transactions emanating from a
transaction of the first said path, recording transactions
2
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 12 13 Next
Last modified: November 3, 2007