Priority promotion for service requests

• US 9,218,211 B2
• Filed: 01/02/2009
• Issued: 12/22/2015
• Est. Priority Date: 01/02/2009
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Friedman, Jacob W., Pierce, Bernard, Relson, Peter J.
• Primary Examiner(s): Rones, Charles
• Assistant Examiner(s): CHRZANOWSKI, MATTHEW R
• Application Number:
  US12/348,075
• Publication Number:
  US 20100174873A1
• Time in Patent Office: 2,545 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 12/08 in hierarchically structured memory systems, e.g. virtual memory systems
• CPC Class Codes: G06F 2209/5021 Priority
• CPC Class Codes: G06F 9/5038 considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration scheduling strategies G06F9/4881 and subgroups

Abstract

A method for priority promotion of a service request comprises receiving the service request for a target address space into a set of work requests, the set of work requests comprising a plurality of service requests for the target address space, the service request originating from a source address space, the service request having a priority equivalent to a priority of the target address space, the source address space having a higher priority than the target address space; determining a number of service requests for the target address space in the set of work requests; and, in the event the number of service requests for the target address space exceeds a predetermined value, promoting the priority of the service request to the priority of the source address space.

Claims

1. A method for priority promotion of a service request comprising:

receiving the service request for a target address space into a set of work requests, the set of work requests comprising a plurality of service requests for the target address space, the service request originating from a source address space, the service request having a priority equivalent to a priority of the target address space, the source address space having a higher priority than the target address space;

determining a number of service requests for the target address space in the set of work requests; and

,

in the event the number of service requests for the target address space exceeds a predetermined value, promoting the priority of the service request to the priority of the source address space.

2. The method of claim 1, further comprising executing work associated with the service request.

3. The method of claim 1, further comprising promoting a predetermined number of subsequently received service requests for the target address space.

4. A computer program product comprising a non-transitory computer readable medium containing computer code that, when executed by a computer, implements a method for priority promotion of a service request, the method comprising:

receiving the service request for a target address space into a set of work requests, the set of work requests comprising a plurality of service requests for the target address space, the service request originating from a source address space, the service request having a priority equivalent to a priority of the target address space, the source address space having a higher priority than the target address space;

determining a number of service requests for the target address space in the set of work requests; and

,

in the event the number of service requests for the target address space exceeds a predetermined value, promoting the priority of the service request to the priority of the source address space.

5. The computer program product according to claim 4, further comprising executing work associated with the service request.

6. The computer program product according to claim 4, further comprising promoting a predetermined number of subsequently received service requests for the target address space.