# US 2014/0208059 A1 · Highly configurable memory architecture for partitioned global address space memory systems

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

- Number: US 2014/0208059 A1
- Document ID: US20140208059A1
- Status: Published application
- Kind: A1
- Application number: 14/160,634
- Filed: 2014-01-22
- Published: 2014-07-24
- Earliest claimed: 2013-01-23
- Assignees: Emu Solutions, Inc.
- Applicants: Emu Solutions, Inc.
- Inventors: Peter M. Kogge
- Web page: https://patentgrep.com/patent/US20140208059A1

## CPC

- G06F 12/0692: {Multiconfiguration, e.g. local and global addressing}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A system and method for identifying from an address an appropriate target node and a location in that node that holds desired data related to that address is provided. The system and method includes a logical address generator that generates a logical address. The system and method includes a subspace index extraction module that extracts a subspace index from the logical address. The system and method includes a subspace configuration table that retrieves a plurality of parameters of the subspace index to locate the desired data.

## Claims

### Claim 1

A system to identify from an address an appropriate target node and a location in that node that holds desired data related to that address, comprising:
a logical address generator that generates a logical address;
a subspace index extraction module that extracts a subspace index from said logical address; and
a subspace configuration table that retrieves a plurality of parameters of said subspace index to locate said desired data.

### Claim 2 (depends on 1)

The system of claim 1, wherein said subspace configuration table comprises information to control a plurality of functions, said functions comprise a plurality of implementations.

### Claim 3 (depends on 2)

The system of claim 2, wherein outputs of said functions are selectively routed to inputs of other said functions.

### Claim 4 (depends on 1)

The system of claim 1, wherein said subspace identifies a subset of all addresses from a logical address space that are mapped into a specific subset of node and local memory addresses.

### Claim 5 (depends on 1)

The system of claim 1, wherein said subspace configuration table is loaded into each node when said system is booted or reconfigured, and is independent of programs running in the memory.

### Claim 6 (depends on 1)

The system of claim 1, wherein said system permits identification of one or more common support subspaces as mapping to specific areas of local memory of each node.

### Claim 7 (depends on 1)

The system of claim 1, wherein said system employs both error checking and access rights checking as a function of the subspace, independent of an application making a request.

### Claim 8 (depends on 7)

The system of claim 7 further comprising an application identification number that is appended to each request that indexes into information associated with each subspace allowing acceptable rights for an application in that subspace.

### Claim 9 (depends on 1)

The system of claim 1 further comprising a special marking module that designates a subspace as a common support subspace, where all addresses are treated as offsets into a local memory region dedicated to the subspace on a current node.

### Claim 10 (depends on 1)

The system of claim 1 further comprising a local address instruction module that produces a valid logical address which accesses relative location on a current node when passed through standard address translation.

### Claim 11 (depends on 3)

The system of claim 3, wherein a set of said functions collectively convert an address presented to them on a first node to an address into a memory on a second node.

### Claim 12 (depends on 11)

The system of claim 11, wherein said set of functions are split such that a first portion of said set of functions are performed on a source node, and a second portion of said set of functions are performed on a target node.

### Claim 13

A method for identifying from an address an appropriate target node and a location in that node that holds desired data related to that address, comprising the steps of:
generating a logical address using a logical address generator;
extracting a subspace index using a subspace index extraction module from said logical address; and
retrieving a plurality of parameters of said subspace index using a subspace configuration table to locate said desired data.

### Claim 14 (depends on 13)

The method of claim 13, wherein said subspace configuration table comprises information to control a plurality of functions, said functions comprise a plurality of implementations.

### Claim 15 (depends on 14)

The method of claim 14, wherein outputs of said functions are selectively routed to inputs of other said functions.

### Claim 16 (depends on 13)

The method of claim 13, wherein said subspace index identifies a subset of all addresses from a logical address space that are mapped into a specific subset of node and local memory addresses.

### Claim 17 (depends on 13)

The method of claim 13, wherein said subspace configuration table is loaded into each node when said system is booted or reconfigured, and is independent of programs that run in the memory.

### Claim 18 (depends on 13)

The method of claim 13 further comprising the step of permitting identifying one or more common support subspaces as mapping to specific areas of local memory of each node.

### Claim 19 (depends on 13)

The method of claim 13 further comprising the step of employing error checking and access rights checking as a function of the subspace, independent of an application making a request.

### Claim 20 (depends on 19)

The method of claim 19 further comprising the step of appending an application identification number to each request that indexes into information associated with each subspace allowing acceptable rights for an application in that subspace.

### Claim 21 (depends on 13)

The method of claim 13 further comprising the step of marking a subspace as a common support subspace using a special marking module, where all addresses are treated as offsets into a local memory region dedicated to the subspace on a current node.

### Claim 22 (depends on 13)

The method of claim 13 further comprising the step of providing a compute local address instruction for producing a valid logical address which accesses relative location on a current node when passed through standard address translation.

### Claim 23 (depends on 14)

The method of claim 14, wherein a set of said functions collectively convert an address presented to them on a first node to an address into a memory on a second node.

### Claim 24 (depends on 23)

The method of claim 23, wherein said set of functions are split such that a first portion of said set of functions are performed on a source node, and a second portion of said set of functions are performed on a target node.

### Claim 25

A system to identify from an address an appropriate target node from a plurality of nodes and a location in that node that holds desired data, comprising:
a plurality of nodes, each node comprising:
a memory that stores the desired data;
a logical address generator that generates a logical address;
a subspace index extraction module that extracts a subspace index from said logical address; and
a subspace configuration table that retrieves a plurality of parameters of said subspace index to locate said desired data in said memory of said node.

### Claim 26 (depends on 25)

The system of claim 25, wherein said system provides a range of protection options for accesses to different regions of the memory.

### Claim 27 (depends on 26)

The system of claim 26, wherein said system allows for mapping between logical to physical addresses for different parts of an address space such that regions of memory are mapped in ways that are optimal for different types of data structures.

### Claim 28 (depends on 27)

The system of claim 27, wherein parts of said address space have local copies of data at each node.

### Claim 29

A method for identifying from an address an appropriate target node from a plurality of nodes and a location in that node that holds desired data, comprising the steps:
providing a plurality of nodes, each node comprising:
a memory for storing the desired data;
generating a logical address using a logical address generator;
extracting a subspace index using a subspace index extraction module from said logical address; and
retrieving a plurality of parameters of said subspace index using a subspace configuration table to locate said desired data in said memory of said node.

### Claim 30 (depends on 29)

The method of claim 29 further comprising providing a range of protection options for accesses to different regions of the memory.

### Claim 31 (depends on 29)

The method of claim 29 further comprising mapping between logical to physical addresses for different parts of an address space such that regions of memory are mapped in ways that are optimal for different types of data structures.

### Claim 32 (depends on 31)

The method of claim 31, wherein parts of said address space have local copies of data at each node.
