Method for enforcing a hierarchical invocation structure in real time asynchronous software applications

• US 6,035,321 A
• Filed: 06/29/1994
• Issued: 03/07/2000
• Est. Priority Date: 06/29/1994
• Status: Expired due to Term

• Current Assignee: ACI Incorporated
• Original Assignee: ACI Incorporated
• Inventors: Mays, Richard Chapman
• Primary Examiner(s): TOPLU, LUCIEN
• Application Number:
  US08/268,201
• Time in Patent Office: 2,078 Days
• Field of Search: 395/673, 395/676, 395/677, 395/678
• US Class Current: 718/103
• CPC Class Codes: G06F 9/4484 Executing subprograms
• CPC Class Codes: G06F 9/4486 Formation of subprogram jump address
• CPC Class Codes: G06F 9/4812 by interrupt, e.g. masked

Abstract

A kernel for enforcing a hierarchical invocation structure prevents upcalls by executing kernel operations during each invocation of code unit of application by another code unit. Kernel operations determine the priority of the invoking unit of code based on the hierarchy of the invocation structure. Only invocations by either lower priority units, or the unit itself are allowed. Once invoked, the kernel operates to establish a priority for the invoked task. The kernel provides various event mechanisms to provide for priority based preemption concurrently with the enforced invocation structure, thus allowing the handling of asynchronous events in a multitasking environment. The event mechanisms allow a unit of code to signal the occurrence of a condition, which may be captured by other code units. The kernel determines the proper code unit for responding to the condition, and employs scope rules to further define the handling operation. Scheduling and tasking mechanisms schedule the handling of the condition and dispatch the handling of the event on a prioritized basis.

Claims

1. A method, implemented in a kernel, for enforcing a hierarchical invocation structure between a plurality of contexts, each context having an execution priority determined by the invocation structure of the contexts, wherein there are provided lower execution priority contexts and higher execution priority contexts, the method comprising the steps of:

indicating invocation of an invoked context by an invoking context,

determining the execution priority of the invoking context;

the kernel permitting the invocation if the execution priority of the invoked context is higher than the execution priority of the invoking context; and

the kernel prohibiting the invocation if the execution priority of the invoked context is less than the execution priority of the invoking context.

2. The method of claim 1 wherein higher priority contexts signal events to lower priority contexts, the method comprising the steps of:

defining an event;

specifying capture of a defined event by at least one context;

specifying a means for the signaling of an event;

determining priority for the capture of an event based on the priority of the invocation structure; and

incrementing a counter in the address space of the capturing context.

3. The method of claim 2, wherein the execution of contexts is preempted based on the occurrence of events, the method comprising the steps of:

defining an event routine;

binding the event routine to the capture of an event by the context;

scheduling the event routine upon the capture of the event by the context; and

executing the event routine based on the priority level of the capturing context.

4. The method of claim 3, wherein implicit concurrency between contexts is generated, the method comprising the steps of:

determining an event routine scheduled for execution;

determining whether an active thread exists within the context for which the event routine is defined; and

deferring the execution if the context is active.

5. The method of claim 4 further comprising the steps of:

responsive to determining no active thread existing within the context;

creating a thread for the execution of the event routine;

prioritizing the execution level of the thread equal to that of the capturing context; and

providing for the disposal of the thread upon completion of the event routine.

6. The method of claim 5, wherein the concurrent execution of code within a context is prohibited, the method comprising the steps of:

determining an invoking context and a context to be invoked;

determining whether an active thread exists within the context to be invoked;

allowing the invocation, responsive to no active thread existing in the to-be-invoked context; and

responsive to an active thread existing in the to-be-invoked context;

enqueuing the invocation in queue in the presence of an active thread;

determining when a thread completes execution of a context;

determining whether there are any pending invocation requests for the context;

removing a pending invocation request from the head of the queue; and

resuming the invocation request and marking the invoked context active.

7. The method of claim 6, wherein the method includes a kernel which records the precedence for event capture based on programmatic "seize" or "capture" requests, the method comprising the steps of:

creating a capture record for each capture request by a context;

determining whether the capture is with a "seize" request;

responsive to determining the existence of a "seize" request, traversing a list of "seizer" contexts and enqueing the capture request in front of any request by lower priority contexts;

responsive to determining the existence of a "capture" request, traversing a list of "captor" contexts and enqueing the capture request in front of any request by higher priority contexts.

8. The method of claim 7, wherein the kernel implements the precedence of event capture on the occurrence of the event, the method comprising the steps of:

locating a list of "capture" and "seizure" records for this event;

traversing the "seizer" list to find a first context capturing this event with a priority lower than a context raising the event;

responsive to not finding a context capturing the event with a priority lower than the context raising the event, traversing the "captor" list to find a first context capturing this event with a priority lower than the context raising the event; and

responsive to finding a capturing context, removing the captor record from the list and incrementing a counter in the address space of the capturing context.

9. The method of claim 4, wherein concurrency is provided by a non stack based instruction set.

10. The method of claim 4, wherein concurrency is provided in a multiprocessor environment.

11. The method of claim 4, wherein concurrency is provided by a multistack environment.

12. The method of claim 2, wherein event captures are programmatically prioritized, the method comprising the steps of:

specifying the capture of an event by a context with programmer syntax that allows;

event precedence to be based on the priority level of the context capturing the event; and

event precedence to be secondary to any lower priority context capturing the event.

13. The method of claim 2, wherein the signalling of events is embedded within the instructions set of a computer.

14. The method of claim 3, wherein preemption based on events is embedded within the instructions set of a computer.

15. The method of claim 1, wherein the step of permitting the invocation comprises the further substep of:

permitting invocation from a context to itself recursively.

16. The method of claim 15, wherein the step of permitting invocation from a context to itself recursively, comprises the further substep of:

permitting a recursive context call only on a routine that is explicitly declared to be recursive.

17. The method of claim 1, wherein the enforcement of hierarchy is embedded within the instructions set of a computer.

18. The method of claim 1, wherein the method is provided in a code library that is linked into an address space containing the contexts for at least one application, and wherein there is provided a code preprocessor for translating programming language extensions included in the contexts into procedural calls for invoking the method.