# US 2005/0240757 A1 · Control program product and data processing system

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

- Number: US 2005/0240757 A1
- Document ID: US20050240757A1
- Status: Published application
- Kind: A1
- Application number: 11/103,345
- Filed: 2005-04-11
- Published: 2005-10-27
- Earliest claimed: 1999-08-30
- Assignees: Ipflex Inc.
- Inventors: Tomoyoshi Sato
- Web page: https://patentgrep.com/patent/US20050240757A1

## CPC

- G06F 9/3016: {Decoding the operand specifier, e.g. specifier format}
- G06F 9/30076: {to perform miscellaneous control operations, e.g. NOP}
- G06F 9/30145: {Instruction analysis, e.g. decoding, instruction word fields}
- G06F 9/30167: {of immediate specifier, e.g. constants}
- G06F 9/30181: {Instruction operation extension or modification}
- G06F 9/3885: {using a plurality of independent parallel functional units}
- G06F 9/3897: {with adaptable data path}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

An instruction set is provided which has a first field for describing an execution instruction for designating content of an operation or data processing that is executed in at least one processing unit forming a data processing system, and a second field for describing preparation information for setting the processing unit to such a state that is ready to execute an operation or data processing that is executed according to the execution instruction, thereby making it possible to provide a control program having the instruction set in which preparation information independent of the execution instruction described in the first field is described in the second field. Accordingly, preparation for execution of the subsequent execution instruction is made based on the preparation information. In the instruction set, since destination of branch instruction is described in the second field and is known in advance, the problems that cannot be solved with a conventional instruction set can be solved.

## Claims

### Claim at position 1

1-39. (canceled)

### Claim 40

A data processing system, comprising;
a section that includes a plurality of processing units, with combination of the plurality of processing units, various data paths being flexibly configured;
a configuration memory for storing configuration data that change configurations of the plurality of processing unit in the section; and
a control unit for loading a desired configuration data among the configuration data stored in the configuration memory and retaining the configurations until a terminal condition is satisfied.

### Claim 41 (depends on 40)

A data processing system according to claim 40,
wherein the control unit loads the desired configuration data according to a schedule.

### Claim 42 (depends on 40)

A data processing system according to claim 40,
wherein the control unit loads the desired configuration data according to a provided instruction.

### Claim 43 (depends on 40)

A data processing system according to claim 40,
wherein the control unit reconfigures the section at a suitable timing.

### Claim 44 (depends on 40)

A data processing system according to claim 40,
wherein the control unit retain the configurations during a predetermined number of clocks or until a cancel instruction is given.

### Claim 45 (depends on 40)

A data processing system according to claim 40,
wherein the configuration data include data for setting respective interfaces of the plurality of processing units.

### Claim 46 (depends on 40)

A data processing system according to claim 40,
wherein the configuration data include data for setting respective contents of processing of the plurality of processing units.

### Claim 47

A method for controlling a data processing system, comprising a section that includes a plurality of processing units, with combination of the plurality of processing units, various data paths being flexibly configured; and a configuration memory for storing configuration data that change configurations of the plurality of processing unit in the section,
a step of loading a desired configuration data among the configuration data stored in the configuration memory; and
a step of retaining the configurations until a terminal condition is satisfied.

### Claim 48 (depends on 47)

A method according to claim 47,
wherein in the step of loading, the desired configuration data are loaded according to a schedule.

### Claim 49 (depends on 47)

A method according to claim 47,
wherein in the step of loading, the desired configuration data are loaded according to a provided instruction.

### Claim 50 (depends on 47)

A method according to claim 47,
wherein in the step of loading, the section is reconfigured at a suitable timing.

### Claim 51 (depends on 47)

A method according to claim 47,
wherein in the step of retaining, the configurations are retained during a predetermined number of clocks or until a cancel instruction is given.

### Claim 52 (depends on 47)

A method according to claim 47,
wherein the configuration data include data for setting respective interfaces of the plurality of processing units.

### Claim 53 (depends on 47)

A method according to claim 47,
wherein the configuration data include data for setting respective contents of processing of the plurality of processing units.
