US4410940A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Transfer of control method and means among hierarchical cooperating sequential processes
Assignee: International Business Machines Corp
•
Filing: 1980-12-05
•
Granted: 1983-10-18
•
Expires: 2000-12-05
Abstract
Abstract A method for transferring control between hierarchically related cooperating sequential processes P and Q executable in a multi-processing CPU environment. The method uses pointers to identify active and suspended processes. The method steps comprise generating and memory storing activation records; transferring control from process P to process Q, and updating the process pointers to record the suspension of process P and the activation of process Q; and resuming execution in the most recently executing subprocesses of Q by reference to the process pointers. There is stored in memory one activation record per process. The record includes a pointer to the activation that is the parent of the process, a pointer to the most recently executing subprocess of the process, and information defining the current execution state of the process. These pointers are further constrained such that the set of activation records form the nodes of a tree whose arcs are defined by the parent pointers. The descendants of any node P, together with P itself, constitute the subprocesses of P. For any node P the process pointer of P always points to a subprocess of P. The transfer of control from process P to process Q involves the concurrent updating of the process pointers to record the suspension of process P and the activation of process Q.
Inventors
- 👤 Eric D. Carlson
- 👤 Henry M. Gladney
- 👤 Peter Lucas
- 👤 Daniel L. Weller
- 👤 Stephen N. Zilles
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 23:30
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/48; G06F9/4806; G06F9/4843; G06F9/4881
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
214 words
A digital computer implemented method for maintaining synchronous computations among a set of recursively nested cooperating sequential processes, comprising the steps of: (a) generating and storing in memory an activation record (AR) for each process, each AR including a pointer (PARENT) to the AR of the immediate antecedent process, the set of PARENT pointers defining a tree graph ordering or nesting structure, each subtree of which is itself such a structure with a root process and descendent processes, each AR further including a pointer (PROCESS) to the AR of the most recently activated process within the least inclusive subtree ordering of which it is a member, and information defining the current execution state of the process; and (b) responsive to execution of an instruction, transferring control to a process within the set of processes: (i) ascertaining the nearest antecedent of both the transferring and the transferred to processes using the PARENT pointers; (ii) updating the PROCESS pointers of all the processes between the closest antecedent process and the transferred to process so that they designate the antecedents in sequence to the transferred to process; (iii) following the PROCESS pointers from the transferred to process to the most recently executing process in the subtree it roots, and resuming the execution of the transferred to process.
Claim 2
Dependent Claim
214 words
A digital computer implemented method for maintaining synchronous computations among a set of recursively nested cooperating sequential processes, comprising the steps of: (a) generating and storing in memory an activation record (AR) for each process, each AR including a pointer (PARENT) to the AR of the immediate antecedent process, the set of PARENT pointers defining a tree graph ordering or nesting structure, each subtree of which is itself such a structure with a root process and descendent processes, each AR further including a pointer (PROCESS) to the AR of the most recently activated process within the least inclusive subtree ordering of which it is a member, and information defining the current execution state of the process; and (b) responsive to execution of an instruction, transferring control to a process within the set of processes: (i) ascertaining the nearest antecedent of both the transferring and the transferred to processes using the PARENT pointers; (ii) updating the PROCESS pointers of all the processes between the closest antecedent process and the transferred to process so that they designate the antecedents in sequence to the transferred to process; (iii) following the PROCESS pointers from the transferred to process to the most recently executing process in the subtree it roots, and resuming the execution of the transferred to process.
Claim 3
Dependent Claim
166 words
A digital computer implemented method for maintaining synchronous computations among a set of recursively nested cooperating sequential processes, comprising the steps of: (a) generating and storing in memory an activation record (AR) for each process, each AR including a pointer (PARENT) to the AR of the immediate antecedent process, the set of PARENT pointers defining a tree graph ordering or nesting structure, each subtree of which is itself such a structure with a root process and descendent processes, each AR further including a pointer (PROCESS) to the AR of the most recently activated process within the least inclusive subtree ordering of which it is a member, and information defining the current execution state of the process; and (b) responsive to execution of an instruction, transferring control to an antecedent of the transferring process: (i) updating the process pointers of the antecedent process to designate itself as the most recently executing process in the subtree it roots; and (ii) resuming the execution of the transferred to process.
Claim 4
Dependent Claim
166 words
A digital computer implemented method for maintaining synchronous computations among a set of recursively nested cooperating sequential processes, comprising the steps of: (a) generating and storing in memory an activation record (AR) for each process, each AR including a pointer (PARENT) to the AR of the immediate antecedent process, the set of PARENT pointers defining a tree graph ordering or nesting structure, each subtree of which is itself such a structure with a root process and descendent processes, each AR further including a pointer (PROCESS) to the AR of the most recently activated process within the least inclusive subtree ordering of which it is a member, and information defining the current execution state of the process; and (b) responsive to execution of an instruction, transferring control to an antecedent of the transferring process: (i) updating the process pointers of the antecedent process to designate itself as the most recently executing process in the subtree it roots; and (ii) resuming the execution of the transferred to process.
Claim 5
Dependent Claim
220 words
A digital computer implemented method for maintaining synchronous computations among a set of recursively nested cooperating sequential processes, comprising the steps of: (a) generating and storing in memory an activation record (AR) for each process, each AR including a pointer (PARENT) to the AR of the immediate antecedent process, the set of PARENT pointers defining a tree graph ordering or nesting structure, each subtree of which is itself such a structure with a root process and descendent processes, each AR further including a pointer (PROCESS) to the AR of the most recently activated process within the least inclusive subtree ordering of which it is a member, and information defining the current execution state of the process; and (b) responsive to execution of an instruction, transferring control to a process that is the immediate descendent of an antecedent of the transferring process: (i) ascertaining the antecedent of both the transferring and the transferred to process by comparing the PARENT pointers of the transferring process's antecedents to the PARENT pointer of the transferred to process; (ii) updating the PROCESS pointers of the common antecedent to point to the transferred to process; and (iii) following the PROCESS pointers from the transferred to process to the most recently executing process in the subtree it roots, and resuming the execution of the transferred to process.
Claim 6
Dependent Claim
220 words
A digital computer implemented method for maintaining synchronous computations among a set of recursively nested cooperating sequential processes, comprising the steps of: (a) generating and storing in memory an activation record (AR) for each process, each AR including a pointer (PARENT) to the AR of the immediate antecedent process, the set of PARENT pointers defining a tree graph ordering or nesting structure, each subtree of which is itself such a structure with a root process and descendent processes, each AR further including a pointer (PROCESS) to the AR of the most recently activated process within the least inclusive subtree ordering of which it is a member, and information defining the current execution state of the process; and (b) responsive to execution of an instruction, transferring control to a process that is the immediate descendent of an antecedent of the transferring process: (i) ascertaining the antecedent of both the transferring and the transferred to process by comparing the PARENT pointers of the transferring process's antecedents to the PARENT pointer of the transferred to process; (ii) updating the PROCESS pointers of the common antecedent to point to the transferred to process; and (iii) following the PROCESS pointers from the transferred to process to the most recently executing process in the subtree it roots, and resuming the execution of the transferred to process.
References Cited (Backward Citations)
US3614740A
Cited
GB1240978A
Cited
US4330822A
Cited
US4084224A
Cited
US4297743A
Cited
US4149240A
Cited
US4016545A
Cited
US4152761A
Cited
US4173782A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1986-10-17 | 1987-04-18 | 1987-10-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1990-10-17 | 1991-04-18 | 1991-10-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1994-10-17 | 1995-04-18 | 1995-10-18 | $7700.00 | Window Closed / Lapsed |