Patent US5012409A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5012409A Expired / Lapsed US ⏱️ 0.0 years remaining

Operating system for a multi-tasking operating environment

Assignee: Honeywell Inc
•
Filing: 1988-03-10
•
Granted: 1991-04-30
•
Expires: 2008-03-10
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A task scheduler system including an array of priority queues for use in a real time multitasking operating system including equation lists, configuration lists, a function library, input and output drivers, user-created task definition lists of major and minor tasks and interrupt handlers. The system includes task scheduling apparatus which, upon the completion of each library function, interrogates the priority queues and finds the highest priority task segment whose requested resource is available and executed, and which executes task segments in the same priority queue in round-robin fashion. The system further includes task creation apparatus and apparatus for maintaining the status of all major tasks in a system in the states of unlocked and done, unlocked and active, unlocked and waiting, locked and active, or locked and waiting. The status maintaining apparatus also includes apparatus for locking tasks into a mode of operation such that the task scheduler will only allow the locked task to execute and the normal state of priority execution is overridden, and waiting apparatus for suspending operation on a task that requires completion of a library function.

Inventors

  • 👤 Mitchell S. Fletcher
  • 👤 Richard P. Semma

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-02 22:22
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/48; G06F9/4806; G06F9/4843; G06F9/4881; G06F9/4887

Claims Analysis

Total Claims: 7
Claim 1
Independent Claim 246 words
A task scheduler system, including an array of priority queues for use in a real time multitasking operating system including equation lists, configuration lists, a function library, input and output drivers, user-created task definition lists of major and minor tasks, including major and minor task elements, and interrupt handlers, initialized to have programmable timer interrupts, comprising: (a) means for task scheduling according to priority wherein upon the completion of each library function the priority queues are interrogated and the highest priority task segment is found whose requested resource is available and executed and wherein task segments in the same priority queue are executed in round-robin fashion, and wherein the task scheduling means further includes means for maintaining the status of all major tasks in the system in the states of unlocked and done, unlocked and active, unlocked and waiting, locked and active, or locked and waiting including means for locking tasks into a mode of operation so as to only allow the locked task to execute overriding the normal state of priority execution, and wherein the task scheduling means still further includes waiting means for suspending operation on a task that requires completion of a library function; and (b) means for task creation responsive to programmable timer interrupts including means for interrogating the task definition lists and means for creating all major and minor task elements from the task definition lists so as to create major and minor tasks which are added to the priority queues.
Claim 2
Dependent Claim 246 words
A task scheduler system, including an array of priority queues for use in a real time multitasking operating system including equation lists, configuration lists, a function library, input and output drivers, user-created task definition lists of major and minor tasks, including major and minor task elements, and interrupt handlers, initialized to have programmable timer interrupts, comprising: (a) means for task scheduling according to priority wherein upon the completion of each library function the priority queues are interrogated and the highest priority task segment is found whose requested resource is available and executed and wherein task segments in the same priority queue are executed in round-robin fashion, and wherein the task scheduling means further includes means for maintaining the status of all major tasks in the system in the states of unlocked and done, unlocked and active, unlocked and waiting, locked and active, or locked and waiting including means for locking tasks into a mode of operation so as to only allow the locked task to execute overriding the normal state of priority execution, and wherein the task scheduling means still further includes waiting means for suspending operation on a task that requires completion of a library function; and (b) means for task creation responsive to programmable timer interrupts including means for interrogating the task definition lists and means for creating all major and minor task elements from the task definition lists so as to create major and minor tasks which are added to the priority queues.
Claim 3
Dependent Claim 14 words
The system of claim 1 wherein the array of priority queues comprise eight queues.
Claim 4
Dependent Claim 17 words
The system of claim 1 wherein the number of task definition lists is a maximum of 128.
Claim 5
Independent Claim 229 words
A method of scheduling tasks included in an array of priority queues for use in a real time multitasking operating system, including equation lists, configuration lists, a function library, input and output drivers, user-created task definition lists of major and minor tasks, including major and minor task elements, and interrupt handlers, initialized to have programmable timer interrupts comprising the steps of: (a) task scheduling according to priority wherein upon the completion of each library function the priority queues are interrogated and the highest priority task segment is found whose requested resource is available and executed and wherein task segments in the same priority queue are executed in round-robin fashion and where the task scheduling further includes the steps of maintaining the status of all major task in a system of the states of unlocked and done, unlocked and active, unlocked and waiting, locked and active, or locked and waiting including locking tasks into a mode of operation so as to only execute the locked task and override the normal state of priority execution, and waiting for suspending operation on a task that requires completion of a library function; and (b) creating tasks in response to the programmable timer interrupts including the steps of interrogating the task definition lists and creating all major and minor task elements form the task definition lists so as to create major and minor tasks.
Claim 6
Independent Claim 229 words
A method of scheduling tasks included in an array of priority queues for use in a real time multitasking operating system, including equation lists, configuration lists, a function library, input and output drivers, user-created task definition lists of major and minor tasks, including major and minor task elements, and interrupt handlers, initialized to have programmable timer interrupts comprising the steps of: (a) task scheduling according to priority wherein upon the completion of each library function the priority queues are interrogated and the highest priority task segment is found whose requested resource is available and executed and wherein task segments in the same priority queue are executed in round-robin fashion and where the task scheduling further includes the steps of maintaining the status of all major task in a system of the states of unlocked and done, unlocked and active, unlocked and waiting, locked and active, or locked and waiting including locking tasks into a mode of operation so as to only execute the locked task and override the normal state of priority execution, and waiting for suspending operation on a task that requires completion of a library function; and (b) creating tasks in response to the programmable timer interrupts including the steps of interrogating the task definition lists and creating all major and minor task elements form the task definition lists so as to create major and minor tasks.
Claim 7
Dependent Claim 22 words
The method of claim 4 further including the step of reserving resources for response to the occurrence of a time critical event.

References Cited (Backward Citations)

US3618045A Cited
US3643227A Cited
US4084228A Cited
US4001783A Cited
US4047161A Cited
US4228495A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1994-04-29 1994-10-29 1995-04-30 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1998-04-29 1998-10-29 1999-04-30 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2002-04-29 2002-10-29 2003-04-30 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag