Task control means for a multi-tasking data processing system

• US 4,658,351 A
• Filed: 10/09/1984
• Issued: 04/14/1987
• Est. Priority Date: 10/09/1984
• Status: Expired due to Term

• Current Assignee: Intel Corporation
• Original Assignee: Wang Laboratories Incorporated
• Inventors: Teng, Peter Y.
• Primary Examiner(s): Williams, Archie E.
• Assistant Examiner(s): NOT, DEFINED
• Application Number:
  US06/658,951
• Time in Patent Office: 917 Days
• Field of Search: 364/200 MS File, 364/900 MS File, 364/300 MS File
• US Class Current: 718/103
• CPC Class Codes: G06F 40/117 Tagging; Marking up details of markup languages G06F40/143; Designating a block; Setting of attributes style sheets, e.g. eXtensible Stylesheet Language Transformation [XSLT], G06F40/154
• CPC Class Codes: G06F 40/131 Fragmentation of text files, e.g. creating reusable text-blocks; Linking to fragments, e.g. using XInclude; Namespaces
• CPC Class Codes: G06F 9/4881 Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues

Abstract

A task control method and apparatus for controlling the interactive, concurrent execution of a plurality of general purpose data processing tasks in a data processing system. The system includes a memory for storing active tasks, a mass storage means for storing inactive tasks and a general purpose CPU. Upon request by a user or by an active task, a task loader transfers a presently inactive task from the mass storage means to the memory to be available for execution. A memory manager assigns a task node space in the memory and a task manager creates a task control block for the task to be activated, assigns a task control block identification to the task control block, and writes the task control block identification into the task'"'"'s task node space to link the task to the task'"'"'s task control block. The task manager includes a plurality of task queues, each queue corresponding to a relative priority level for execution of the tasks, and each task control block is stored in a task queue corresponding to the task'"'"'s priority level. The sequence of the task control blocks in each task queue is dependent upon the status of execution of the corresponding task. Tasks are executed in a sequence depending upon the relative priorities of the task queues and upon the sequential locations of the task control blocks in a task queue.

Claims

1. In a data processing system including memory means for storing data and active tasks, CPU means responsive to active tasks for operating on the data, mass storage means for storing inactive tasks, and keyboard means for entering user commands for interactively controlling execution of the active tasks, task control means for controlling the interactive, concurrent execution of a plurality of tasks, comprising:

task loader means responsive to a task load request resulting from user commands or the execution of presently active tasks for transferring a corresponding inactive task from the storage means to the memory means to become an active task to be executed,

memory manager means responsive to operation of the task loader means for assigning a corresponding task node space in the memory means for storing the task to be transferred into the memory means,

task manager means, including

task control block means responsive to the task load request for

creating a task control block corresponding to the task to be transferred from the storage means to the memory means to become an active task, each task control block containing information used by the task manager means in controlling execution of the corresponding active task, and

generating a corresponding task control block identification and writing the task control block identification into the corresponding task node space in the memory means,

each task control block identification linking the task to the corresponding task control block, and

task queue means for ordering the sequence of execution of the active tasks wherein each active task is a member of one of a plurality of priority levels, including

a task queue for each priority level, wherein

the task control block of each active task resides in the task queue corresponding to the priority level of the task, and

the task control blocks reside in each task queue in a sequence determined by the status of execution of the corresponding active tasks, and wherein

the task manager means is responsive to the priority level and status of each active task to write the corresponding task control block into the corresponding sequential location in the task queue corresponding to the priority level of the task.

2. The task control means of claim 1, wherein each task control block comprises;

an identification field for storing information identifying the corresponding task,

a status field for storing information identifying the status of execution of the corresponding task, and

a priority field for storing information identifying the relative priority of execution of the corresponding task.

3. The task control means of claim 2, wherein each task control block further includes:

sequence pointers linking together the task control blocks residing in each task queue in the preferred sequence of execution of the tasks, and wherein

the task manager means is responsive to the conclusion of execution of a presently executing active task for reading the task control blocks of the active task residing in the task queues to determine a next active task to be executed, the task manager means being responsive to the sequence of task control blocks in each task queue and to the relative priorities of the task queues for executing the active tasks in order of priority as determined by the task queues in which they reside and in the sequence in which the task control blocks reside in the task queues.

4. The task control means of claim 2, wherein the task manager means further comprises:

stack means for storing information regarding the execution of presently active tasks,

the stack means including a task stack mechanism for each active task, and wherein

each task control block further includes a stack pointer field for storing information identifying the location of the corresponding task stack mechanism.

5. The task control means of claim 1, wherein the memory management means is further responsive to active tasks to assign additional space in the memory means to the task node spaces of the active tasks as requested by the tasks.

6. The task control means of claim 1, wherein the task manager means further comprises:

stack means for storing information regarding the execution of presently active tasks,

the stack means including a task stack mechanism for each active task.

7. In a data processing system including memory means for storing data and active tasks, CPU means responsive to active tasks for operating on the data, mass storage means for storing inactive tasks, and keyboard means for entering user commands for interactively controlling execution of the active tasks, a method for controlling the interactive, concurrent execution of a plurality of tasks, comprising the steps of:

responsive to a task load request resulting from user commands or the execution of presently active tasks,

transferring a corresponding inactive task from the storage means to the memory means to become an active task to be executed,

responsive loading of the task,

assigning a corresponding task node space in the memory means for storing the task to be transferred into the memory means,

creating a task control block corresponding to the task to be transferred from the storage means to the memory means to become an active task, each task control block containing information used by the task manager means in controlling execution of the corresponding active task,

generating a corresponding task control block identification and writing the task control block identification into the corresponding task node space in the memory means,

each task control block identification linking the task to the corresponding task control block, and

writing the task control block into a task queue means for ordering the sequence of execution of the active tasks, wherein

each active task is a member of one of a plurality of priority levels,

there is a task queue for each priority level,

the task control block for each active task resides in the task queue corresponding to the priority level of the task, and

the task control blocks reside in each task queue in a sequence determined by the status of execution of the corresponding active task, and

responsive to execution of the tasks and the information contained in the corresponding task control blocks, executing the active tasks in the order determined by the relative priorities of the task queues in which the task control blocks reside and in the order determined by the sequence of the task control blocks in the task queues.

8. The method of claim 7, wherein each task control block comprises:

an identification field for storing information identifying the corresponding task,

a status field for storing information identifying the status of execution of the corresponding task, and

a priority field for storing information identifying the relative priority of execution of the corresponding task.

9. The method of claim 8, further comprising the steps of:

responsive to the relative priority of execution of active tasks and the status of each task

providing in each task control block sequence pointers linking together the task control blocks residing in each task queue in the preferred sequence of execution of the tasks, and

responsive to the sequence of task control blocks in each task queue and to the relative priorities of the task queues,

executing the active tasks in order of priority as determined by the task queues in which they reside and in the sequence in which the task control blocks reside in the task queues.

10. The method of claim 8, further comprising the steps of:

p1 providing a stack means for storing information regarding the execution of presently active tasks, and

during the step of creating a task control block for a task which is to become an active task, generating a task stack mechanism for the task, so that

the stack means includes a task stack mechanism for each active task, and wherein

each task control block further includes a stack pointer field for storing information identifying the location of the corresponding task stack mechanism.

11. The method of claim 7, further comprising the step of:

responsive to the execution of active tasks,

assigning additional space in the memory means to the task node spaces of the active tasks as requested by the tasks.

12. The method of claim 7, further comprising the steps of:

providing a stack means for storing information regarding the execution of presently active tasks, and

during the step of creating a task control block for a task which is to become an active task, generating a task stack mechanism for the task, so that

the stack means includes a task stack mechanism for each active task.