|Publication number||US8041796 B2|
|Application number||US 10/136,483|
|Publication date||Oct 18, 2011|
|Filing date||May 2, 2002|
|Priority date||May 2, 2002|
|Also published as||US20030208580|
|Publication number||10136483, 136483, US 8041796 B2, US 8041796B2, US-B2-8041796, US8041796 B2, US8041796B2|
|Inventors||Joe K. Presley|
|Original Assignee||Hewlett-Packard Development Company, L.P.|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (12), Referenced by (3), Classifications (12), Legal Events (3)|
|External Links: USPTO, USPTO Assignment, Espacenet|
The technical field is use control of assets in a computer system that executes multiple processes.
Modern computer systems may execute multiple processes in parallel fashion. However, this parallel operation may impose performance penalties on the computer system when one or more of the parallel processes consumes so much of the limited resources of the computer system that a higher priority process cannot use the resources needed to complete execution in an expected, design timeframe. Alternatively, once one process has initiated, subsequent processes may not be able to execute until completion of the first process, even though processor resources would otherwise be available.
A computer system incorporates means for controlling access and usage of one or more processors in the computer system. The means may include hardware and software features. The means may operate according to specified steps according to a specific algorithm. In an embodiment, the system may include a discovery executable that discovers a target process for duration management. The system may further include a duration monitor that determines a percent completion of a target process. The percent completion information may be provided to a process duration controller that uses process information and the percent completion information to calculate a run-time metric. The run-time metric may then be provided to a process resource manager that controls resources consumed by the target process.
An apparatus for controlling resources in a computer system may include means for identifying target processes for duration management, means, coupled to the identifying means, for receiving process information for the identified target processes, means, coupled to the receiving means, for monitoring process information from the target processes, means, coupled to the monitoring means, for computing process run-time metrics, and means, coupled to the computing means, for receiving the run-time metrics and for adjusting the resources based on the received run-time metrics.
A method for controlling resources in a computer system may include the steps of discovering a target process executing on the computer system, including determining target process information, monitoring completion of the target process, wherein percent completion information for the target process is determined, providing the percent completion information and the target process information to a process duration controller, computing a run-time metric based on the received information, providing the run-time metric to a resource manager, and adjusting allocation of the resources in the computer system consistent with the run-time metric.
The detailed description will refer to the following drawings, wherein like numerals refer to like elements, and wherein:
The system 10 uses the process duration controller 20 and the process resource manager 25 to control resource utilization by an application, program, or process running on the system 10. System operating data may be stored in the memory 27, and such stored operating data may be used by the process duration controller 20 and the process resource manager 25 to optimize or otherwise control utilization of the system resources.
The system 10 is shown with three CPUs 30, 31, and 32. However, the system 10 may operate with more or fewer CPUs. In addition, the system 10 could be configured with other processor types, such as application specific integrated circuits (ASICs), for example. In the system 10, the CPUs 30-32 represent shared resources. The system 10 may also include other shared resources besides processors. Such other resources include printers, memory, and input/output (I/O) devices, for example. The system 10 supports execution of one or more applications, programs or processes. As illustrated by way of example, the process group 40 includes three processes 41, 42, and 43. Other process groups, such as the processor groups 50 and 60 may include additional processes.
The processes 41-43 may execute (i.e., be active) simultaneously in real time, may execute sequentially in real time, or may execute in any combination of simultaneous/sequential real time operation. That is, the processes 41-43 may execute in some overlapping real-time fashion. Furthermore, the processes 41-43 may execute over different increments of real time. Finally, the processes 41-43 may have different priorities of execution. However, if a lower priority process is already executing, execution of a higher priority process may be blocked, or delayed, until execution of the active, lower priority process completes.
When executing in an overlapping fashion, the processes 41-43 may compete for resources of the system 10. As noted above, one such resource is the system processors, which in the illustrated example include the CPUs 30-32. Thus, if the process 41 begins execution at time 0, while the other processes 42 and 43 are not executing, then the process 41 may consume all the processor resources of the system 10 until execution of the process 41 is complete. Alternatively, execution of the process 41 may proceed in a step-wise manner in which during specific units of computer time (i.e., computer cycles), the process 41 is executing followed by units of computer time when the process 41 is not executing. This step-wise execution in computer time may continue until execution of the process 41 is complete. While the process 41 is executing in this step-wise fashion, the process 41 may consume all the processor resources of the system 10. During computer time in which the process 41 is not executing, other processes 42, 43 may consume the processor resources of the system 10.
The fact that a specific process, such as the process 41, could consume all the processor resources of the system 10 (or could consume all of another type of resource of the system 10) may present a problem in terms of overall system operation when intended execution of processes overlaps. In particular, when intended process execution overlaps, one process could prevent or slow down execution of one or more other processes. To optimize operation of the system 10, the process duration controller 20 monitors all active processes, such as the processes 41-43 when executing or active, and the process resource manager 25 controls the execution or run-rate of the processes by allocating processor resources among the processes 41-43. The process duration controller 20 may interact with the process resource manager 25 in order to achieve specific performance goals for each of the processes 41-43 and the system 10.
To properly manage and allocate system resources, data related to operation of the processes on the system 10 is required. For example, data related to the computer time (cycles or clicks) that each of the processes 41-43 need to execute may be gathered and stored in the system 10, and then used to manage or allocate processor resources to the processes 41-43. In this context, a tick is approximately the number of CPU cycles that are available in 1/100th of a second. A metric may be defined for each process, such as the processes 41-43, that specifies the tick-rate (ticks per second) at which the process should execute. Other metrics, such as total cycles, cycles per second, seconds (real time), may also be defined or specified for execution of a process. The process duration controller 20, in conjunction with the process resource manager 25 may then use the specified metric (e.g., ticks per second) to control execution of a specific process. For example, if the process 41 is active, the process duration controller 20 may assign only enough CPU capacity to execution of the process 41 so that such execution is completed at the specified tick rate. Other active processes would then have access to remaining CPU resources such that these other active processes are also able to execute at their specified tick rate.
In operation, the process duration controller 20 manages the duration of active processes by monitoring an average number of ticks the process duration controller 20 receives over a pre-defined interval (the process resource management interval), comparing the average number of ticks received over the interval (i.e., the measured tick rate) to the number of ticks that the process should receive during that same interval (the desired tick rate), and sending a ratio of the measured tick rate to desired tick rate to the process resource manager 25 for any needed CPU resource allocation adjustment. The desired tick rate may be based on a user-defined and desired process duration. When the ratio equals 1, the process is receiving the proper CPU resource allocation to satisfy the user's requirement for process duration.
The process resource manager 25 uses previous run-time values (i.e., historical ticks for the process) as a basis for calculating a final execution time of the process being managed. The historical ticks represents the expected number of ticks that the process would normally receive from the process resource manager 25 to complete the process. The historical ticks may be updated as the process is repeatedly executed on the system 10. The historical ticks may be stored in the memory 27. As noted above, other metrics besides ticks may be used to allocate resources to a specific process.
To ensure optimum execution of the operation on the system 10, the completion of process A may be extended, as illustrated by the dashed lines, thereby freeing system 10 resources for execution of the processes B and C. In addition, process B execution may also be extended, thereby freeing additional resources to execute the process C. One method for extending the execution of the processes A and B is to limit the number of CPU ticks available to each of the processes A and B. The process resource manager 25 may be used to so limit the CPU ticks to the processes A, B, and C.
Also shown in
While the invention has been described with reference to the above embodiments it will be appreciated by those of ordinary skill in the art that various modifications can be made to the structure and function of the individual parts of the system without departing from the spirit and scope the invention as a whole.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5522070 *||May 23, 1995||May 28, 1996||Fujitsu Limited||Computer resource distributing method and system for distributing a multiplicity of processes to a plurality of computers connected in a network|
|US6334139 *||Dec 16, 1997||Dec 25, 2001||Mitsubishi Denki Kabushiki Kaisha||Agent system|
|US6385637 *||Aug 21, 1997||May 7, 2002||Rockwell Science Center, Inc.||Periodic process timer|
|US6466962 *||Jun 7, 1995||Oct 15, 2002||International Business Machines Corporation||System and method for supporting real-time computing within general purpose operating systems|
|US6697870 *||Jan 28, 2000||Feb 24, 2004||Networks Associates Technology, Inc.||Method and apparatus for real-time protocol analysis using an auto-throttling front end process|
|US6779182 *||Oct 17, 1998||Aug 17, 2004||Sun Microsystems, Inc.||Real time thread dispatcher for multiprocessor applications|
|US6785889 *||Jun 15, 2000||Aug 31, 2004||Aurema, Inc.||System and method for scheduling bandwidth resources using a Kalman estimator with active feedback|
|US6792445 *||May 4, 2000||Sep 14, 2004||Microsoft Corporation||Providing predictable scheduling of programs using a repeating precomputed schedule|
|US6927770 *||Jan 5, 2001||Aug 9, 2005||Apple Computer Inc.||Interface providing continuous feedback on task progress in a computer operating system|
|US7512946 *||Mar 21, 2002||Mar 31, 2009||International Business Machines Corporation||Scheduling method and system for controlling execution of processes|
|US20020147759 *||Sep 29, 1997||Oct 10, 2002||Kumar Ranganathan||Dynamic feedback costing to enable adaptive control of resource utilization|
|US20020194263 *||Apr 30, 2001||Dec 19, 2002||Murren Brian T.||Hierarchical constraint resolution for application properties, configuration, and behavior|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US8286177 *||Jan 29, 2009||Oct 9, 2012||Microsoft Corporation||Technique for conserving software application resources|
|US20100192156 *||Jan 29, 2009||Jul 29, 2010||Microsoft Corporation||Technique for conserving software application resources|
|US20140215198 *||Jan 31, 2013||Jul 31, 2014||Red Hat, Inc.||Method and system to provide a variable tick rate for the kernel|
|U.S. Classification||709/223, 702/176, 718/100, 718/102|
|International Classification||G06F9/48, G06F15/173, G06F11/34|
|Cooperative Classification||G06F2209/508, G06F11/3409, G06F9/4887|
|European Classification||G06F9/48C4S1, G06F11/34C|
|Jul 16, 2002||AS||Assignment|
Owner name: HEWLETT-PACKARD COMPANY, COLORADO
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:PRESLEY, JOE K.;REEL/FRAME:013091/0166
Effective date: 20020422
|Jun 18, 2003||AS||Assignment|
Owner name: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.,COLORADO
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:HEWLETT-PACKARD COMPANY;REEL/FRAME:013776/0928
Effective date: 20030131
|May 29, 2015||REMI||Maintenance fee reminder mailed|