# US 2003/0204665 A1 · High performance architecture with shared memory

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

- Number: US 2003/0204665 A1
- Document ID: US20030204665A1
- Status: Published application
- Kind: A1
- Application number: 10/133,941
- Filed: 2002-04-26
- Published: 2003-10-30
- Earliest claimed: 2002-04-26
- Assignees: Infineon Technologies AG
- Inventors: Raj Kumar Jain; Rudi Frenzel
- Web page: https://patentgrep.com/patent/US20030204665A1

## CPC

- G06F 12/0607: {Interleaved addressing}
- G06F 12/0888: using selective caching, e.g. bypass
- G06F 2212/2532: comprising a plurality of modules
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A system with multiple processors sharing a single memory module without noticeable performance degradation is described. The memory module is divided into n independently addressable banks, where n is at least 2 and mapped such that sequential addresses are rotated between the banks. A bank may be further divided into a plurality of blocks. A cache is provided to enable a processor to fetch from memory a plurality of data words from different memory banks to reduce memory latency caused by memory contention.

## Claims

### Claim 1

A method of sharing a memory module between a plurality of processors comprising:
dividing the memory module into n banks, where n=at least 2, enabling the memory module to be accessed by one or more processors simultaneously;
mapping the memory module to allocate sequential addresses to alternate banks of the memory;
storing data words in memory, wherein data words in sequential addresses are stored in alternate banks due to the mapping of the memory; and
providing a first signal path, the first signal path coupling a cache to a processor and the memory module when selected, the cache enabling the processor to fetch a plurality of data words from different banks simultaneously.

### Claim 2 (depends on 1)

The method of claim 1 further including a step of dividing the bank into x blocks, where x=at least 1, wherein a block can be accessed by one of the plurality of processors at any one time.

### Claim 3 (depends on 2)

The method of claim 2 further including a step of determining whether contention has occurred, wherein two or more processors are accessing the same address range at any one time.

### Claim 4 (depends on 3)

The method of claim 3 wherein the address range coincides with at least one block.

### Claim 5 (depends on 4)

The method of claim 4 further including a step of synchronizing the processors to access different banks when contention has occurred.

### Claim 6 (depends on 1)

The method of claim 1 further including the step of providing a second signal path, the second signal path coupling the processor to the memory module when selected.

### Claim 7 (depends on 6)

The method of claim 6 further including a step of activating the second signal path when contention has not occurred.

### Claim 8 (depends on 7)

The method of claim 7 further including a step of synchronizing the processors to access different banks when contention has occurred.

### Claim 9 (depends on 8)

The method of claim 8 further including a step of determining access priorities of the processors when contention has occurred.

### Claim 10 (depends on 9)

The method of claim 9 wherein the step of determining access priorities comprises assigning lower access priorities to processors that have caused the contention.

### Claim 11 (depends on 5)

The method of claim 5 wherein the step of synchronizing the processors comprises inserting wait states for processors with lower priorities when contention occurs.

### Claim 12 (depends on 11)

The method of claim 11 further including a step of activating the first signal path when contention has occurred.

### Claim 13

A system comprising:
a plurality of processors;
a memory module comprising n banks, where n=at least 2, wherein a bank can be accessed by one or more processors at any one time;
a memory map for allocating sequential addresses to alternate banks of the memory module;
data words stored in memory, wherein data words in sequential addresses are stored in alternate banks according to the memory map; and
a plurality of control logic units for enabling a processor to access a plurality of data words from different banks.

### Claim 14 (depends on 13)

The system of claim 13 wherein a control logic unit comprises first and second signal paths, the first signal path coupling a cache to a processor and the memory module, the second signal path coupling the processor to the memory module.

### Claim 15 (depends on 14)

The system of claim 14 wherein the first signal path comprises a cache register and a multiplexer.

### Claim 16 (depends on 15)

The system of claim 15 wherein the bank comprises x blocks, where x=at least 1, wherein a block can be accessed by one of the plurality of processors at any one time.

### Claim 17 (depends on 16)

The system of claim 16 further comprising a flow control unit for synchronizing the processors to access different blocks at any one time.

### Claim 18 (depends on 17)

The system of claim 17 further comprising a priority register for storing the access priority of a processor.

### Claim 19 (depends on 18)

The system of claim 18 further comprising a plurality of critical memory modules for storing a plurality of data words for the processors to reduce the possibility of contention.

### Claim 20 (depends on 13)

The system of claim 13 wherein a control logic unit comprises a first signal path, the first signal path coupling a cache to a processor and the memory module.
