Preemptive and non-preemptive scheduling and execution of progra

Details Preemptive and non-preemptive scheduling and execution of progra Preemptive and non-preemptive scheduling and execution of progra

1991-08-09

1993-09-21

Shaw, Gareth D.

Boots, shoes, and leggings

364DIG1, 3642813, 3642844, 3642817, 3642818, G06F 940

Patent

active

052476758

ABSTRACT:
A multitasking operating system permits application programs (and their developers) to influence a schedule of execution of program threads which constitute the application programs by specifying parameters for the program threads. The parameters indicate each thread's priority level and dispatch class in which the thread resides. The application programs specify the thread's parameters based on the following principles of the operating system. The operating system queues the highest priority thread available for execution from each dispatch class onto a run list for execution by a processor. The highest priority thread on the run list is executed first. While this thread is dispatchable and being executed, no other thread from the same dispatch class can preempt it unless this executing thread voluntarily relinquishes control of the processor, even if the other thread has a higher priority. (This other thread would have been created or made available after the currently executing thread was selected for the run list.) However, the currently executing thread can be involuntarily preempted at any time by another higher priority, available thread from a different dispatch class. A thread can also voluntarily relinquish control of its processor at other appropriate points in the execution, for example, when data structures are valid, to share the processor with other lower priority threads from the same or different dispatch classes.

REFERENCES:
patent: 3614745 (1971-10-01), Podvin et al.
patent: 3662401 (1972-05-01), Collins et al.
patent: 4103330 (1978-07-01), Thacker
patent: 4145735 (1979-03-01), Soga
patent: 4152761 (1979-05-01), Louie
patent: 4286322 (1981-08-01), Hoffman et al.
patent: 4318173 (1982-03-01), Freedman et al.
patent: 4333144 (1982-06-01), Whiteside et al.
patent: 4369494 (1983-01-01), Bienvenu et al.
patent: 4394725 (1983-07-01), Bienvenu et al.
patent: 4395757 (1983-07-01), Bienvenu et al.
patent: 4468736 (1984-08-01), DeSantis et al.
patent: 4493022 (1985-01-01), Nicolas et al.
patent: 4512628 (1985-03-01), Briggs
patent: 4590555 (1986-05-01), Bourrez
patent: 4642756 (1987-02-01), Sherrod
patent: 4658351 (1987-04-01), Teng
patent: 4661900 (1987-04-01), Chen et al.
patent: 4794526 (1988-12-01), May et al.
patent: 4800521 (1989-01-01), Carter et al.
patent: 4901230 (1990-02-01), Chen et al.
patent: 4954948 (1990-09-01), Hira et al.
patent: 4974159 (1990-11-01), Hargrove et al.
patent: 4985831 (1991-01-01), Dulong et al.
patent: 5001666 (1991-03-01), Thompson et al.
Graham et al., "Multi Tasking Operating System", IBM Tech. Disc. Bulletin, vol. 31, No. 10, Mar. 1989, pp. 419-436.
IBM TDB vol. 22, No. 11, Apr. 1980, R. L. Abraham, "Conditional Unready Improves Multitask Synchronization", pp. 4991-4992.
IBM TDB vol. 31, No. 10, Mar. 1989, C. S. Graham et al., "Multi-Tasking Operating System", pp. 419-436.
IBM TDB vol. 32, No. 10A, Mar. 1990, F. L. Janis, "Reference Monitor-Creating An Application-Dependent Access Control Identity", pp. 444-445.
IBM TDB vol. 30, No. 12, May 1988, C. A. Dennis, "Synchronization Control Block Posting Mechanism", pp. 471-473.
IEEE 1982, Electrical Eng. & Computer Sciences, U. of Cal., Berkeley, Calif., 94720, J. K. Ousterhout, "Scheduling Techniques for Concurrent Systems" pp. 22-30.

Affiliated with

Also associated with

Rating

Preemptive and non-preemptive scheduling and execution of progra does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Preemptive and non-preemptive scheduling and execution of progra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Preemptive and non-preemptive scheduling and execution of progra will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1057487