US6105048A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus and method for the real-time processing of a plurality of tasks
Assignee: Siemens AG
•
Filing: 1996-08-16
•
Granted: 2000-08-15
•
Expires: 2016-08-16
Abstract
Abstract An apparatus and a method for the processing of a plurality of tasks by a processor of a real-time data processing installation, in which each task is dynamically allocated a priority according to its urgency, after which the tasks are processed by a processor. For this purpose, for each task to be processed, the generation of an initiation cell having a number of t- and i-bits is provided, as is the entering of this initiation cell into a free cell of a contention unit. The time sequence information contained in the t-bits of all cells of the contention unit are compared with one another in order to determine the task containing the smallest time sequence information. In case the determined task does not agree with the previously determined task, an interrupt signal is sent to the processor in order to introduce the processing of this newly determined task.
Inventors
- 👤 Xiaoyong He
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 06:01
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/48; G06F9/4806; G06F9/4812; G06F9/4831; G06F9/4837; G06F9/4843; G06F9/4881; G06F9/4887
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
244 words
A method for processing of a plurality of tasks by a processor of a real-time data processing apparatus, in which each task is to be processed individually in a processor according to a dynamically allocated priority and within a predetermined time period, comprising the steps of: for each task to be processed by the processor, generating an initiation cell having a plurality of t-bits that contain a time sequence information which indicates a time within which a processing of the respective task must be carried out, and a plurality of i-bits that contain an index information referring to a task control block in the data processing apparatus; in order to log tasks on for processing, entering each initiation cell which has been produced independently from its priority to a free contention cell in a contention unit which is independent of the processor and which has a plurality of contention cells; for defining a task which has to be executed next, after the entry of the initiation cells comparing the time sequence information in each of the initiation cells entered into the free contention cells in the contention unit in order to determine which task has a lowest time sequence information; and sending an interrupt signal to the processor in order to initiate processing of the determined task having the lowest time sequence information, provided that the determined task does not correspond with a previously determined task which is currently being processed by the processor.
Claim 2
Independent Claim
244 words
A method for processing of a plurality of tasks by a processor of a real-time data processing apparatus, in which each task is to be processed individually in a processor according to a dynamically allocated priority and within a predetermined time period, comprising the steps of: for each task to be processed by the processor, generating an initiation cell having a plurality of t-bits that contain a time sequence information which indicates a time within which a processing of the respective task must be carried out, and a plurality of i-bits that contain an index information referring to a task control block in the data processing apparatus; in order to log tasks on for processing, entering each initiation cell which has been produced independently from its priority to a free contention cell in a contention unit which is independent of the processor and which has a plurality of contention cells; for defining a task which has to be executed next, after the entry of the initiation cells comparing the time sequence information in each of the initiation cells entered into the free contention cells in the contention unit in order to determine which task has a lowest time sequence information; and sending an interrupt signal to the processor in order to initiate processing of the determined task having the lowest time sequence information, provided that the determined task does not correspond with a previously determined task which is currently being processed by the processor.
Claim 3
Dependent Claim
44 words
The method according to claim 1 wherein the initiation cell is generated by a process initiation unit, containing an initiation cell, having t-bits pre-coded or initiated by the processor, for each admitted external event that can signal a task for processing by the processor.
Claim 4
Dependent Claim
34 words
The method according to claim 1 wherein for an internal task to be processed the t- and i-bits for a contention cell are generated by the processor and are entered into the contention unit.
Claim 5
Dependent Claim
57 words
The method according to claim 1 wherein an r-bit is provided in each cell of the contention unit indicating whether the cell is occupied or not, and wherein before the entering of an initiation cell into a cell of the contention unit the r-bit is checked in order to determine whether the cell is free or not.
Claim 6
Dependent Claim
61 words
The method according to claim 1 wherein a value of an upwardly counting counter is added to a relative time information contained in the t-bits of an initiation cell before the entering of this cell into a free cell of the contention unit, in order to generate an absolute time information that is entered into the t-bits of the contention cell.
Claim 7
Dependent Claim
53 words
The method according to claim 1 wherein a relative time information contained in the t-bits of an initiation cell is entered directly into a free cell of the contention unit, and wherein a content of the t-bits of all contention cells is reduced corresponding to a clock rate of a downwardly counting counter.
Claim 8
Dependent Claim
47 words
The method according to claim 1 wherein each cell of the contention unit contains f-bits that are provided for an intertask communication by means of which participation of a contention cell in the comparison of the time sequence information contained in the t-bits can be temporarily suppressed.
Claim 9
Dependent Claim
44 words
The method according to claim 1 wherein the comparison of the time sequence information of the contention cells is carried out only if a write access has taken place to the contention unit, which has modified a state of at least one contention cell.
Claim 10
Dependent Claim
58 words
The method according to claim 7 wherein independently of the state of the contention cells, a comparison of the time sequence information of all occupied contention cells is periodically further carried out in order to indicate an overloading as soon as it has been determined that a task was not processed within a time predetermined in the t-bits.
Claim 11
Independent Claim
229 words
An apparatus for processing of a plurality of tasks within a predetermined time period in a processor according to a dynamically allocated priority, comprising: means for generating for each task to be processed by the processor an initiation cell having a plurality of t-bits that contain a time sequence information which indicates a time within which a processing of the respective task must be carried out, and a plurality of i-bits that contain an index information referring to a task control block in the data processing apparatus; means for entering each initiation cell which has been produced independently from its priority to a free contention cell in a contention unit independent of the processor and having a plurality of contention cells in order to log on tasks for processing; means for comparing, after the entry of the initiation cells, the time sequence information in each of the initiation cells entered into the free contention cells in the contention unit in order to determine which task has a lowest time sequence information in order to define a task which has to be executed next; and means for sending an interrupt signal to the processor in order to initiate processing of the determined task having the lowest time sequence information, provided that the determined task does not correspond with a previously determined task which is currently being processed by the processor.
Claim 12
Independent Claim
229 words
An apparatus for processing of a plurality of tasks within a predetermined time period in a processor according to a dynamically allocated priority, comprising: means for generating for each task to be processed by the processor an initiation cell having a plurality of t-bits that contain a time sequence information which indicates a time within which a processing of the respective task must be carried out, and a plurality of i-bits that contain an index information referring to a task control block in the data processing apparatus; means for entering each initiation cell which has been produced independently from its priority to a free contention cell in a contention unit independent of the processor and having a plurality of contention cells in order to log on tasks for processing; means for comparing, after the entry of the initiation cells, the time sequence information in each of the initiation cells entered into the free contention cells in the contention unit in order to determine which task has a lowest time sequence information in order to define a task which has to be executed next; and means for sending an interrupt signal to the processor in order to initiate processing of the determined task having the lowest time sequence information, provided that the determined task does not correspond with a previously determined task which is currently being processed by the processor.
Claim 13
Dependent Claim
45 words
An apparatus according to claim 10 wherein the means for the generation of an initiation cell is a process initiation unit in which an initiation cell having t-bits that are pre-coded or initiated by the processor is provided for an external task to be processed.
Claim 14
Dependent Claim
18 words
An apparatus according to claim 11 wherein the means for generating an initiation cell is the processor itself.
Claim 15
Dependent Claim
28 words
An apparatus according to claim 10 wherein the means for the comparison of the time sequence information contained in the t-bits of the contention cells comprises an arbiter.
Claim 16
Dependent Claim
25 words
An apparatus according to claim 10 further including means for checking an r-bit of the contention cells which indicates whether it is occupied or not.
Claim 17
Dependent Claim
51 words
An apparatus according to claim 14 further including means for setting and resetting f-bits of each cell of the contention unit which are provided for an intertask communication by which participation of a contention cell in the comparison of the time sequence information contained in the t-bits can be temporarily suppressed.
Claim 18
Dependent Claim
53 words
An apparatus according to claim 10 further including means for adding a content of an upwardly counting counter to a relative time information contained in the t-bits of an initiation cell in order to generate an absolute time information that is entered into the t-bits of the allocated cell of the contention unit.
Claim 19
Dependent Claim
34 words
An apparatus according to claim 10 further including means for reduction of a relative time information contained in the t-bits of each contention cell corresponding to a clock rate of a downwardly counting counter.
Claim 20
Dependent Claim
53 words
An apparatus according to claim 16 further including means for comparison of a smallest time sequence information of all occupied contention cells with the upwardly counting counter in order to indicate an overloading in case a value of the smallest time sequence information is smaller than a value of the upwardly counting counter.
Claim 21
Dependent Claim
30 words
An apparatus according to claim 18 further including means for indication of an overloading state in case a value of the smallest time sequence information has reached a value zero.
Claim 22
Dependent Claim
15 words
An apparatus according to claim 18 further including means for blocking of the overloading indication.
References Cited (Backward Citations)
US4084228A
Cited
US4642756A
Cited
EP0415515A2
Cited
US5185861A
Cited
US5465335A
Cited
EP0553588A2
Cited
US5630130A
Cited
US5379428A
Cited
US5606695A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-08-15 | 2004-02-14 | 2004-08-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-08-15 | 2008-02-14 | 2008-08-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-08-15 | 2012-02-14 | 2012-08-15 | $7700.00 | Window Closed / Lapsed |