Method and system for process scheduling from within a current context and switching contexts only when the next scheduled context is different
This application is a continuation, of application Ser. No. 08/021,918, filed Feb. 24, 1993, now abandoned. 
    
    
     TECHNICAL FIELD 
     The present invention relates in general to data processing environments, and in particular, to such environments wherein context switching is employed to facilitate multi-thread processing of an application program. 
     BACKGROUND ART 
     Increasingly, programs are written to execute using arrays of standard processors in parallel. Software supervisor systems are then written to enable an application programmer to harness these processors and orchestrate the efficient cooperation of each processing unit in achieving overall programming goals. Such a software supervisor is referred to in the art as a parallel &#34;microkernel&#34;. Taken as a collective, these microkernels create an application program environment similar to that created by any monolithic kernel or operating system. 
     Parallel microkernels are similar to monolithic kernels in that they manage the resources of the machine environment around them. There is, however, a significant difference between parallel and monolithic kernels. In particular, monolithic kernels seek to fairly divide a machine environment among competitive task contexts over time. A parallel microkernel, on the other hand, is generally written to efficiently direct the capabilities of each machine environment in achieving a single goal, i.e., the efficient completion of the individual kernel&#39;s portion of the parallel application. Within a parallel microkernel, the component tasks are never really competitive since they are working within one application program toward a single goal. 
     Central to any kernel&#39;s duties is the scheduling and descheduling of control contexts. Control contexts are given different names such as &#34;threads,&#34; &#34;processes,&#34; or &#34;tasks&#34; depending upon the properties of the context and the naming conventions of the kernel. A context is left in control of a machine environment until it either yields, is blocked waiting for something, or is interrupted. These are called descheduling events since it is at that time that scheduling algorithms are evaluated for priority of context execution. In nonpreemptive scheduling, user contexts are never switched as a result of an interrupt. All processor interrupts eventually return to the context processing at the time of the interruption. 
     In a nonpreemptive parallel microkernel, an application programmer controls context scheduling. This is done either indirectly, by programming in a single threaded model, or directly, by yielding between multiple context. In the former case, there is only a single application context per machine environment and thus from the programmer&#39;s perspective, it should always be scheduled when ready to run. In the later case, the programmer will specifically yield or make a blocking kernel call to control the scheduling of participating user contexts. In both cases, a call to a microkernel service may block the running context and cause an evaluation of the scheduling algorithm(s). In either case, a context switch is often redundant. This is because the microkernel, after evaluating the scheduling algorithm(s) often determines that the priority context is exactly the context that has yielded or blocked. 
     Therein lies the problem. In standard kernel context scheduling, a complete context switch is performed whenever there is occasion to reevaluate the scheduling algorithm. The assumption is that there is a high likelihood that the next context given priority will be other than the context which has yielded or blocked. In a parallel microkernel environment this is a bad assumption. In fact, there is a high probability that there will be a redundant context switch as a context finds itself continuously rescheduled to execute. Thus, a need exists in the data processing art for a scheduling method which does not incur the heavy overhead of a context switch when evaluation of the scheduling algorithm will probably show it to be redundant. 
     DISCLOSURE OF THE INVENTION 
     Briefly summarized, the present invention comprises in one aspect a method for managing process scheduling among at least two control contexts at a processing node of a data processing environment. 
     The method includes the steps of: executing in the data processing system within a given control context comprising one of the at least two control contexts; upon processing a scheduling event, evaluating process scheduling priority while executing from within the given control context; and restarting execution within a restart control context comprising one of the at least two control contexts, the restart control context being determined by the process scheduling evaluating step. In an enhanced embodiment, the data processing system comprises a non-preemptive, parallel data processing system. 
     In another aspect, a system for managing process scheduling among a plurality of control contexts at a processing node is provided. A given control context, which comprises one of a plurality of control contexts, is assumed to be executing at the processing node. The managing system includes processing means for identifying a context scheduling event. Upon identifying a context scheduling event, a context scheduler is evaluated from within the given control context to identify a restart control context for the processing node. The restart control context comprises one of the plurality of control contexts and has scheduling priority over any other control context of the plurality of control contexts ready to run. Execution restarting means is also provided for restarting execution of data at the processing node within the restart control context identified by the schedule evaluating means. 
     To summarize, a novel technique for managing process scheduling among multiple control contexts within a data processing environment is presented. This technique involves dividing the process scheduling function into separate portions. First, an evaluation function from within the processing control context is employed to determine whether a context switch is warranted. Secondly, if a context switch is warranted, then a context switcher is called to save the state of the descheduling control context, and restore the state of the priority control context. This second function may be executed either in the descheduling context or as a privileged context. The management technique is most useful in a situation where a single computer node is consumed by a single program which provides nonpreemptive process scheduling. The scheduling mechanism is useful in any situation where it is likely that redundant context switches will be invoked, thereby resulting in performance overhead. The concepts can be readily extended to preemptive process scheduling as well. 
    
    
     BRIEF DESCRIPTION OF DRAWINGS 
     These and other objects, advantages and features of the present invention will be more readily understood from the following detailed description of certain preferred embodiments of the present invention, when considered in conjunction with the accompanying drawings in which: 
     FIG. 1 generally represents one embodiment of a parallel data processing environment to incorporate the present invention; 
     FIG. 2 is a representation of several processing nodes, interconnected through a communications interface, in a parallel data processing environment to incorporate the present invention; 
     FIG. 3 depicts one embodiment of address space assignment for the parallel processing nodes of FIG. 2; and 
     FIGS. 4a &amp; 4b are flowcharts of one embodiment of a method for managing context scheduling pursuant to the present invention. 
    
    
     BEST MODE FOR CARRYING OUT THE INVENTION 
     FIG. 1 is a simplified embodiment of a parallel data processing environment, generally denoted 10, having an array of processing nodes 12. Each processing node 12 may be implemented in hardware, a combination of hardware and software, or principally software (e.g., a virtual processing node). Taken together, processing nodes 12 provide a machine environment within which data processing functions are executed. In one standard embodiment, each processing node 12 includes a CPU, a communications interface, memory and a clocking mechanism. 
     Within an array of processing nodes, the nodes typically communicate via high priority messages and low priority messages. By way of example, four processing nodes 12 (or processing stacks) are shown in FIG. 2 to be coupled to a communications interface 16 for bi-directional transfer of data therebetween. 
     In this embodiment, each processing node 12 includes a software component 18 and a hardware component 17, which together form a processing stack. Software 18 includes an application program 22 and a control system or kernel 24. Each control system or kernel 24 inherently understands that it is part of a larger system, i.e., a parallel data processing environment. The kernels control the flow of information between processing nodes 12. 
     As shown in FIG. 3, every processing node 12 in the parallel data processing environment has a single address space &#34;ADDR. 0&#34;, &#34;ADDR. 1&#34;, &#34;ADDR. 2&#34; and &#34;ADDR. 3&#34; associated therewith; i.e., the complete address space is multi-threaded. Each kernel/application interface 19 makes available to its processing node the same global functions as those available at all other processing nodes. The execution within a given address space can either affect that address space or produce an equivalent effect in an address space of an object named within the data, i.e., through the communications interface 16 (FIG. 2). The context scheduling management method/system discussed below seeks to enhance processing performance within a single address space of the parallel data processing environment. (The invention also extends to enhancing performance of a single processor assigned to process multiple threads of an application program.) 
     Operating systems divide the machine environment managed by an operating system among different control contexts (i.e., different processes and/or threads) over time. When a scheduling event is reached, the conventional approach has been to perform the following three steps in the order presented: (1) deschedule the currently running context by saving the parameters of the current context; (2) using scheduling code within the operating system to determine the next context to be run (which generally requires the loading of an operating system context); and (3) scheduling the new context (i.e., by loading the parameters of the new context at the processing node). 
     In contrast to this approach and in accordance with the present invention, the scheduling code is first evaluated from within the current context, and the current context is only descheduled if a determination is made (by running the scheduling code) that a context switch is to occur. In essence, the present invention is to divide the scheduling function into an evaluation stage, which again is accomplished from within the current control context, and a conditional context switching stage. In one embodiment, the scheduling code can be executable from within a currently running context by providing the code (i.e., the program routines which must run to determine which context has priority) in a subroutine library readable by any control context and executable from within the currently running process at any rescheduling point, for example, via a subroutine call or via an interrupt. (While a few parameters are necessarily saved upon a subroutine call or interrupt, a much more significant number of parameters must be saved whenever a process or thread context is switched.) 
     A context switch is performed by a conventional &#34;context switcher&#34; function, which typically entails saving the entire state of a descheduled context, updating kernel scheduling structures, and then restoring an entire state of an incoming control context. A context switcher may have no control context of its own, e.g., by using the descheduling context to execute, or it may be executed from a privileged context entered by a supervisor call. 
     One embodiment of a method/system for managing context scheduling pursuant to the present invention is presented in FIGS. 4a &amp; 4b and described below in connection with a nonpreemptive scheduling environment. However, the invention is readily generalized to encompass preemptive scheduling as long as data structures used in the scheduling code may be accessed (i.e., read) from within the contexts being scheduled. 
     At a processing node, processing is begun by executing one of a number of control contexts, 40 &#34;Execute Within Given Context.&#34; A scheduling event is processed, 42 &#34;Process A Scheduling Event,&#34; after which an initial inquiry is made into whether the executing context is voluntarily yielding, 44 &#34;Executing Context To Voluntarily Yield?&#34; If not, then the running control context is blocked waiting on an event and processing passes via junction &#34;A&#34; 46 to the control sequence of FIG. 4b. 
     Continuing with FIG. 4a, and assuming that the executing control context is voluntarily yielding, inquiry is next made into whether an associated ready to run queue is empty, 48 &#34;Is Ready To Run Queue Empty?&#34; Whenever the executing control context is voluntarily yielding, it is actually capable of continuing execution as soon as its priority over other ready to run control contexts is confirmed. Thus, if the ready to run queue is empty, then processing passes through junction 56 to instruction 58, &#34;Return To Yielded Context, &#34; thereby making an immediate return to the yielding context. 
     If the ready to run queue contains one or more control contexts, then the scheduling algorithm(s) is(are) employed to determine priority between the control context at the head of the associated ready to run queue and the yielding control context, 50 &#34;Employ Scheduling Algorithms.&#34; Again, the scheduling algorithm(s) is(are) employed from within the yielding control context, for example, through a subroutine call. If the yielding control context still has priority, 52 &#34;Yielded Context Have Priority?&#34;, then return is made to the yielding control context at instruction 58 &#34;Return To Yielded Context,&#34; via junction 56. Conversely, if a new control context has priority then the context switcher is invoked to move the processing node to this priority control context, 54 &#34;Invoke Context Switcher.&#34; 
     Referring to FIG. 4b, when the executing control context is blocked waiting on an event, inquiry is made into whether the associated ready to run queue is empty, 60 &#34;Is Ready To Run Queue Empty?&#34; If &#34;no&#34;, then the context switcher is invoked since it is desirable to execute an alternate context presently ready to run, 62 &#34;Invoke Context Switcher.&#34; If the associated ready to run queue is empty, however, then the processing node idles, 66 &#34;Idle Scheduling Algorithms,&#34; after which inquiry is again made into whether the associated ready to run queue is empty, 68 &#34;Is Ready To Run Queue Empty?&#34; If &#34;yes&#34;, then the processor returns via junction 64 to an idle state to again wait a predefined period of time, 66 &#34;Idle Scheduling Algorithms.&#34; Eventually, a control context will become ready to run and will be placed at the head of the ready to run queue. When this happens, it may be that the control context in the ready to run queue is the same control context as the one which blocked, 70 &#34;Is Priority Context Same As Blocked Context?&#34; If it is, then immediate return is made to that control context, 74 &#34;Return To Context That Last Blocked.&#34; Otherwise, the context switcher is invoked to move the processing node to the control context which is ready to run, 72 &#34;Invoke Context Switcher.&#34; 
     To again summarize, a novel technique for managing process scheduling among multiple control contexts within a data processing environment is presented. This technique involves dividing the process scheduling function into separate portions. First, an evaluation function from within the processing control context is employed to determine whether a context switch is warranted. Secondly, if a context switch is warranted, then a context switcher is called to save the state of the descheduling control context, and restore the state of the priority control context. This second function may be executed either in the descheduling context or as a privileged context. The management technique is most useful in a situation where a single computer node is consumed by a single program which provides nonpreemptive process scheduling. The scheduling mechanism is useful in any situation where it is likely that redundant context switches will be invoked, thereby resulting in performance overhead. The concepts can be readily extended to preemptive process scheduling. 
     Although specific embodiments of the present invention have been illustrated in the accompanying drawings and described in the foregoing detailed description, it will be understood that the invention is not limited to the particular embodiments described herein, but is capable of numerous rearrangements, modifications and substitutions without departing from the scope of the invention. The following claims are intended to encompass all such modifications.