US5448735A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Task organization for execution using linked records referencing code modules
Assignee: Apple Inc
•
Filing: 1995-01-06
•
Granted: 1995-09-05
•
Expires: 2015-01-06
Abstract
Abstract An apparatus and method of grouping tasks for execution by a processor, such as a digital signal processor. At least one task datum, is created the task datum including an identifier of a first task, and a reference to a next task datum. The task datum is placed into a task list which may contain references to any number of tasks. A reference is created to a first module datum in the task datum, the first module datum representing a first executable module of the first task. The first module datum is linked with any number of modules having functions related to the first executable module. By grouping the related modules which form a task together, error conditions, and data for each of the tasks and modules may be handled more efficiently. Modules may reference common storage areas they require so that unnecessary loading/saving of data in those common storage areas may be avoided.
Inventors
- 👤 Eric C. Anderson
- 👤 Hugh B. Svendsen
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 16:11
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/48; G06F9/4806; G06F9/4843; G06F9/4881
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
249 words
A computer-implemented method of executing a first task, said first task including a plurality of subtasks, the method comprising the steps of: A) identifying a first task record, wherein the first task record has an identifier that identifies said first task, wherein the first task record is linked to a first module record of a plurality of module records, wherein the plurality of module records are sequentially linked to each other in a list that begins with said first module record and ends with a last module record, wherein each module record of said plurality of module records is linked to a corresponding code module of a plurality of code modules, wherein each code module of said plurality of code modules contains a set of executable functions which implement a subtask of said plurality of subtasks; B) establishing said first module record as a current module record by following a link from said first task record to said first module record; C) identifying a current code module of said plurality of code modules that corresponds to said current module record by following a link from said current module record; D) executing said set of executable functions contained in the current code module; and E) if said current module record is not said last module record, then E1) establishing a next module record of said plurality of module records as said current module record by following a link from said current module record, and E2) repeating steps C) through E).
Claim 2
Dependent Claim
249 words
A computer-implemented method of executing a first task, said first task including a plurality of subtasks, the method comprising the steps of: A) identifying a first task record, wherein the first task record has an identifier that identifies said first task, wherein the first task record is linked to a first module record of a plurality of module records, wherein the plurality of module records are sequentially linked to each other in a list that begins with said first module record and ends with a last module record, wherein each module record of said plurality of module records is linked to a corresponding code module of a plurality of code modules, wherein each code module of said plurality of code modules contains a set of executable functions which implement a subtask of said plurality of subtasks; B) establishing said first module record as a current module record by following a link from said first task record to said first module record; C) identifying a current code module of said plurality of code modules that corresponds to said current module record by following a link from said current module record; D) executing said set of executable functions contained in the current code module; and E) if said current module record is not said last module record, then E1) establishing a next module record of said plurality of module records as said current module record by following a link from said current module record, and E2) repeating steps C) through E).
Claim 3
Dependent Claim
53 words
The method of claim 1 wherein said current module record includes a skipcount field for storing a skipcount value, wherein the step of E 1) establishing a next module record as said current module record includes the step of skipping a number of module records in said list based on said skipcount value.
Claim 4
Dependent Claim
24 words
The method of claim 2 further comprising the step of terminating said first task if said skipcount value is equal to a predetermined value.
Claim 5
Dependent Claim
28 words
The method of claim 2 wherein performance of said step of D) executing said set of executable functions contained in the current code module changes said skipcount value.
Claim 6
Dependent Claim
82 words
The method of claim 1 wherein: resources are required to perform said step of D) executing said set of executable functions contained in the current code module; the current module record is linked by one or more links to the resources required to perform said step of D) executing said set of executable functions contained in the current code module; and the method further includes the step of following said one or more links from the current module record to said resources.
Claim 7
Dependent Claim
53 words
The method of claim 5 wherein the step of following said one or more links from the current module record to said resources includes following a link from the current module record to buffers required to perform said step of D) executing said set of executable functions contained in the current code module.
Claim 8
Dependent Claim
53 words
The method of claim 5 wherein the step of following said one or more links from the current module record to said resources includes following a link from the current module record to variables required to perform said step of D) executing said set of executable functions contained in the current code module.
Claim 9
Dependent Claim
53 words
The method of claim 5 wherein the step of following said one or more links from the current module record to said resources includes following a link from the current module record to tables required to perform said step of D) executing said set of executable functions contained in the current code module.
Claim 10
Dependent Claim
56 words
The method of claim 5 wherein the step of following said one or more links from the current module record to said resources includes following a link from the current module record to primary and secondary containers required to perform said step of D) executing said set of executable functions contained in the current code module.
Claim 11
Dependent Claim
51 words
The method of claim 5 wherein the step of following said one or more links from the current module record to said resources includes following a link from the current module record to buffer interconnections between the current module record and a next module record of said plurality of module records.
Claim 12
Dependent Claim
61 words
The method of claim 10 wherein the method includes the steps of: a) loading a context associated with said set of executable functions contained in the current code module prior to executing said set of executable functions contained in the current code module; and b) saving said context after executing said set of executable functions contained in the current code module.
Claim 13
Dependent Claim
41 words
The method of claim 1 further including the step of linking each given module record of said plurality of module records to resources required by the set of executable functions contained in the corresponding code module of said given module record.
Claim 14
Dependent Claim
76 words
The method of claim 12 wherein the step of linking each given module record of said plurality of module records to resources required by the set of executable functions contained in the corresponding code module of said given module record includes the step of linking each given module record of said plurality of module records to buffer interconnections between a previous subtask of said plurality of subtasks and a next subtask of said plurality of subtasks.
Claim 15
Dependent Claim
54 words
The method of claim 1 wherein said first task record includes a link to a second task record associated with a second task, wherein the method includes the steps of: after execution of said first task following said link from said first task record to said second task record, and executing said second task.
Claim 16
Dependent Claim
31 words
The method of claim 1 wherein said first module record includes buffer interconnections with a second module record and said second module record includes buffer interconnections with said first module record.
Claim 17
Independent Claim
185 words
A method for constructing within a computer system a structure for a task that includes a plurality of subtasks, the method comprising the steps of: A) constructing a plurality of module records by performing the following steps for each given subtask of said plurality of subtasks A1) identifying executable code which implements said given subtask; A2) constructing a code module section that points to said executable code; A3) identifying resources required to execute said executable code; A3) constructing a plurality of additional module sections that point to said resources required to execute said executable code; A4) constructing a module record for said given subtask, wherein said module record includes said module section and said plurality of additional module sections; B) linking said plurality of module records to form a linked list of module records, said linked list of module records beginning with a first module record and ending with a last module record; C) constructing a task record, said task record including an identifier that identifies said task; D) linking said task record to said first module record in said linked list of module records.
Claim 18
Independent Claim
185 words
A method for constructing within a computer system a structure for a task that includes a plurality of subtasks, the method comprising the steps of: A) constructing a plurality of module records by performing the following steps for each given subtask of said plurality of subtasks A1) identifying executable code which implements said given subtask; A2) constructing a code module section that points to said executable code; A3) identifying resources required to execute said executable code; A3) constructing a plurality of additional module sections that point to said resources required to execute said executable code; A4) constructing a module record for said given subtask, wherein said module record includes said module section and said plurality of additional module sections; B) linking said plurality of module records to form a linked list of module records, said linked list of module records beginning with a first module record and ending with a last module record; C) constructing a task record, said task record including an identifier that identifies said task; D) linking said task record to said first module record in said linked list of module records.
Claim 19
Dependent Claim
96 words
The method of claim 16 wherein the step of A4) constructing a module record for said given subtask includes the steps of: creating a module header; storing a first value in said module header to indicate how many module sections are in said module record; storing a second value in said module header to indicate which module section within said module record is said code module section; storing said module header in said module record; storing said code module section in said module record; and storing said plurality of additional module sections in said module record.
Claim 20
Independent Claim
294 words
A method for constructing a task list within a computer system, wherein the task list includes a plurality of task structures corresponding to a plurality of tasks, wherein each task of said plurality of tasks includes one or more subtasks, the method comprising the steps of: A) constructing said plurality of task structures by performing the following steps for each given task of said plurality of tasks A1) constructing one or more module records by performing the following steps for each given subtask of said one or more subtasks a) identifying executable code which implements said given subtask; b) constructing a code module section that points to said executable code; c) identifying resources required to execute said executable code; d) constructing a plurality of additional module sections that point to said resources required to execute said executable code; e) constructing a module record for said given subtask, wherein said module record includes said module section and said plurality of additional module sections; A2) if said one or more module records include more than one module record, then linking said one or more module records to form a linked list of module records, said linked list of module records beginning with a first module record and ending with a last module record; A3) constructing a task record, said task record including an identifier that identifies said given task; A4) if said one or more module records include more than one module record, then linking said task record to said first module record in said linked list of module records; A5) if said one or more module records include a single module record, then linking said task record to said single module record; and B) linking said plurality of task structures to form said task list.
Claim 21
Independent Claim
294 words
A method for constructing a task list within a computer system, wherein the task list includes a plurality of task structures corresponding to a plurality of tasks, wherein each task of said plurality of tasks includes one or more subtasks, the method comprising the steps of: A) constructing said plurality of task structures by performing the following steps for each given task of said plurality of tasks A1) constructing one or more module records by performing the following steps for each given subtask of said one or more subtasks a) identifying executable code which implements said given subtask; b) constructing a code module section that points to said executable code; c) identifying resources required to execute said executable code; d) constructing a plurality of additional module sections that point to said resources required to execute said executable code; e) constructing a module record for said given subtask, wherein said module record includes said module section and said plurality of additional module sections; A2) if said one or more module records include more than one module record, then linking said one or more module records to form a linked list of module records, said linked list of module records beginning with a first module record and ending with a last module record; A3) constructing a task record, said task record including an identifier that identifies said given task; A4) if said one or more module records include more than one module record, then linking said task record to said first module record in said linked list of module records; A5) if said one or more module records include a single module record, then linking said task record to said single module record; and B) linking said plurality of task structures to form said task list.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-09-04 | 1999-03-06 | 1999-09-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-09-04 | 2003-03-06 | 2003-09-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-09-04 | 2007-03-06 | 2007-09-05 | $7700.00 | Window Closed / Lapsed |