Reducing lock occurrences in server/database systems

• US 9,558,227 B2
• Filed: 12/07/2015
• Issued: 01/31/2017
• Est. Priority Date: 10/30/2012
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Gocek, Pawel, Lech, Grzegorz K., Malecki, Bartlomiej T., Marszalek, Jan, Wawrzyczek, Joanna
• Primary Examiner(s): LE, HUNG D
• Application Number:
  US14/960,500
• Publication Number:
  US 20160085776A1
• Time in Patent Office: 421 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 16/1767 Concurrency control, e.g. optimistic or pessimistic approaches
• CPC Class Codes: G06F 16/21 Design, administration or maintenance of databases
• CPC Class Codes: G06F 16/217 Database tuning G06F16/2282 takes precedence; database performance monitoring G06F11/3409
• CPC Class Codes: G06F 16/2336 Pessimistic concurrency control approaches, e.g. locking or multiple versions without time stamps
• CPC Class Codes: G06F 16/2343 Locking methods, e.g. distributed locking or locking implementation details
• CPC Class Codes: G06F 16/2365 Ensuring data consistency and integrity
• CPC Class Codes: G06F 16/285 Clustering or classification
• CPC Class Codes: G06F 16/955 using information identifiers, e.g. uniform resource locators [URL]
• CPC Class Codes: G06F 9/526 Mutual exclusion algorithms

Abstract

Limiting the number of concurrent requests in a database system. Arranging requests to be handled by the database system in at least one queue. Defining a maximum value (SS) of concurrent requests corresponding to the at least one queue. Monitoring at least one queue utilization parameter corresponding to the at least one queue and calculating a performance value based on the at least one queue utilization parameter. Adapting the maximum value (SS) of concurrent requests of the at least one queue dynamically based on the performance value (PF) in order to improve system performance. Limiting the number of concurrent requests of the at least one queue dynamically based on the dynamically adapted maximum value (SS).

Claims

1. A computer-implemented method for limiting the number of concurrent requests in a database system comprising:

defining a maximum value (SS) of concurrent requests corresponding to at least one queue;

monitoring at least one queue utilization parameter corresponding to the at least one queue and calculating a performance value (PF) based on the at least one queue utilization parameter;

adapting the maximum value (SS) of concurrent requests of the at least one queue dynamically based on the performance value (PF); and

limiting the number of concurrent requests of the at least one queue dynamically based on the dynamically adapted maximum value (SS),

wherein a maximum length (QS) of the at least one queue is adapted dynamically based on the maximum value (SS) of concurrent requests, the at least one queue utilization parameter and a timeout value.

2. The method of claim 1, wherein the requests are grouped in at least two groups, wherein each of the at least two groups is associated with a dedicated queue and a queue-specific maximum value (SS) of concurrent requests.

3. The method of claim 2, wherein a request is assigned to one off the at least two groups based on the likelihood of locking of the request with other requests contained in the one of the at least two groups, based on the origin of the request or based on the service type of the request.

4. The method of claim 2, wherein a learning mechanism is implemented to derive information about the cause of an exception and to distribute the requests among the at least two groups based on the derived information.

5. The method of claim 1, wherein the number of concurrent requests is limited by rejecting incoming requests before insertion in the queue and/or by removing requests out of the queue.

6. A computer program product for limiting the number of concurrent requests in a database system, the computer program product comprising:

one or more computer-readable storage media and program instructions stored on the one or more computer-readable storage media, the program instructions comprising;

program instructions to define a maximum value (SS) of concurrent requests corresponding to at least one queue;

program instructions to monitor at least one queue utilization parameter corresponding to the at least one queue and calculating a performance value (PF) based on the at least one queue utilization parameter;

program instructions to adapt the maximum value (SS) of concurrent requests of the at least one queue dynamically based on the performance value (PF); and

program instructions to limit the number of concurrent requests of the at least one queue dynamically based on the dynamically adapted maximum value (SS),

wherein a maximum length (QS) of the at least one queue is adapted dynamically based on the maximum value (SS) of concurrent requests, the at least one queue utilization parameter and a timeout value.

7. The computer program product of claim 6, wherein the requests are grouped in at least two groups, wherein each of the at least two groups is associated with a dedicated queue and a queue-specific maximum value (SS) of concurrent requests.

8. The computer program product of claim 7, wherein a request is assigned to one of the at least two groups based on the likelihood of locking of the request with other requests contained in the one of the at least two groups, based on the origin of the request or based on the service type of the request.

9. The computer program product of claim 7, wherein a learning mechanism is implemented to derive information about the cause of an exception and to distribute the requests among the at least two groups based on the derived information.

10. The computer program product of claim 6, wherein the number of concurrent requests is limited by rejecting incoming requests before insertion in the queue and/or by removing requests out of the queue.

11. A computer system for limiting the number of concurrent requests in a database system, the computer system comprising:

one or more computer processors, one or more computer-readable storage media, and program instructions stored on the one or more computer-readable storage media for execution by at least one of the one or more computer processors, the program instructions comprising;

program instructions to define a maximum value (SS) of concurrent requests corresponding to at least one queue;

program instructions to monitor at least one queue utilization parameter corresponding to the at least one queue and calculating a performance value (PF) based on the at least one queue utilization parameter;

program instructions to adapt the maximum value (SS) of concurrent requests of the at least one queue dynamically based on the performance value (PF); and

program instructions to limit the number of concurrent requests of the at least one queue dynamically based on the dynamically adapted maximum value (SS),

wherein a maximum length (QS) of the at least one queue is adapted dynamically based on the maximum value (SS) of concurrent requests, the at least one queue utilization parameter and a timeout value.

12. The computer system of claim 11, wherein the requests are grouped in at least two groups, wherein each of the at least two groups is associated with a dedicated queue and a queue-specific maximum value (SS) of concurrent requests.

13. The computer system of claim 12, wherein a request is assigned to on of the at least two groups based on the likelihood of locking of the request with other requests contained in the one of the at least two groups, based on the origin of the request or based on the service type of the request.

14. The computer system of claim 12, wherein a learning mechanism is implemented to derive information about the cause of an exception and to distribute the requests among the at least two groups based on the derived information.

15. The computer system of claim 11, wherein the number of concurrent requests is limited by rejecting incoming requests before insertion in the queue and/or by removing requests out of the queue.