US5377352A — Method of scheduling tasks with priority to inter…

Claim 1

Independent Claim 228 words

A computer implemented task scheduling method for use in a computer system including a plurality of shared resources to be used exclusively by a plurality of tasks each of which has a predetermined execution priority, said task scheduling method comprising the steps of: registering a task identifier representing the task which is being executed, upon locking by said task onto one of said shared resources, into a locking task table; deleting the registered task identifier in said locking task table when said task being executed unlocks said one of said shared resources; suspending, upon occurrence of an interrupt, execution of said task being executed to allow an interruption processing task to be executed; after execution of said interruption processing, deciding whether said task identifier, representing said task which was being executed while locking said one of said shared resources, is registered in said locking task table, when a task to be executed next is to be selected; and selecting, when said deciding step decides that said task identifier is registered in said locking task table, said task designated as registered by said task identifier as said task to be executed with priority and selecting, when said deciding step decides that said task identifier is not registered in said locking task table, one of said tasks based on their predetermined priorities as the task to be executed with priority.

Claim 2

Dependent Claim 228 words

A computer implemented task scheduling method for use in a computer system including a plurality of shared resources to be used exclusively by a plurality of tasks each of which has a predetermined execution priority, said task scheduling method comprising the steps of: registering a task identifier representing the task which is being executed, upon locking by said task onto one of said shared resources, into a locking task table; deleting the registered task identifier in said locking task table when said task being executed unlocks said one of said shared resources; suspending, upon occurrence of an interrupt, execution of said task being executed to allow an interruption processing task to be executed; after execution of said interruption processing, deciding whether said task identifier, representing said task which was being executed while locking said one of said shared resources, is registered in said locking task table, when a task to be executed next is to be selected; and selecting, when said deciding step decides that said task identifier is registered in said locking task table, said task designated as registered by said task identifier as said task to be executed with priority and selecting, when said deciding step decides that said task identifier is not registered in said locking task table, one of said tasks based on their predetermined priorities as the task to be executed with priority.

Claim 3

Dependent Claim 51 words

A task scheduling method according to claim 1, further including a step of selecting one of said plurality of tasks waiting for execution in an executable task list based upon priorities assigned to said tasks, respectively, in case no valid task identifier is detected as registered in said locking task table.

Claim 4

Dependent Claim 61 words

A task scheduling method according to claim 1, wherein said registering step further includes the steps of: informing an operating system of said task identifier when said task being executed has locked onto a shared resource; and registering by said operating system said task identifier of said task being executed to said locking task table in response to said informing step.

Claim 5

Dependent Claim 126 words

A task scheduling method according to claim 1 wherein said computer system includes a plurality of processors; wherein in the step of registering said task representing of said task being executed, the registered task identifier further identifies a processor executing said task; said deciding step further includes the step of judging whether said task identifier is registered in said locking task table, when a task to be executed next by the identified processor is selected upon completion of the execution of said interrupt processing task by said identified processor; and said selecting step further includes the step of selecting said task represented by said task identifier as the task to be executed next by said identified processor if said task identifier indicates said task is registered.

Claim 6

Dependent Claim 134 words

A task scheduling method according to claim 1, wherein said registering step further includes the steps of: determining upon said task being executed locking onto one of a plurality of shared resources as required by said task, whether said task has locked onto another of said shared resources; and registering said task identifier of said task when said task has not locked onto another of said shared resources; said deciding step further including the steps of: determining upon the unlocking of one of said shared resources required by said task being executed, whether said task locks onto another of said shared resources, detecting said registered task identifier of said task if said task does not lock onto another of said shared resources, and informing an operating system of said invalidating of said task identifier.

Claim 7

Dependent Claim 91 words

A task scheduling method according to claim 1, further comprising the steps of: informing said operating system of the unlocking by a first task of said shared resource and of the locking by a second task thereby locking onto said shared resource; replacing in response to said informing step, by said operating system a task identifier of said first task with the task identifier of said second task; and scheduling so that said first task is placed in an execution-ready state with said second task being placed in a running state.

Claim 8

Dependent Claim 238 words

A computer implemented task scheduling method for use in a computer system including a plurality of shared resources accessible by a plurality of tasks, wherein priority is granted to one of said plurality of tasks which has successfully locked onto a shared resource, said task scheduling method comprising the steps of: determining whether one of said tasks has successfully locked onto said shared resource; informing an operating system of said one of said task, locking onto said shared resource; registering by a processor a task identifier indicating that said one of said task, has locked onto said shared resource into a locking task table; deleting, by said processor, said task identifier in said locking task table upon the unlocking of said shared resource by said one of said tasks; deciding, when a task to be executed next is to be selected, whether a task identifier is registered in said locking task table; selecting, when the deciding step has decided that a task identifier is registered in said locking task table, a task corresponding to said task identifier which was decided as being registered in said locking task table as the next task to be executed; and selecting, when the deciding step has decided that a task identifier is not registered in said locking task table, one of a plurality of tasks waiting in an execution wait state with the highest priority as the next task to be executed.

Claim 9

Dependent Claim 238 words

A computer implemented task scheduling method for use in a computer system including a plurality of shared resources accessible by a plurality of tasks, wherein priority is granted to one of said plurality of tasks which has successfully locked onto a shared resource, said task scheduling method comprising the steps of: determining whether one of said tasks has successfully locked onto said shared resource; informing an operating system of said one of said task, locking onto said shared resource; registering by a processor a task identifier indicating that said one of said task, has locked onto said shared resource into a locking task table; deleting, by said processor, said task identifier in said locking task table upon the unlocking of said shared resource by said one of said tasks; deciding, when a task to be executed next is to be selected, whether a task identifier is registered in said locking task table; selecting, when the deciding step has decided that a task identifier is registered in said locking task table, a task corresponding to said task identifier which was decided as being registered in said locking task table as the next task to be executed; and selecting, when the deciding step has decided that a task identifier is not registered in said locking task table, one of a plurality of tasks waiting in an execution wait state with the highest priority as the next task to be executed.

Claim 10

Dependent Claim 233 words

A computer implemented task scheduling method for use in a computer system including a plurality of shared resources accessible by a plurality of tasks each of which has a predetermined execution priority, and a locking task table, said task scheduling method comprising the steps of: registering, in said locking task table, a task identifier identifying one of said plurality of tasks when said one of said plurality of tasks locks one of said shared resources and deleting said task identifier when said one of said plurality of tasks unlocks said one of said shared resources; suspending, by a processor, execution of a task running in response to occurrence of an interrupt to execute an interrupt task processing; in response to termination of execution of said interrupt task processing, referring by said processor, to said locking task table to determine whether a task identifier is registered in said locking task table; in response to determination in said referring step indicating that a task identifier is registered in said locking task table, selecting by said processor, with priority a task corresponding to the registered task identifier as a task to be executed next; and in response to determination in said referring step indicating that a task identifier is not registered in said locking task table, selecting, by said processor, one of said tasks based on their predetermined priorities as the task to be executed next.

Claim 11

Dependent Claim 233 words

A computer implemented task scheduling method for use in a computer system including a plurality of shared resources accessible by a plurality of tasks each of which has a predetermined execution priority, and a locking task table, said task scheduling method comprising the steps of: registering, in said locking task table, a task identifier identifying one of said plurality of tasks when said one of said plurality of tasks locks one of said shared resources and deleting said task identifier when said one of said plurality of tasks unlocks said one of said shared resources; suspending, by a processor, execution of a task running in response to occurrence of an interrupt to execute an interrupt task processing; in response to termination of execution of said interrupt task processing, referring by said processor, to said locking task table to determine whether a task identifier is registered in said locking task table; in response to determination in said referring step indicating that a task identifier is registered in said locking task table, selecting by said processor, with priority a task corresponding to the registered task identifier as a task to be executed next; and in response to determination in said referring step indicating that a task identifier is not registered in said locking task table, selecting, by said processor, one of said tasks based on their predetermined priorities as the task to be executed next.

Claim 12

Dependent Claim 45 words

A task scheduling method according to claim 8, wherein said selecting step selects a task to be executed next in accordance with said predetermined priority when said referring step indicates a determination that a task identifier has not been registered in said locking task table.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	1997-12-26	1998-06-27	1998-12-27	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2001-12-26	2002-06-27	2002-12-27	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2005-12-26	2006-06-27	2006-12-27	$7700.00	Window Closed / Lapsed

Method of scheduling tasks with priority to interrupted task locking shared resource

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag