# US 2013/0232471 A1 · Method and Apparatus for Assessing Software Parallelization

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

- Number: US 2013/0232471 A1
- Document ID: US20130232471A1
- Status: Published application
- Kind: A1
- Application number: 13/884,994
- Filed: 2011-10-27
- Published: 2013-09-05
- Earliest claimed: 2010-11-11
- Inventors: Thomas Henties; Tobias Schüle
- Web page: https://patentgrep.com/patent/US20130232471A1

## CPC

- G06F 8/45: {Exploiting coarse grain parallelism in compilation, i.e. parallelism between groups of instructions}
- G06Q 10/0639: Performance analysis of employees; Performance analysis of enterprise or organisation operations
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

A method for assessing software parallelization may include the steps of analyzing the structure of a software code, splitting the software code into a multiplicity of code portions based on the structure of the software code, ascertaining a complexity value based on the analysis of the structure of the software code for each of the multiplicity of code portions, ascertaining an effort value based on the complexity value for each of the code portions, wherein the effort value indicates the effort required for parallelizing the code potion, and ascertaining an efficiency value for each of the multiplicity of code portions, wherein the efficiency value assesses the efficiency of parallelization of each of the multiplicity of code portions based on a ratio between the ascertained effort value and a useful value which indicates the expected performance gain as a result of the parallelization of the respective code portion.

## Claims

### Claim 1

A method for assessing software parallelization, the method performed by executing instructions stored in non-transitory computer-readable media using a processor and comprising the steps of:
analyzing a structure of a software code;
subdividing the software code into a plurality of code portions based on the structure of the software code;
determining a complexity value based on the analysis of the structure of the software code for each of the plurality of code portions;
determining an effort value based on the complexity value for each of the code portions, the effort value for each code portion indicating an effort required to parallelize that code portion; and
determining an efficiency value for each of the plurality of code portions, the efficiency value for each code portion rating the efficiency of a parallelization of that code portion based on a ratio between the determined effort value that code portion and a useful value indicating an expected performance gain resulting from the parallelization of that code portion.

### Claim 2 (depends on 1)

The method of claim 1, wherein the complexity value comprises a count of the lines of code.

### Claim at position 3

3-5. (canceled)

### Claim 6 (depends on 1)

The method of claim 1, wherein the complexity value comprises a cyclomatic complexity value.

### Claim 7 (depends on 1)

The method of claim 1, wherein the complexity value comprises a function point analysis value.

### Claim 8 (depends on 1)

The method of claim 1, wherein the useful value for each code portion is dependent on a time saving associated with a parallel execution of the respective code portion.

### Claim 9 (depends on 1)

The method of claim 1, wherein the useful value for each code portion is dependent on a reduction in latency time associated with a parallel execution of the respective code portion.

### Claim 10 (depends on 1)

The method of claim 1, wherein the useful value for each code portion is dependent on a data throughput associated with a parallel execution of the respective code portion.

### Claim 11 (depends on 1)

The method of claim 1, wherein the useful value is provided by a profiler.

### Claim 12

An apparatus for assessing software parallelization comprising:
an analysis device configured to:
analyze a structure of a software code, and
subdivide the software code into a plurality of code portions based on the structure of the software code;
a calculation device configured to:
determine a complexity value based on the structure of the software code for each of the plurality of code portions, and
determine an effort value for each code portion based on the complexity value for that code portion, the effort value for each code portion indicating an effort required in order to parallelize that code portion; and
an assessment device configured to output an efficiency value for each of the plurality of code portions, the efficiency value for each code portion rating the efficiency of a parallelization of that code portion based on a ratio between the determined effort value for each code portion and a useful value indicating an expected performance gain resulting from the parallelization of that code portion,
wherein each of the analysis device, the calculation device, and the assessment device comprises a processor configured to execute instructions stored in non-transitory computer-readable media to perform the respective functions of each respective device.

### Claim 13 (depends on 12)

The apparatus of claim 12, wherein the complexity value comprises a count of the lines of code.

### Claim 14 (depends on 12)

The apparatus of claim 12, wherein the complexity value comprises a cyclomatic complexity value.

### Claim 15 (depends on 12)

The apparatus of claim 12, wherein the complexity value comprises a function point analysis value.

### Claim 16 (depends on 12)

The apparatus of claim 12, wherein the useful value for each code portion is dependent on a time saving associated with a parallel execution of the respective code portion.

### Claim 17 (depends on 12)

The apparatus of claim 12, wherein the useful value for each code portion is dependent on a reduction in latency time associated with a parallel execution of the respective code portion.

### Claim 18 (depends on 12)

The apparatus of claim 12, wherein the useful value for each code portion is dependent on a data throughput associated with a parallel execution of the respective code portion.

### Claim 19 (depends on 12)

The apparatus of claim 12, wherein the useful value is provided by a profiler.
