Scheduling server requests to decrease response time and increase server throughput

• US 6,154,769 A
• Filed: 03/27/1998
• Issued: 11/28/2000
• Est. Priority Date: 03/27/1998
• Status: Expired due to Term

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: Hewlett-Packard Company (HP Inc.)
• Inventors: Rokicki, Tomas Gerhard, Cherkasova, Ludmila
• Primary Examiner(s): Luu, Le Hien
• Assistant Examiner(s): VU, THONG H
• Application Number:
  US09/049,688
• Time in Patent Office: 977 Days
• Field of Search: 395/287, 395/650, 395/496, 395/292, 395/800, 395/705, 395/732, 395/874, 370/94.2, 370/429, 379/216, 379/207, 709/219, 709/217, 709/242, 709/207, 709/228, 709/232, 709/103, 364/514, 340/825.08, 705/1, 710/112
• US Class Current: 709/207
• CPC Class Codes: G06F 2209/5021 Priority
• CPC Class Codes: G06F 9/5027 the resource being a machine, e.g. CPUs, Servers, Terminals

Abstract

A method for operating a server on a computer network to supply data stored on the server in response to requests received on the network. The server stores the requests in a queue and determines a priority value for the request. The priority value includes the sum of a counter value and a cost value, the cost value being monotonically related to the quantity of server resources needed to service the request. When the server selects one of the requests stored in the queue for servicing it picks the request having the lowest priority value of the requests stored in the queue. The selected request is removed from the queue and the counter value is incremented by a value proportional to the cost value associated with the request selected for servicing. In one embodiment, the cost value is proportional to the length of a file specified in the received request. In one embodiment, one of the received requests also includes information specifying a class for the request. The server also determines a maximum priority value for that class, the maximum priority value being at least as great as the priority value having the highest value for any request of that class currently stored in the queue. The server compares the determined priority value for the received request with the maximum priority value and changes the determined priority value to a value greater than the maximum value if the determined priority value was less than or equal to the maximum priority value.

Claims

1. A method for operating a server on a computer network to supply data stored on said server in response to requests received on said network, said method comprising the steps of:

receiving a request on said network;

determining a priority value for said request, said priority value comprising the sum of a counter value and a cost value, said cost value being monotonically related to the quantity of server resources needed to service said request;

storing said request in a queue;

selecting one of said requests stored in said queue for servicing, said selected request having the lowest priority value of said requests stored in said queue;

said selected request being removed from said queue;

and incrementing said counter by a value proportional to said cost value associated with said request selected for servicing.

2. The method of claim 1 wherein said cost value is proportional to the length of a file specified in said received request.

3. The method of claim 1 wherein said counter value is set to zero each time said queue is emptied.

4. The method of claim 1 wherein one of said received requests also includes information specifying a class for said request and wherein said method further comprises the steps of:

determining a maximum priority value for that class, said maximum priority value being at least as great as said priority value having the highest value for any request of that class currently stored in said queue; and

comparing said determined priority value for said received request with said maximum priority value and changing said determined priority value to a value greater than said maximum value if said determined priority value was less than or equal to said maximum priority value.

5. The method of claim 1 wherein said requests include a priority indicator and wherein a separate queue is maintained for each possible value of said priority indicator, said request being stored in said queue corresponding to said priority indicator received with said request, said next request to be serviced being selected from said queue storing requests having the highest priority as indicated by said priority indicator.

6. The method of claim 1 wherein information specifying the cost value for each possible file on said server that can be returned in response to a request is stored in a table on said server.

7. The method of claim 6 further comprising the step of providing a program that allows a user of said server to alter said information specifying said cost value.