Short duration serialization express queue

Patent metadata

Field	Value
Publication number	US-10809975-B2
Application number	US-201715607437-A
Country	US
Kind code	B2
Filing date	May 27, 2017
Priority date	May 27, 2017
Publication date	Oct 20, 2020
Grant date	Oct 20, 2020

Abstract

A method for allocating a resource to multiple requesters is disclosed. In one embodiment, such a method includes maintaining, for a resource, a regular queue and an express queue. The method receives requests to control the resource and determines, for each request, an anticipated amount of time that the request needs to control the resource. In the event the anticipated amount of time for a request is greater than a selected threshold, the method allocates the request to the regular queue. In the event the anticipated amount of time for a request is less than the selected threshold, the method allocates the request to the express queue. The method provides priority to requests allocated to the express queue over requests allocated to the regular queue. A corresponding system and computer program product are also disclosed.

First claim

The invention claimed is:

1. A method for allocating a computing resource to a plurality of requesters, the method comprising:
maintaining a regular queue and an express queue, wherein each of the regular queue and the express queue are configured to hold requests to control a computing resource that is separate from the regular queue and the express queue;
receiving requests to control the computing resource, wherein controlling the resource comprises at least one of exclusively accessing the computing resource and sharing access to the computing resource;
determining, for each request, an anticipated amount of time that the request needs to control the computing resource;
in the event the anticipated amount of time for a request is greater than a selected threshold, allocating the request to the regular queue;
in the event the anticipated amount of time for a request is less than the selected threshold, allocating the request to the express queue; and
providing priority to requests allocated to the express queue over requests allocated to the regular queue.

2. The method of claim 1 , wherein requests allocated to each of the regular queue and express queue are ordered on a first-come, first-serve basis.

3. The method of claim 1 , wherein determining the anticipated amount of time comprises analyzing historical records for past requests to determine the anticipated amount of time.

4. The method of claim 1 , further comprising taking measures to prevent starvation of requests allocated to the regular queue.

5. The method of claim 4 , wherein taking measures comprises adjusting an anticipated amount of time for requests allocated to the regular queue to enable them to qualify for eventual allocation to the express queue.

6. The method of claim 1 , further comprising establishing a list of requests that should be allocated to the express queue.

7. The method of claim 1 , further comprising enabling a user to establish a default anticipated amount of time for a request.

8. A computer program product for allocating a computing resource to a plurality of requesters, the computer program product comprising a non-transitory computer-readable storage medium having computer-usable program code embodied therein, the computer-usable program code configured to perform the following when executed by at least one processor:
maintain a regular queue and an express queue, wherein each of the regular queue and the express queue are configured to hold requests to control a computing resource that is separate from the regular queue and the express queue;
receive requests to control the computing resource, wherein controlling the resource comprises at least one of exclusively accessing the computing resource and sharing access to the computing resource;
determine, for each request, an anticipated amount of time that the request needs to control the computing resource;
in the event the anticipated amount of time for a request is greater than a selected threshold, allocate the request to the regular queue;
in the event the anticipated amount of time for a request is less than the selected threshold, allocate the request to the express queue; and
provide priority to requests allocated to the express queue over requests allocated to the regular queue.

9. The computer program product of claim 8 , wherein requests allocated to each of the regular queue and express queue are ordered on a first-come, first-serve basis.

10. The computer program product of claim 8 , wherein determining the anticipated amount of time comprises analyzing historical records for past requests to determine the anticipated amount of time.

11. The computer program product of claim 8 , wherein the computer-usable program code is further configured to take measures to prevent starvation of requests allocated to the regular queue.

12. The computer program product of claim 11 , wherein taking measures comprises adjusting an anticipated amount of time for requests allocated to the regular queue to enable them to qualify for eventual allocation to the express queue.

13. The computer program product of claim 8 , wherein the computer-usable program code is further configured to establish a list of requests that should be allocated to the express queue.

14. The computer program product of claim 8 , wherein the computer-usable program code is further configured to enable a user to establish a default anticipated amount of time for a request.

15. A system for allocating a computing resource to a plurality of requesters, the system comprising:
at least one processor;
at least one memory device operably coupled to the at least one processor and storing instructions for execution on the at least one processor, the instructions causing the at least one processor to:
maintain, a regular queue and an express queue, wherein each of the regular queue and the express queue are configured to hold requests to control a computing resource that is separate from the regular queue and the express queue;
receive requests to control the computing resource, wherein controlling the resource comprises at least one of exclusively accessing the computing resource and sharing access to the computing resource;
determine, for each request, an anticipated amount of time that the request needs to control the computing resource;
in the event the anticipated amount of time for a request is greater than a selected threshold, allocate the request to the regular queue;
in the event the anticipated amount of time for a request is less than the selected threshold, allocate the request to the express queue; and
provide priority to requests allocated to the express queue over requests allocated to the regular queue.

16. The system of claim 15 , wherein requests allocated to each of the regular queue and express queue are ordered on a first-come, first-serve basis.

17. The system of claim 15 , wherein determining the anticipated amount of time comprises analyzing historical records for past requests to determine the anticipated amount of time.

18. The system of claim 15 , wherein the instructions further cause the at least one processor to take measures to prevent starvation of requests allocated to the regular queue.

19. The system of claim 18 , wherein taking measures comprises adjusting an anticipated amount of time for requests allocated to the regular queue to enable them to qualify for eventual allocation to the express queue.

20. The system of claim 15 , wherein the instructions further cause the at least one processor to establish a list of requests that should be allocated to the express queue.

Assignees

• IBM

Inventors

• Liguori Gregg L
• Mccune Franklin E
• Reed David C
• Scott Michael R

Classifications

• G06F5/065 Primary

  Partitioned buffers, e.g. allowing multiple independent queues, bidirectional FIFO's · CPC title

• G06F2205/065

  With bypass possibility · CPC title

• H04M3/523

  with call distribution or queueing · CPC title

• H04L47/566

  Deadline varies as a function of time spent in the queue · CPC title

• H04M3/5232

  Call distribution algorithms · CPC title