System for processing instructions in a program
OwnerMarc A.G. Duranton, Laurent Pasquier +2inventors
InventorsMarc A.G. Duranton, Laurent Pasquier, Valerie Rivierre, Qin Zhao
Life of this patent
Estimating the term…
Loading patent…
OwnerMarc A.G. Duranton, Laurent Pasquier +2inventors
InventorsMarc A.G. Duranton, Laurent Pasquier, Valerie Rivierre, Qin Zhao
Estimating the term…
The invention relates to a processing system for processing program instructions (I1) by calculating units (16). To enable constraints of the real-time type to be satisfied, points in time (t1) at which the instructions have to be executed are defined, and the instructions are in fact executed at these points in time. To this end, the processing system comprises means (14) for comparing these points in time with an execution time (13), and firing means (15) suitable for causing the instructions to be executed, or not, by the calculating units as a function of the comparison. A block of instructions is associated with at least one tag representing one point in time at which it has to be executed. The tags are stored in a content-addressable memory (22) that is suitable for comparing a given tag with the execution time, and for supplying a descriptor (B1*) describing the block of instructions corresponding to this given tag when there is a match between this given tag and the execution time.
A processing system comprising at least one calculating unit (16) intended to execute at least one block (B1) comprising one or more instructions (I1), said block being associated with at least one point in time (t1) at which it has to be executed by said calculating unit, said point in time being determined from a scheduling time (12a), said processing system comprising means (14) for comparing said point in time with an execution time (13) linked to the scheduling time, and firing means (15) for causing said block of instructions to be executed, or not, by the calculating unit as a function of the comparison, a block of instructions being associated with at least one tag (TAG1) representing at least one point in time at which it has to be executed, the tags being stored in a content-addressable memory (22) that is suitable for comparing a given tag with the execution time, and for supplying a descriptor (B1*) describing the block of instructions corresponding to said given tag when there is a match between the given tag and the execution time.
A processing method comprising at least one execution step that is performed by a calculating unit intended to execute at least one block comprising one or more instructions, which block is associated with at least one point in time at which it has to be executed by said calculating unit, said point in time being determined from a scheduling time, said processing method being characterized in that it comprises a step for comparing said point in time with an execution time linked to the scheduling time, and a firing step for causing said block of instructions to be executed, or not, by the calculating unit as a function of a result of said comparison step, a block of instructions being associated with at least one tag representing at least one point in time at which it has to be executed, the tags being stored in a content-addressable memory that is suitable for comparing a given tag with the execution time, and for supplying a descriptor describing the block of instructions corresponding to said given tag when there is a match between the given tag and the execution time.
Dependencies are inferred from the claim text.