Dynamically managing computer resources based on valuations of work items being processed

• US 7,941,427 B2
• Filed: 04/14/2004
• Issued: 05/10/2011
• Est. Priority Date: 04/14/2004
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Jans, Douglas David, Barsness, Eric Lawrence, Santosuosso, John Matthew, Ruhlow, Randy William
• Primary Examiner(s): LeRoux; Etienne P
• Assistant Examiner(s): Nguyen; Cindy
• Application Number:
  US10/824,054
• Publication Number:
  US 20050234935A1
• Time in Patent Office: 2,582 Days
• Field of Search: 707/9.5, 707/100, 707/720, 705/9, 705/400, 709/226, 718/100, 718/108
• US Class Current: 707/720
• CPC Class Codes: G06F 2209/5019 Workload prediction
• CPC Class Codes: G06F 2209/5021 Priority
• CPC Class Codes: G06F 2209/508 Monitor
• CPC Class Codes: G06F 9/505 considering the load
• CPC Class Codes: G06Q 99/00 Subject matter not provided for in other groups of this subclass
• CPC Class Codes: H04L 47/70 Admission control; Resource allocation
• CPC Class Codes: H04L 47/83 based on usage prediction

Abstract

A computer-implemented method, system and computer product including a scheduling manager residing in memory; whereby the scheduling manager dynamically manages access of additional computer resources to be applied to work items of a program based on their valuations relative to the processing costs thereof.

Claims

1. A computer-implemented method for managing access to computer resources, the method comprising:

(a) defining a respective financial valuation of each of a plurality of work items to be processed by one or more data processing systems;

(b) comparing the respective financial valuation of each respective said work item to a respective cost of accessing additional computer resources necessary to process the work item in a current time period, said additional computer resources being external to said one or more data processing systems;

(c) with respect to each said work item for which the respective financial valuation of the work item exceeds the respective cost of accessing additional computer resources necessary to process the work item in the current time period, dynamically accessing additional computer resources necessary to process the work item in the current time period;

(d) with respect to each said work item for which the respective financial valuation of the work item does not exceed the respective cost of accessing additional computer resources necessary to process the work item in the current time period, deferring processing of the work item to a subsequent time period; and

(e) repeating said (b) through (d) in one or more subsequent time periods with respect to each said work item deferred by said (d) until each said work item has been processed.

2. The method of claim 1 further comprising applying a valuation heuristic to each work item.

3. The method of claim 1 further comprising applying a priority algorithm for preventing starvation of computer resources to those work items which have been delayed, whereby the processing of all the work items in a program is completed.

4. The method of claim 2 further comprising having the priority algorithm increase respective valuations of delayed work items so as to complete processing of each of the work items prior to or at a cut-off processing date of the work item.

5. The method of claim 1, wherein said method is used in a networked environment including a grid of computing resources, and a request manager of the grid to receive requests of one or more customers for utilization of computing resources of the grid;

wherein said additional computer resources comprise computing resources of said grid of computing resources;

wherein one or more computer systems of a customer is coupled to the request manager and include one or more processors;

a memory coupled to at least the one processor; and

, a scheduling manager residing in the memory and executable by the at least the one processor.

6. A method of providing fee-based processing for programs in a processor system, whereby fees are based on utilization of computer resources for completing processing a program, the processor system including at least one processor;

a memory coupled to the at least one processor, and a scheduling manager residing in the memory, the method comprising the steps of;

(a) defining a respective financial valuation of each of a plurality of programs to be processed;

(b) comparing the respective financial valuation of each respective said program to a respective projected fee for utilization of computer resources to process said program in a current time period;

(c) with respect to each said program for which the respective financial valuation of the program exceeds the respective projected fee for utilization of computer resources to process the program in the current time period, dynamically accessing computer resources to be applied to process the program in the current time period;

(d) with respect to each said program for which the respective financial valuation of the program does not exceed the respective projected fee for utilization of computer resources to process the program in the current time period, deferring processing of the program to a subsequent time period; and

(e) repeating said (b) through (d) in one or more subsequent time periods with respect to each said program deferred by said (d) until each said program has been processed; and

(f) assessing a fee for the dynamically accessed computer resources to be used.

7. The method of claim 6 further comprising applying a valuation heuristic to each work item for establishing the valuation of each work item.

8. The method of claim 7 further comprising applying a priority algorithm for preventing starvation of computer resources to those work items which have been delayed, whereby the processing of all the work items in a program is completed.

9. The method of claim 8 wherein the dynamic determination is based on different attributes of the one or more work items forming at least part of a program.

10. A data processing apparatus comprising:

at least one processor;

a memory coupled to the at least one processor; and

a scheduling manager residing in the memory and executable on the at least one processor, the scheduling manager dynamically managing access of each of a plurality of work items to additional computer resources external to said data processing apparatus for processing the respective work item, each said work item being a respective item of work performable by a data processing system and having a respective financial valuation;

wherein said scheduling manager, in each of a plurality of time periods, compares the respective financial valuation of each unprocessed work item to a respective cost of accessing said additional computer resources to process the work item in the respective time period, and with respect to each said work item for which the respective financial valuation exceeds the respective cost of accessing the additional computer resources to process the work item in the respective time period, dynamically accesses the additional computer resources to process the work item in the respective time period; and

with respect to each said work item for which the respective financial valuation does not exceed the respective cost of accessing the additional computer resources to process the work item in the respective time period, defers processing of the work time to a subsequent time period.

11. The apparatus of claim 10 wherein the scheduling manager applies a valuation heuristic to each work item.

12. The apparatus of claim 10 wherein the scheduling manager applies a priority algorithm for preventing starvation of computer resources to those work items which have been deferred, whereby the processing of all the work items is completed.

13. The apparatus of claim 12 wherein the priority algorithm increases respective valuations of delayed work items so as to complete processing of each of the work items prior to or at a cut-off processing date of the work item.

14. A program product comprising:

a scheduling manager embodied as a plurality of computer-executable instructions recorded on a computer-readable storage medium, wherein said scheduling manager, when executed by a computer system, causes the computer system to;

(a) compare a respective defined financial valuation of each of a plurality of work items to be processed by the computer system to a respective cost of accessing additional computer resources necessary to process the work item in a current time period, said additional computer resources being external to said computer system;

(b) with respect to each said work item for which the respective financial valuation of the work item exceeds the respective cost of accessing additional computer resources necessary to process the work item in the current time period, dynamically accesses additional computer resources necessary to process the work item in the current time period;

(c) with respect to each said work item for which the respective financial valuation of the work item does not exceed the respective cost of accessing additional computer resources necessary to process the work item in the current time period, defers processing of the work item to a subsequent time period; and

(d) repeats said (a) through (c) in one or more subsequent time periods with respect to each said work item deferred by said (c) until each said work item has been processed.

15. The program product of claim 14 wherein the scheduling manager applies a valuation heuristic to each work item to establish a valuation for each of the work items.

16. The program product of claim 14 wherein the scheduling manager applies a priority algorithm for preventing starvation of computer resources to those work items which have been delayed, whereby the processing of all the work items in a program will be completed.

17. The program product of claim 16 wherein the priority algorithm increases respective valuations of delayed work items so as to complete processing of each of the work items prior to or at a cut-off processing date of the work item.

18. A networked environment, comprising:

a grid of computing resources;

a request manager of the grid to receive requests of one or more customers for utilization of computing resources of the grid;

one or more computer systems of a customer coupled to the request manager;

the one computer system comprising one or more processors;

a memory coupled to at least the one processor of the one computer system; and

,

a scheduling manager residing in the memory and executable on the at least one processor, the scheduling manager dynamically managing access of each of a plurality of work items to additional computer resources external to said one or more computer systems of a customer for processing the respective work item, each said work item being an item of work performable by a data processing system and having a respective financial valuation;

wherein said scheduling manager, in each of a plurality of time periods, compares the respective financial valuation of each unprocessed work item to a respective cost of accessing said additional computer resources to process the work item in the respective time period, and with respect to each said work item for which the respective financial valuation exceeds the respective cost of accessing the additional computer resources to process the work item in the respective time period, dynamically accesses the additional computer resources to process the work item in the respective time period; and

with respect to each said work item for which the respective financial valuation does not exceed the respective cost of accessing the additional computer resources to process the work item in the respective time period, defers processing of the work time to a subsequent time period.

19. The environment of claim 18 wherein the scheduling manager applies a valuation heuristic to each work item.

20. The environment of claim 18 wherein the scheduling manager applies a priority algorithm for preventing starvation of computer resources to those work items which have been delayed, whereby the processing of all the work items in a program is completed.

21. The environment of claim 20 wherein the scheduling manager increases respective valuations of delayed work items so as to complete processing of each of the work items prior to or at a cut-off processing date of the work item.

22. A computer-implemented method for managing access to computer resources, the method comprising:

(a) providing a plurality of work items for processing by one or more data processing systems in a current time period, each work item having a respective financial valuation;

(b) selecting a first subset of said plurality of work items for processing by a first data processing system in the current time period according to said financial valuations;

(c) with respect to each said work item not included in said first subset, comparing the respective financial valuation of the work item to a respective cost of accessing additional computer resources external to said first data processing system to process the work item in the current time period;

(d) with respect to each said work item not included in said first subset for which the respective financial valuation of the work item exceeds the respective cost of accessing additional computer resources external to said first data processing system to process the work item in the current time period, dynamically accessing additional computer resources external to said first data processing system to process the work item in the current time period;

(e) with respect to each said work item not included in said first subset for which the respective financial valuation of the work item does not exceed the respective cost of accessing additional computer resources external to said first data processing system to process the work item in the current time period, deferring processing of the work item to a subsequent time period; and

(f) repeating said (a) through (e) in multiple time periods, wherein any work item deferred by (e) is included in the plurality of work items of each subsequent time period until the work item is processed, and wherein for at least some time periods, the first subset of the respective plurality of work items includes fewer than all of the respective plurality of work items.

23. The method of claim 22 further comprising applying a priority algorithm for preventing starvation of computer resources to those work items which have been deferred, whereby the processing of all the work items is completed.

24. The method of claim 22, wherein said method is used in a networked environment including a grid of computing resources, and a request manager of the grid to receive requests of one or more customers for utilization of computing resources of the grid;

wherein said additional computer resources comprise computing resources of said grid of computing resources.