Predictive resource allocation in computing systems

• US 20030069916A1
• Filed: 10/09/2001
• Published: 04/10/2003
• Est. Priority Date: 10/09/2001
• Status: Active Grant

• Current Assignee: QuickSilver Controls, Inc.
• Original Assignee: QST Holdings LLC
• Inventors: Hirschsohn, Ian
• Granted Patent: US 7,594,229 B2
• Time in Patent Office: Days
• US Class Current: 718/104
• CPC Class Codes: G06F 2209/506 Constraint
• CPC Class Codes: G06F 9/5016 the resource being the memory
• 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 system including a method employed by a dedicated processor for allocating resources to other processors with a multi-processor computing environment. The dedicated processor is dedicated only to providing resource allocation to the other processors. Specifically, a script file is provided to the dedicated processor, the script containing information related to the resources required by the other processors. The script file is parsed by the dedicated processor to determine the resources required by the second processor. Thereafter, the dedicated processor dynamically allocates the resources and synchronizes resource allocation at the time needed by the other processors.

Claims

1. In a multi-processor computing environment, a method by a first processor for allocating resources for use by a second processor, the method comprising:

providing a script to the first processor, the script containing information related to the resources required by the second processor and when required;

parsing the script to determine the resources required by the second processor; and

dynamically allocating the resources at the time needed by the second processor.

2. The method of claim 1 wherein the script further comprises information related to resources required by a third processor;

and

dynamically allocating the resources at the time needed by the third processor.

4. The method of claim 1 wherein the resources are memory and matrix configuration.

5. The method of claim 1 wherein the information is the execution sequence of the program.

6. The method of claim 1 wherein the information in the amount of buffer memory needed by the program.

3. The method of claim 3 further comprising dedicating the first processor to processing the script.

7. A method by a processor for allocating resources for use by one or more tasks in a multi-processor computing environment, the method comprising:

providing a script to the processor, the script containing a map of sequences that will occur during execution of the one or more tasks;

parsing the script to determine resources required based on the map of sequences; and

allocating the resources immediately prior to execution of the task.

8. The method of claim 7 wherein the script is an I/O processor script.

9. A predictive resource allocation system for a multi-processor computing environment having two or more processors, comprising:

a first processor;

a dedicated processor dedicated to providing resource allocation to the first processor;

a script file containing information related to the resources required by the second processor;

a script engine for running the script file, the dedicated processor in conjunction with the script engine parsing the script to determine the resources required by the second processor; and

the dedicated processor dynamically allocating the resources at the time needed by the first processor.

10. The system of claim 9 wherein the script further comprises

information related to resources required by a third processor;

and

the dedicated processor dynamically allocating the resources at the time needed by the third processor.

11. A method by a processor for allocating resources for use by two or more tasks in a multi-processor computing environment, the method comprising:

providing a script to the processor, the script containing a map of sequences that will occur during execution of the tasks;

parsing the script to determine the map of sequences for the tasks and to determine the resources required by the tasks; and

allocating the resources to tasks such that resource allocation is synchronized with when the resources are needed by tasks.

12. The method of claim 11 wherein allocating the resources further comprises

dynamically allocating the resources at the time needed by the tasks.