# US 2021/0333998 A1 · Information processing apparatus, information processing method and computer readable medium

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

- Number: US 2021/0333998 A1
- Document ID: US20210333998A1
- Status: Published application
- Kind: A1
- Application number: 17/366,342
- Filed: 2021-07-02
- Published: 2021-10-28
- Earliest claimed: 2019-02-26
- Assignees: Mitsubishi Electric Corporation
- Applicants: Mitsubishi Electric Corporation
- Inventors: Kenzo YAMAMOTO
- Web page: https://patentgrep.com/patent/US20210333998A1

## CPC

- G06F 3/064: {Management of blocks}
- G06F 3/0604: {Improving or facilitating administration, e.g. storage management}
- G06F 3/061: {Improving I/O performance}
- G06F 3/0659: {Command handling arrangements, e.g. command buffers, queues, command scheduling}
- G06F 3/0673: {Single storage device}
- G06F 8/45: {Exploiting coarse grain parallelism in compilation, i.e. parallelism between groups of instructions}
- G06F 9/466: {Transaction processing}
- G06F 8/314: {Parallel programming languages (G06F8/313 takes precedence)}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A task graph debranching section (109) determines as a parallelizable number, the number of parallelization of processes which is possible at a time of executing a program. A schedule generation section (112) generates as a parallelization execution schedule, an execution schedule of the program at the time of executing the program. A display processing section (114) computes a parallelization execution time which is a time required for executing the program at a time of executing the program according to the parallelization execution schedule. Further, the display processing section (114) generates parallelization information indicating the parallelizable number, the parallelization execution schedule, and the parallelization execution time, and outputs the generated parallelization information.

## Claims

### Claim 1

An information processing apparatus comprising:
processing circuitry
to determine as a parallelizable number, the number of parallelization of processes which is possible at a time of executing a program constituted of a plurality of blocks,
to generate as a parallelization execution schedule, an execution schedule of the program at the time of executing the program;
to compute a parallelization execution time which is a time required for executing the program at a time of executing the program according to the parallelization execution schedule; and
to generate parallelization information indicating the parallelizable number, the parallelization execution schedule, the parallelization execution time, the number of common variables which is the number of variables used in common in two or more blocks among the plurality of blocks, and a memory usage amount at the time of executing the program, and output the generated parallelization information.

### Claim 2 (depends on 1)

The information processing apparatus according to claim 1,
wherein the processing circuitry generates based on a dependence relation between blocks among the plurality of blocks which constitute the program, a task graph of the plurality of blocks, and determines the parallelizable number by analyzing the task graph.

### Claim 3 (depends on 2)

The information processing apparatus according to claim 2,
wherein the processing circuitry performs debranching of the task graph and determines the parallelizable number according to the maximum number of connections among the numbers of connections between the blocks in a task graph after the debranching.

### Claim 4 (depends on 3)

The information processing apparatus according to claim 3,
wherein the processing circuitry generates the parallelization information indicating the task graph after the debranching.

### Claim 5 (depends on 1)

The information processing apparatus according to claim 1,
wherein the processing circuitry generates the parallelization information indicating a required value for the parallelization execution time.

### Claim 6 (depends on 5)

The information processing apparatus according to claim 5,
wherein the processing circuitry generates the parallelization information indicating whether or not the parallelization execution time satisfies the required value.

### Claim 7 (depends on 1)

The information processing apparatus according to claim 1,
wherein the processing circuitry generates the parallelization information indicating whether or not the number of common variables satisfies a required value for the number of common variables, and indicating whether or not the memory usage amount satisfies a required value for the memory usage amount.

### Claim 8 (depends on 1)

The information processing apparatus according to claim 1,
wherein the processing circuitry
generates the parallelization execution schedule for each number of CPU (Central Processing Unit) cores which is the number of CPU cores which execute the program,
computes for each number of CPU cores, a parallelization execution time at a time of executing the program according to a corresponding parallelization execution schedule, and
generates for the number of CPU cores, the parallelization information indicating the parallelization execution schedule and the parallelization execution time.

### Claim 9 (depends on 1)

The information processing apparatus according to claim 1,
wherein the processing circuitry generates the parallelization information indicating a plurality of required values for the parallelization execution time and indicating whether or not the parallelization execution time satisfies each of the required values.

### Claim 10 (depends on 1)

The information processing apparatus according to claim 1,
wherein the processing circuitry generates the parallelization information indicating a plurality of required values for the number of common variables, indicating a plurality of required values for a memory usage amount at the time of executing the program, and indicating whether or not the number of common variables satisfies each of the required values, and whether or not the memory usage amount satisfies each of the required values.

### Claim 11 (depends on 1)

The information processing apparatus according to claim 1,
wherein the processing circuitry
computes a non-parallelization execution time which is a time required for executing the program at a time of executing the program without parallelizing the processes, and
generates the parallelization information indicating a state of difference between the parallelization execution time and the non-parallelization execution time.

### Claim 12

An information processing method comprising:
determining as a parallelizable number, the number of parallelization of processes which is possible at a time of executing a program constituted of a plurality of blocks,
generating as a parallelization execution schedule, an execution schedule of the program at the time of executing the program;
computing a parallelization execution time which is a time required for executing the program at a time of executing the program according to the parallelization execution schedule; and
generating parallelization information indicating the parallelizable number, the parallelization execution schedule, the parallelization execution time, the number of common variables which is the number of variables used in common in two or more blocks among the plurality of blocks, and a memory usage amount at the time of executing the program, and outputting the generated parallelization information.

### Claim 13

A non-transitory computer readable medium storing an information processing program which causes a computer to execute:
a determination process of determining as a parallelizable number, the number of parallelization of processes which is possible at a time of executing a program constituted of a plurality of blocks,
a schedule generation process of generating as a parallelization execution schedule, an execution schedule of the program at the time of executing the program;
a computation process of computing a parallelization execution time which is a time required for executing the program at a time of executing the program according to the parallelization execution schedule; and
an information generation process of generating parallelization information indicating the parallelizable number, the parallelization execution schedule, the parallelization execution time, the number of common variables which is the number of variables used in common in two or more blocks among the plurality of blocks, and a memory usage amount at the time of executing the program, and outputting the generated parallelization information.
