# US 2005/0240746 A1 · Process and apparatus for memory mapping

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

- Number: US 2005/0240746 A1
- Document ID: US20050240746A1
- Status: Published application
- Kind: A1
- Application number: 10/830,739
- Filed: 2004-04-25
- Published: 2005-10-27
- Earliest claimed: 2004-04-25
- Assignees: LSI Logic Corporation
- Inventors: Andrey Nikitin; Alexander Andreev; Anatoli Bolotov
- Web page: https://patentgrep.com/patent/US20050240746A1

## CPC

- G06F 12/02: Addressing or allocation; Relocation (program address sequencing G06F9/00; arrangements for selecting an address in a digital store G11C8/00)
- G06F 30/30: Circuit design
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A plurality of user-defined memories are mapped to pre-defined basic memories, such as defined on a base platform. The user-defined memories are dividing into classes of similar memories. A mapping technique is selected for members of a selected class of user-defined memories that minimizes the ratio (maxi,j(USEDi,j/AVAILi,j)) of basic memories that have been mapped to basic memories that are available for mapping. If the number of different memory mappings is smaller than a threshold the mapping technique is applied to each user-defined memory. If the number of different memory mappings is greater than the threshold, the groups are arranged in ordered queues of single memory types based on a mapping price and the mapping technique is selected based on a memory of each group and is applied to each user-defined memory in the respective group.

## Claims

### Claim 1

A process of mapping a plurality of user-defined memories to pre-defined basic memories comprising steps of:
dividing the user-defined memories into classes of similar user-defined memories; and
iteratively
calculating a maximal ratio of basic memories that have been mapped to basic memories that are available for mapping, and
selecting a mapping technique for members of a selected class of user-defined memories that minimizes the ratio.

### Claim 2 (depends on 1)

The process of claim 1, further comprising:
calculating an estimate of the number of different memory mappings necessary to map the user-defined memories to basic memories,
if the number of different memory mappings exceeds a threshold,
calculating a mapping price for each class,
for each memory type, creating a queue of classes arranged in an order based on respective mapping prices, and
the mapping technique is selected for each class of each queue.

### Claim 3 (depends on 2)

The process of claim 2, wherein if the number of different memory mappings does not exceed the threshold, the mapping technique is selected for each user-defined memory of each class.

### Claim 4 (depends on 2)

The process of claim 2, wherein the mapping price is calculated based on the capacity and width of memories the class and the capacity, width and quantity of basic memories.

### Claim 5 (depends on 4)

The process of claim 4, wherein the mapping price is calculated as
priceq,j=1.0−c(CLASSq)*w(CLASSq)/W/Cj/cl—rq,i,
where c(CLASSq) is the capacity of memories of the class, w(CLASSq) is the width of memories of the class, W is the width of the basic memories, Cj is the capacity type of the basic memories and cl_rq,i is the minimum number of basic memories to which the class of memories can be mapped.

### Claim 6 (depends on 2)

The process of claim 2, wherein similar user-defined memories are the same type and have the same capacity.

### Claim 7 (depends on 2)

The process of claim 2, wherein the order of classes of each queue is an ascending order of prices and the mapping techniques are first selected for classes with the smallest price for each queue.

### Claim 8

In a process of designing an application-specific integrated circuit containing a plurality of user-defined memories from a platform containing a plurality of basic memories, each basic memory and each user-defined memory having a type that is a member of a predetermined group of types, each basic memory having a capacity that is a member of a predetermined group of capacities, and each user-defined memory having capacity that may or may not be a member of the group of capacities, the process of mapping the user-defined memories to the basic memories comprising steps of:
dividing the user-defined memories into classes of similar user-defined memories; and
iteratively
calculating a maximal ratio of basic memories that have been mapped to basic memories that are available for mapping, and
selecting a mapping technique for members of a selected class of user-defined memories that minimizes the ratio.

### Claim 9 (depends on 8)

The process of claim 8, further comprising:
calculating an estimate of the number of different memory mappings necessary to map the user-defined memories to basic memories,
if the number of different memory mappings exceeds a threshold,
calculating a mapping price for each class,
for each memory type, creating a queue of classes arranged in an order based on respective mapping prices, and
the mapping technique is selected for classes of each queue.

### Claim 10 (depends on 9)

The process of claim 9, wherein if the number of different memory mappings does not exceed the threshold, the mapping technique is selected for each user-defined memory of each class.

### Claim 11 (depends on 9)

The process of claim 9, wherein the mapping price is calculated based on the capacity and width of memories the class and the capacity, width and quantity of basic memories.

### Claim 12 (depends on 11)

The process of claim 11, wherein the mapping price is calculated as
priceq,j=1.0−c(CLASSq)*w(CLASSq)/W/Cj/cl—rq,i,
where c(CLASSq) is the capacity of memories of the class, w(CLASSq) is the width of memories of the class, W is the width of the basic memories, Cj is the capacity type of the basic memories and cl_rq,i is the minimum number of basic memories to which the class of memories can be mapped.

### Claim 13 (depends on 9)

The process of claim 9, wherein similar user-defined memories are the same type and have the same capacity.

### Claim 14 (depends on 9)

The process of claim 9, wherein the order of classes of each queue is an ascending order of prices and the mapping techniques are first selected for classes with the smallest price for each queue.

### Claim 15

A computer useable medium having a computer readable program embodied therein for addressing data to map a plurality of user-defined memories to pre-defined basic memories, the computer readable program comprising:
computer readable program code for causing the computer to input definitions of the user-defined memories and the basic memories;
computer readable program code for causing the computer to divide the user-defined memories into classes of similar user-defined memories; and
computer readable program code for causing the computer to iteratively calculate a maximal ratio of basic memories that have been mapped to basic memories that are available for mapping while selecting a mapping technique for members of a selected class of user-defined memories that minimizes the ratio.

### Claim 16 (depends on 15)

The computer useable medium of claim 15, wherein the computer readable program further comprises:
computer readable program code for causing the computer to calculate an estimate of the number of different memory mappings necessary to map the user-defined memories to basic memories,
computer readable program code for causing the computer to calculate whether the number of different memory mappings exceeds a threshold,
computer readable program code responsive to the computer determining that the threshold is exceeded for causing the computer to calculate a mapping price for each class, create a queue of classes arranged in an order based on respective mapping prices, and select the mapping technique for each class of each queue.

### Claim 17 (depends on 16)

The computer useable medium of claim 16, wherein the computer readable program further comprises:
computer readable program code responsive to the computer determining that the threshold is not exceeded for causing the computer to select the mapping technique for each user-defined memory of each class.

### Claim 18 (depends on 16)

The computer useable medium of claim 16, wherein computer readable program code that is responsive to the computer determining that the threshold is exceeded causes the computer to calculate the mapping price based on the capacity and width of memories the class and the capacity, width and quantity of basic memories.

### Claim 19 (depends on 16)

The computer useable medium of claim 16, wherein computer readable program code that is responsive to the computer determining that the threshold is exceeded causes the computer to calculate the mapping price as
priceq,j=1.0−c(CLASSq)*w(CLASSq)/W/Cj/cl—rq,i,
where c(CLASSq) is the capacity of memories of the class, w(CLASSq) is the width of memories of the class, W is the width of the basic memories, Cj is the capacity type of the basic memories and cl_rq,i is the minimum number of basic memories to which the class of memories can be mapped.

### Claim 20 (depends on 16)

The computer useable medium of claim 16, wherein computer readable program code that is responsive to the computer determining that the threshold is exceeded causes the computer to order the classes of each queue in an ascending order of prices and select the mapping techniques for classes with the smallest price for each queue first.
