# US 2016/0259670 A1 · Computer readable medium, mapping information generating method, and mapping information generating apparatus

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

- Number: US 2016/0259670 A1
- Document ID: US20160259670A1
- Status: Published application
- Kind: A1
- Application number: 14/989,563
- Filed: 2016-01-06
- Published: 2016-09-08
- Earliest claimed: 2015-03-05
- Assignees: Fujitsu Limited
- Applicants: Fujitsu Limited
- Inventors: Yusuke Oishi
- Web page: https://patentgrep.com/patent/US20160259670A1

## CPC

- G06F 9/5027: {the resource being a machine, e.g. CPUs, Servers, Terminals}
- G06F 9/5066: {Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs (mappping at compile time, see G06F8/451)}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Provided is a non-transitory computer readable medium storing a mapping information generation program that causes a computer to execute a process, the process including: placing a plurality of processes in a space generated by a computer; changing positions of the plurality of processes by applying at least one of an attracting force and a repulsive force between each two processes included in the plurality of processes; and generating information that maps the plurality of processes to a plurality of processors based on changed positions of the plurality of processes and positions of the plurality of processors.

## Claims

### Claim 1

A non-transitory computer readable medium storing a mapping information generation program that causes a computer to execute a process, the process comprising:
placing a plurality of processes in a space generated by a computer;
changing positions of the plurality of processes by applying at least one of an attracting force and a repulsive force between each two processes included in the plurality of processes; and
generating information that maps the plurality of processes to a plurality of processors based on changed positions of the plurality of processes and positions of the plurality of processors.

### Claim 2 (depends on 1)

The non-transitory computer readable medium according to claim 1, wherein
the changing includes changing the positions of the plurality of processes by applying an attracting force corresponding to communication traffic between the each two processes between the each two processes.

### Claim 3 (depends on 1)

The non-transitory computer readable medium according to claim 1, wherein
the changing includes changing the positions of the plurality of processes by further applying a repulsive force corresponding to a distance between processes included in the plurality of processes between the processes when the distance between the processes is greater than a reference value.

### Claim 4 (depends on 2)

The non-transitory computer readable medium according to claim 2, wherein
the changing includes calculating the communication traffic based on information on a communication amount and a number of communication between the each two processes.

### Claim 5 (depends on 1)

The non-transitory computer readable medium according to claim 1, wherein
the changing includes changing the positions of the processes by further applying a repulsive force corresponding to a distance between processes between the processes when the distance between the processes is less than a reference value.

### Claim 6 (depends on 1)

The non-transitory computer readable medium according to claim 1, wherein
the process further comprises, before the changing:
dividing the plurality of processes into a plurality of groups based on communication frequency between the each two processes; and
placing processes included in each group in an area corresponding to the group.

### Claim 7 (depends on 1)

The non-transitory computer readable medium according to claim 1, wherein
the generating includes determining a processor to which each process is assigned among the plurality of processors based on a distance between the each process included in the plurality of processes of which the positions are changed and each processor included in the plurality of processors.

### Claim 8

A mapping information generating method implemented by a computer, the mapping information generating method comprising:
placing a plurality of processes in a space generated by a computer;
changing positions of the plurality of processes by applying at least one of an attracting force and a repulsive force between each two processes included in the plurality of processes; and
generating information that maps the plurality of processes to a plurality of processors based on changed positions of the plurality of processes and positions of the plurality of processors.

### Claim 9

A mapping information generating apparatus comprising:
a processor that executes a process including:
placing a plurality of processes in a space generated by a computer;
changing positions of the plurality of processes by applying at least one of an attracting force and a repulsive force between each two processes included in the plurality of processes in the space; and
generating information that maps the plurality of processes to a plurality of processors based on changed positions of the plurality of processes and positions of the plurality of processors.

### Claim 10 (depends on 9)

The mapping information generating apparatus according to claim 9, wherein
the changing includes changing the positions of the plurality of processes by applying an attracting force corresponding to communication traffic between the each two processes between the each two processes.

### Claim 11 (depends on 9)

The mapping information generating apparatus according to claim 9, wherein
the changing includes changing the positions of the plurality of processes by further applying a repulsive force corresponding to a distance between processes included in the plurality of processes between the processes when the distance between the processes is greater than a reference value.

### Claim 12 (depends on 10)

The mapping information generating apparatus according to claim 10, wherein
the changing includes calculating the communication traffic based on information on a communication amount and a number of communication between the each two processes.

### Claim 13 (depends on 9)

The mapping information generating apparatus according to claim 9, wherein
the changing includes changing the positions of the processes by further applying a repulsive force corresponding to a distance between processes between the processes when the distance between the processes is less than a reference value.

### Claim 14 (depends on 9)

The mapping information generating apparatus according to claim 9, wherein
the process further includes, before the changing:
dividing the plurality of processes into a plurality of groups based on communication frequency between the each two processes; and
placing processes included in each group in an area corresponding to the group.

### Claim 15 (depends on 9)

The mapping information generating apparatus according to claim 9, wherein
the generating includes determining a processor to which each process is assigned among the plurality of processors based on a distance between the each process included in the plurality of processes of which the positions are changed and each processor included in the plurality of processors.

### Claim 16

A mapping information generating method implemented by a computer, the mapping information generating method comprising:
placing a plurality of processes in a space generated by a computer;
changing positions of the plurality of processes by applying at least one of an attracting force and a repulsive force between each two processes included in the plurality of processes;
generating information that maps the plurality of processes to a plurality of processors based on changed positions of the plurality of processes and positions of the plurality of processors; and
displaying a history of how the positions of the plurality of processes are changed.
