# US 2013/0159681 A1 · Verifying speculative multithreading in an application

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

- Number: US 2013/0159681 A1
- Document ID: US20130159681A1
- Status: Published application
- Kind: A1
- Application number: 13/709,729
- Filed: 2012-12-10
- Published: 2013-06-20
- Earliest claimed: 2011-12-15
- Assignees: International Business Machines Corporation
- Inventors: MITCHELL D. FELTON
- Web page: https://patentgrep.com/patent/US20130159681A1

## CPC

- G06F 9/30: Arrangements for executing machine instructions, e.g. instruction decode (for executing microinstructions G06F9/22)
- G06F 9/3001: {Arithmetic instructions}
- G06F 9/30014: {with variable precision}
- G06F 9/30087: {Synchronisation or serialisation instructions}
- G06F 9/3842: {Speculative instruction execution}
- G06F 9/3851: {from multiple instruction streams, e.g. multistreaming}
- G06F 11/3624: {by performing operations on the source code, e.g. via a compiler}
- G06F 11/3632: {of specific synchronisation aspects}
- G06F 11/3648: {using additional hardware}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Verifying speculative multithreading in an application executing in a computing system, including: executing one or more test instructions serially thereby producing a serial result, including insuring that all data dependencies among the test instructions are satisfied; executing the test instructions speculatively in a plurality of threads thereby producing a speculative result; and determining whether a speculative multithreading error exists including: comparing the serial result to the speculative result and, if the serial result does not match the speculative result, determining that a speculative multithreading error exists.

## Claims

### Claim 1

A method of verifying speculative multithreading in an application executing in a computing system, the method comprising:
executing one or more test instructions serially thereby producing a serial result, including insuring that all data dependencies among the test instructions are satisfied;
executing the test instructions speculatively in a plurality of threads thereby producing a speculative result; and
determining whether a speculative multithreading error exists including:
comparing the serial result to the speculative result and, if the serial result does not match the speculative result, determining that a speculative multithreading error exists.

### Claim 2 (depends on 1)

The method of claim 1 further comprising:
responsive to the determination that a speculative multithreading error exists, modifying a portion of source code of the application that, when executed, administers speculative multithreading for the application.

### Claim 3 (depends on 1)

The method of claim 1 wherein the test instructions further comprise a floating point operation.

### Claim 4 (depends on 3)

The method of claim 3 wherein the test instructions further comprise sums of floating point values.

### Claim 5 (depends on 1)

The method of claim 1 wherein the test instructions include one of:
an arithmetic operation;
a logic operation; and
an atomic fetch operation.

### Claim 6 (depends on 1)

The method of claim 1, wherein the computing system comprises a parallel computer, the parallel computer comprising a plurality of compute nodes coupled for data communications by one or more data communications networks, each compute node configured to support speculative multithreading.

### Claim at position 7

7-20. (canceled)
