Method and System For Managing a Common Resource In a Computing System

• US 20080256547A1
• Filed: 02/23/2005
• Published: 10/16/2008
• Est. Priority Date: 02/23/2005
• Status: Abandoned Application

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Brahmavar, Deepak
• Application Number:
  US11/884,790
• Publication Number:
  US 20080256547A1
• Time in Patent Office: Days
• US Class Current: 718/104
• CPC Class Codes: G06F 9/526 Mutual exclusion algorithms

Abstract

The invention, in one embodiment, provides a method for acquiring and releasing a lock over a common resource in a computing system. After a lock has been acquired over a common resource. A determination (210) is made as to whether another request for the common resource has been made. If the other request has been made (212), the lock over the common resource is released so that the common resource becomes available for use by the another request (218).

Claims

1. A method for acquiring and releasing locks to manage a common resource in a computing system, comprising the steps of, after a lock has been acquired over a common resource, determining whether other requests for the common resource has been made, and if the other requests have been made, releasing the lock over the common resource so that the common resource becomes available for use by the other requests.

2. A method in accordance with claim 1, comprising the further step of, when the lock has been acquired but not released during iteration of a loop, releasing the lock at the termination of the loop.

3. A method in accordance with claim 2, comprising the further step of determining whether the other requests for the common resource have been made, by examining a pending request variable arranged to store a value indicative of whether the other requests for the common resource have been made.

4. A method in accordance with claim 2, comprising the further step of, during the step of acquiring the lock, checking to determine whether the lock is already acquired by the current requester, and if so, taking no action to attempt to acquire the lock.

5. A method in accordance with claim 3, comprising the further step of, during the step of acquiring the lock, if the lock is acquired successfully, setting the pending request variable to a value which indicates that the current lock request has been satisfied.

6. A method in accordance with claim 3, comprising the further step of, during the step of acquiring the lock, if the lock cannot be acquired, setting the pending request variable to a value which indicates that there are other pending requests for the lock.

13. A computer readable medium provided with program data that, when loaded onto a computing system, executes the method steps of claim 1.

7. A system for acquiring and releasing locks to manage a common resource in a computing system, comprising means to acquire a lock over a common resource, means to determine whether another request for the common resource has been made once the lock is acquired, and releasing means arranged to, if the another request has been made, release the lock over the common resource wherein the common resource becomes available for use by the another request.

8. A system in accordance with claim 7, comprising means arranged to release the lock at the termination of a loop, when the lock has been acquired but not released during iteration of the loop.

9. A system in accordance with claim 8, comprising the provision of means to contain a pending request variable arranged to store a value, wherein the determining means examines the pending request variable to determine whether other requests for the common resource have been made.

10. A system in accordance with claim 8, wherein the determining means determines whether the lock is already acquired by the current requester, and if so, takes no action to attempt to acquire the lock.

11. A system in accordance with claim 9, wherein, if the lock is acquired successfully, the pending request variable is set to a value which indicates that there are no other requests for the lock.

12. A system in accordance with claim 9, wherein, if the lock cannot be acquired, the pending request variable is set to a value which indicates that there are other pending requests for the lock.