# US 2008/0270773 A1 · Processing element having dual control stores to minimize branch latency

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

- Number: US 2008/0270773 A1
- Document ID: US20080270773A1
- Status: Published application
- Kind: A1
- Application number: 11/796,810
- Filed: 2007-04-30
- Published: 2008-10-30
- Earliest claimed: 2007-04-30
- Assignees: Hewlett-Packard Development Company, L.P.
- Inventors: Michael L. Ziegler
- Web page: https://patentgrep.com/patent/US20080270773A1

## CPC

- G06F 9/267: {by instruction selection on output of storage}
- G06F 9/322: {for non-sequential address}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Embodiments involve an embedded processing element that fetches at least two possible next instructions (control words) in parallel in one cycle, and executes one of them during the following cycle based on the result of a conditional branch test. Embodiments reduce or avoid branch penalties (zero penalty branches).

## Claims

### Claim 1

A system comprising:
a first memory for storing a first plurality of words;
a second memory for storing a second plurality of words;
a register for storing a current word, wherein the current word comprises a first address of a next possible word from the first memory and a second address of a next possible word from the second memory; and
a multiplexer that selects one of the next possible word from the first memory and the next possible word from the second memory to be the next current word during a time period;
wherein the next possible word corresponding to the first address and the next possible word corresponding to the second address are provided to the multiplexer during the time period.

### Claim 2 (depends on 1)

The system of claim 1, wherein the multiplexer uses a test result to select the next current word.

### Claim 3 (depends on 2)

The system of claim 2, wherein the current word further comprises an encoding that directs the test to from the test result.

### Claim 4 (depends on 3)

The system of claim 3, wherein the encoding comprises one of:
a command to unconditionally select one of the next possible word from the first memory and the next possible word from the second memory to be the next current word; and
a command to conditionally select one of the next possible word from the first memory and the next possible word from the second memory to be the next current word.

### Claim 5 (depends on 4)

The system of claim 4, wherein the a command to conditionally select one of the next possible word from the first memory and the next possible word from the second memory to be the next current word is based on one of:
(a) an operation of an arithmetic unit using a portion of the current word;
(b) an operation of logical unit using a portion of the current word;
(c) a logical AND of an operation of the arithmetic unit using a portion of the current word and an operation of logical unit using a portion of the current word;
(d) a logical OR of an operation of the arithmetic unit using a portion of the current word and an operation of logical unit using a portion of the current word;
(e) an inverse of (a), (b), (c), or (d); and
(f) a predication using a portion of the current word.

### Claim 6 (depends on 1)

The system of claim 1, further comprising:
an execution unit that receives a portion of the current word and performs an operation based on the portion.

### Claim 7 (depends on 6)

The system of claim 6, wherein the execution unit comprises one of:
a logical unit, and an arithmetic unit.

### Claim 8 (depends on 6)

The system of claim 6, wherein the execution unit performs a hash function.

### Claim 9 (depends on 1)

The system of claim 1, wherein the current word further comprises:
An encoding for modifying the next current word.

### Claim 10 (depends on 9)

The system of claim 9, wherein the encoding defines one of:
no modification, replacing one of the first address and the second address with another address, and replacing a portion of one of the first address and the second address with another portion.

### Claim 11 (depends on 9)

The system of claim 9, wherein the encoding defines one of:
a register dispatch, and a hash value.

### Claim 12 (depends on 1)

The system of claim 1, wherein the system handles packets in a network.

### Claim 13 (depends on 1)

The system of claim 1, wherein the first plurality of words is the same as the second plurality of words.

### Claim 14 (depends on 1)

The system of claim 1, wherein the first plurality of words is different from the second plurality of words.

### Claim 15 (depends on 1)

The system of claim 1, wherein the system is a horizontally programmed micro-engine.

### Claim 16 (depends on 1)

The system of claim 1, wherein the time period is one cycle.

### Claim 17

A method comprising:
storing a first word in a computer readable register during a first time period;
retrieving a second word from a first computer readable memory during a second time period based on the first word;
retrieving a third word from a second computer readable memory during the second time period based on the first word; and
executing the first word to determine which of the second word and the third word will be subsequently stored in the computer readable register during the second time period.

### Claim 18 (depends on 17)

The method of claim 17, further comprising:
repeating the storing the first word, the retrieving the second word, retrieving the third word, and the executing the first word to handle packets in a network.

### Claim 19

A data structure that is stored in a computer readable memory that is operative to control a plurality of execution units to manage packets in a network, wherein the data structure comprises:
a first address of a first next possible data structure that is stored in a first memory;
a second address of a second next possible data structure that is stored in a second memory; and
encoding used to select the next data structure from the first next possible data structure and the second next possible data structure.

### Claim 20 (depends on 19)

The data structure of claim 19, wherein the data structure is executed by a horizontally programmed micro-engine.
