Locking contention resolution for shared resources
First Claim
1. A method of managing lock requests for a resource using a mechanism that serializes lock requests, when at least one exclusive lock request has been received from at least one deadlocked process and at least one shared lock request has been received from at least one deadlocked process, comprising:
- determining whether at least one exclusive lock request has been received ahead of at least one shared lock request; and
granting at least one shared lock request ahead of at least one exclusive lock request when at least one exclusive lock request has been received ahead of at least one shared lock request.
1 Assignment
0 Petitions
Accused Products
Abstract
Two methods for resolving locking contention for pseudo-deadlocked transactions without rolling back or aborting any of the deadlocked transactions are provided. In one method, one or more shared lock requests from deadlocked transactions are granted ahead of at least one exclusive lock request from a deadlocked transaction. In another method, all shared lock requests from deadlocked transactions are granted ahead of all exclusive lock requests from deadlocked transactions.
-
Citations
22 Claims
-
1. A method of managing lock requests for a resource using a mechanism that serializes lock requests, when at least one exclusive lock request has been received from at least one deadlocked process and at least one shared lock request has been received from at least one deadlocked process, comprising:
-
determining whether at least one exclusive lock request has been received ahead of at least one shared lock request; and granting at least one shared lock request ahead of at least one exclusive lock request when at least one exclusive lock request has been received ahead of at least one shared lock request. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A method of managing a plurality of lock requests for a plurality of resources using a plurality of mechanisms that serialize lock requests, when at least one exclusive lock request has been received for each resource from at least one deadlocked process and at least one shared lock request has been received for each resource from at least one deadlocked process, comprising:
-
determining whether at least one exclusive lock request has been received ahead of at least one shared lock request for each of the plurality of resources; and granting at least one shared lock request ahead of at least one exclusive lock request for each of the plurality of resources when at least one exclusive lock request has been received ahead of at least one shared lock request. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
-
15. A method of resolving locking contention among a plurality of deadlocked processes, where the deadlocked processes have made a plurality of lock requests for a plurality of resources, where at least one exclusive lock request from at least one deadlocked process and at least one shared lock request from at least one deadlocked process have been made for each resource, comprising:
-
determining whether at least one exclusive lock request has been received ahead of at least one shared lock request for each of the plurality of resources; and granting at least one shared lock request ahead of at least one exclusive lock request for each of the plurality of resources when at least one exclusive lock request has been received ahead of at least one shared lock request for each of the plurality of resources. - View Dependent Claims (16, 17, 18, 19, 20, 21, 22)
-
Specification