# US 2006/0053416 A1 · Program section layout method and layout program

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

- Number: US 2006/0053416 A1
- Document ID: US20060053416A1
- Status: Published application
- Kind: A1
- Application number: 11/019,195
- Filed: 2004-12-23
- Published: 2006-03-09
- Earliest claimed: 2004-09-09
- Assignees: Fujitsu Limited
- Inventors: Manabu Watanabe
- Web page: https://patentgrep.com/patent/US20060053416A1

## CPC

- G06F 9/44557: {Code layout in executable memory}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A program section layout method capable of improving space efficiency of a cache memory. A grouping unit groups program sections into section groups so that the total size of the program sections composing each section group does not exceed cache memory size. A layout optimization unit optimizes the layout of section group storage regions by combining each section group and a program section that does not belong to any section groups or by combining section groups while keeping the ordering relations of the program sections composing each section group.

## Claims

### Claim 1

A program section layout method of a computer running a program while storing program sections in a cache memory, the program section layout method comprising:
grouping with grouping units the program sections with ordering rules specified by a prescribed algorithm so that a total size of program sections composing each of section groups does not exceed cache memory size, the program sections each being an executable unit of processing functions, the section groups created by the grouping; and
optimizing with layout optimization units layout of section group storage regions of the cache memory size by combining each of the section groups and a program section that does not belong to any section groups or by combining section groups while keeping ordering relations of the program sections composing each of the section groups.

### Claim 2 (depends on 1)

The program section layout method according to claim 1, wherein, in a procedure to combine each of the section groups and a program section that does not belong to any section groups, a program section that does not belong to any section groups is rearranged in a free space of a section group storage region for a section group when a size of the program section is smaller than a size of the free space calculated by subtracting a total size of program sections composing the section group from the cache memory size of the section group storage region.

### Claim 3 (depends on 2)

The program section layout method according to claim 2, wherein, rearrangement of a program section in a free space of a section group storage region is repeated until a total size of a storage region becomes smaller than a prescribed size, the storage region being used for storing the program sections and including free spaces of section group storage regions after the grouping.

### Claim 4 (depends on 2)

The program section layout method according to claim 2, wherein, rearrangement of a program section in a free space of a section group storage region is repeated until an expansion rate becomes smaller than a prescribed rate, the expansion rate indicating a rate of a total size of a storage region to a total size of the program sections before the grouping, the storage region being used for storing the program sections and including free spaces of section group storage regions after the grouping.

### Claim 5 (depends on 2)

The program section layout method according to claim 2, wherein, rearrangement of a program section in a free space of a section group storage region starts in order from a program section arranged in a last out of program sections that do not belong to any section groups.

### Claim 6 (depends on 1)

The program section layout method according to claim 1, wherein, in a procedure to combine section groups, the section groups are classified into odd-numbered groups and even-numbered groups according to an arrangement order, and an order of program sections of each of the odd-numbered groups or the even-numbered groups is reversed.

### Claim 7

A layout program causing a computer running a program while storing program sections in a cache memory to execute a layout process, the layout program comprising:
grouping the program sections with ordering rules specified by a prescribed algorithm so that a total size of program sections composing each of section groups does not exceed cache memory size, the program sections each being an executable unit of processing functions, the section groups created by the grouping; and
optimizing layout of section group storage regions of the cache memory size by combining each of the section groups and a program section that does not belong to any section groups or by combining section groups while keeping ordering relations of the program sections composing each of the section groups.

### Claim 8 (depends on 7)

The layout program according to claim 7, causing the computer to execute, in a procedure to combine each of the section groups and a program section that does not belong to any section groups, rearranging a program section that does not belong to any section groups in a free space of a section group storage region for a section group when a size of the program section is smaller than a size of the free space calculated by subtracting a total size of program sections composing the section group from the cache memory size of the section group storage region.

### Claim 9 (depends on 7)

The layout program according to claim 7, causing the computer to execute, in a procedure to combine section groups, classifying the section groups into odd-numbered groups and even-numbered groups according to an arrangement order, and reversing an order of program sections of each of the odd-numbered groups or the even-numbered groups.

### Claim 10

A computer-readable recording medium storing a layout program causing a computer running a program while storing program sections in a cache memory to execute a layout process, the layout program comprising:
grouping the program sections with ordering rules specified by a prescribed algorithm so that a total size of program sections composing each of section groups does not exceed cache memory size, the program sections each being an executable unit of processing functions, the section groups created by the grouping; and
optimizing layout of section group storage regions of the cache memory size by combining each of the section groups and a program section that does not belong to any section groups or by combining section groups while keeping ordering relations of the program sections composing each of the section groups.
