Patent FR990671A successfully refreshed from Google Patents.
Patent US5978583A successfully refreshed from Google Patents.
US5978583A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for resource control in parallel environments using program organization and run-time support
Assignee: International Business Machines Corp
•
Filing: 1995-08-07
•
Granted: 1999-11-02
•
Expires: 2015-08-07
Abstract
Abstract A system and method for dynamic scheduling and allocation of resources to parallel applications during the course of their execution. By establishing well-defined interactions between an executing job and the parallel system, the system and method support dynamic reconfiguration of processor partitions, dynamic distribution and redistribution of data, communication among cooperating applications, and various other monitoring actions. The interactions occur only at specific points in the execution of the program where the aforementioned operations can be performed efficiently.
Inventors
- 👤 Kattamuri Ekanadham
- 👤 Jose Eduardo Moreira
- 👤 Vijay Krishnarao Naik
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 16:16
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/50; G06F9/5061; G06F9/5077
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
67 words
A method for controlling allocation of resources to an explicitly parallel application in a scalable parallel environment, comprising the steps of: organizing an explicitly parallel program into program segments; annotating each program segment with code specifying allowable resource levels for executing the program segment; configuring each program segment at run time to execute with one of the allowable resource levels for that segment made available at run-time.
Claim 2
Independent Claim
67 words
A method for controlling allocation of resources to an explicitly parallel application in a scalable parallel environment, comprising the steps of: organizing an explicitly parallel program into program segments; annotating each program segment with code specifying allowable resource levels for executing the program segment; configuring each program segment at run time to execute with one of the allowable resource levels for that segment made available at run-time.
Claim 3
Dependent Claim
17 words
The method of claim 1, wherein the step of annotating comprises generating annotations automatically with a compiler.
Claim 4
Dependent Claim
26 words
The method of claim 1, further comprising monitoring the execution of the program and revising the level of resources assigned to a program segment if necessary.
Claim 5
Dependent Claim
22 words
The method of claim 1, wherein each program segment is reconfigurable to operate with a plurality of multiple processor and memory configurations.
Claim 6
Dependent Claim
12 words
The method of claim 1, wherein each segment has a predefined structure.
Claim 7
Dependent Claim
43 words
The method of claim 5, wherein the predefined structure comprises: a main body of functional code that accomplishes application specific computations associated with that segment; and an auxiliary module program including information describing the resource levels under which the segment can be executed.
Claim 8
Dependent Claim
17 words
The method of claim 6, wherein one auxiliary module program is associated with a plurality of segments.
Claim 9
Dependent Claim
13 words
The method of claim 1, wherein each segment has a different control structure.
Claim 10
Dependent Claim
18 words
The method of claim 1, wherein the program is divided into segments prior to compilation of the program.
Claim 11
Dependent Claim
34 words
The method of claim 1, wherein the resources allocated to a program segment depend upon the parameters input to the segment and the results of computations of parameters at other segments in the program.
Claim 12
Dependent Claim
24 words
The method of claim 1, wherein resource dependent variables of the code in each segment are initialized at run-time, after the resources are specified.
Claim 13
Dependent Claim
26 words
The method of claim 1, wherein resource dependent data structures in each segment are organized in a memory hierarchy at run-time, after the resources are specified.
Claim 14
Dependent Claim
46 words
The method of claim 1, wherein each segment comprises a reconfigurable and schedulable module (RSM), the RSM comprising a control variable initialization section and program constructs organized such that all resource dependent control structures in the program constructs can be expressed in terms of initialized variables.
Claim 15
Dependent Claim
19 words
The method of claim 13, wherein the program comprises program code embedded in the functional code of the segment.
Claim 16
Dependent Claim
29 words
The method of claim 1, wherein the resource levels include number of processors, amount of memory, i/o related resources, visualization devices, file systems and other hardware and software resources.
Claim 17
Dependent Claim
24 words
The method of claim 1, wherein the step of configuring each program segment is accomplished independently of configuration decisions for the other program segments.
Claim 18
Dependent Claim
27 words
The method of claim 1, wherein the step of configuring each program segment comprises executing code instrumented for that program segment and for a range of resources.
Claim 19
Independent Claim
66 words
A system for controlling allocation of resources to a parallel application in a scalable parallel environment, comprising: means for organizing an explicitly parallel program into program segments; means for annotating each program segment with code specifying allowable resource levels for executing the program segment; means for configuring each program segment at run time to execute with a resource level specified in the annotation for that segment.
Claim 20
Independent Claim
66 words
A system for controlling allocation of resources to a parallel application in a scalable parallel environment, comprising: means for organizing an explicitly parallel program into program segments; means for annotating each program segment with code specifying allowable resource levels for executing the program segment; means for configuring each program segment at run time to execute with a resource level specified in the annotation for that segment.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-11-01 | 2003-05-03 | 2003-11-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-11-01 | 2007-05-03 | 2007-11-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-11-01 | 2011-05-03 | 2011-11-02 | $7700.00 | Window Closed / Lapsed |