# US 2003/0233532 A1 · System for processing instructions in a program

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2003/0233532 A1
- Document ID: US20030233532A1
- Status: Published application
- Kind: A1
- Application number: 10/372,544
- Filed: 2003-02-24
- Published: 2003-12-18
- Earliest claimed: 2002-02-26
- Inventors: Marc A.G. Duranton; Laurent Pasquier; Valerie Rivierre; Qin Zhao
- Web page: https://patentgrep.com/patent/US20030233532A1

## CPC

- G06F 9/3836: {Instruction issuing, e.g. dynamic instruction scheduling or out of order instruction execution}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

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.

## Claims

### Claim 1

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.

### Claim 2 (depends on 1)

A processing system as claimed in claim 1, characterized in that a block of instructions is also associated with at least one identifier (P1) that indicates the calculating unit by which it has to be executed, the identifier being transmitted to an instruction sequencer (30) that is suitable for causing the instructions in that block which corresponds to said descriptor to be executed by that calculating unit which corresponds to said identifier.

### Claim 3

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.

### Claim 4 (depends on 3)

A processing method as claimed in claim 3, characterized in that a block of instructions is also associated with at least one identifier that indicates the calculating unit by which it has to be executed, the identifier being transmitted to an instruction sequencer that is suitable for causing the instructions in that block which corresponds to said descriptor to be executed by that calculating unit which corresponds to said identifier.

### Claim 5 (depends on 3)

A program comprising program code instructions for executing the steps of the method claimed in claim 3 when said program is run on a microprocessor.

### Claim 6 (depends on 1, 2)

An image rendering processor comprising a processing system as claimed in claim 1 or 2.

### Claim 7 (depends on 6)

A set-top box for television comprising at least one image rendering processor as claimed in claim 6.

### Claim 8 (depends on 6)

A device comprising at least one screen intended to display images and an image rendering processor as claimed in claim 6.

### Claim 9 (depends on 6)

A communications system comprising at least one transmitter suitable for transmitting signals representing at least one image, a transmission network, a receiver suitable for receiving said signals and an image rendering processor as claimed in claim 6.
