# US 2012/0253732 A1 · Method and system for implementing parallel execution in a computing system and in a circuit simulator

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

- Number: US 2012/0253732 A1
- Document ID: US20120253732A1
- Status: Published application
- Kind: A1
- Application number: 13/525,179
- Filed: 2012-06-15
- Published: 2012-10-04
- Earliest claimed: 2002-12-17
- Assignees: Cadence Design Systems, Inc.
- Inventors: Kenneth S. Kundert
- Web page: https://patentgrep.com/patent/US20120253732A1

## CPC

- G06F 13/105: {where the program performs an input/output emulation function}
- G01R 31/318357: {Simulation (computer simulation of digital circuits G06F30/3308)}
- G01R 31/318364: {as a result of hardware simulation, e.g. in an HDL environment (computer-aided simulation of circuits G06F30/3308)}
- G06F 30/20: Design optimisation, verification or simulation (optimisation, verification or simulation of circuit designs G06F30/30)
- G06F 30/33: Design verification, e.g. functional simulation or model checking
- G06F 30/3308: using simulation
- G06F 30/367: Design verification, e.g. using simulation, simulation program with integrated circuit emphasis [SPICE], direct methods or relaxation methods
- G06F 11/261: {by simulating additional hardware, e.g. fault simulation}
- G06F 30/00: Computer-aided design [CAD]
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G01R: MEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES (indicating correct tuning of resonant circuits H03J3/12)

## Abstract

A method and mechanism for implementing a general purpose scripting language that supports parallel execution is described. In one approach, parallel execution is provided in a seamless and high-level approach rather than requiring or expecting a user to have low-level programming expertise with parallel processing languages/functions. Also described is a system and method for performing circuit simulation. The present approach provides methods and systems that create reusable and independent measurements for use with circuit simulators. Also disclosed are parallelizable measurements having looping constructs that can be run without interference between parallel iterations. Reusability is enhanced by having parameterized measurements. Revisions and history of the operating parameters of circuit designs subject to simulation are tracked.

## Claims

### Claim 1

A computer implemented method for executing a measurement in parallel, comprising:
using at least one processor to perform a process, the process comprising:
receiving a statement to run measurement;
determining whether multiple measurements are to be executed;
identifying whether one or more conditions are specified;
determining whether one or more previous values are to be used;
executing a measurement by using a loop processing to generate results, wherein the act of executing the measurement by using the loop processing comprises:
associating the measurement with a dataset that is stored independently to maintain independence of measurements based at least in part upon the one or more conditions or the one or more previous values; and
performing independent parallel iterations of activities for the loop processing to simulate or emulate one or more activities of an electronic circuit over a range of parameter values without using serial looping constructs, wherein
either an access to an index variable for the loop processing is removed, or the loop processing is performed without defining the index variable so the loop processing is performed without reference to the index variable during the loop processing.

### Claim 2 (depends on 1)

The computer implemented method of claim 1, in which parallel executions are independent from each other.

### Claim 3 (depends on 1)

The computer implemented method of claim 1, in which the process is executed using a scripting language.

### Claim 4 (depends on 1)

The computer implemented method of claim 1, in which multiple measurements are run in parallel.

### Claim 5 (depends on 1)

The computer implemented method of claim 1, the process further comprising determining whether to execute a single measurement in parallel iterative blocks.

### Claim 6

A system for executing a measurement in parallel, comprising:
at least one processor that is to:
receive a statement to run measurements;
determine whether multiple measurements are to be executed;
identify whether one or more conditions are specified;
determine whether one or more previous values are to be used;
execute a measurement by using a loop processing to generate results, wherein the at least one processor that is to execute the measurement by using the loop processing is further to:
associate the measurement with a dataset that is stored independently to maintain independence of measurements based at least in part upon the one or more conditions or the one or more previous values; and
perform independent parallel iterations of activities for the loop processing to simulate or emulate one or more activities of an electronic circuit over a range of parameter values without using serial looping constructs, wherein
either an access to an index variable for the loop processing is removed, or the loop processing is performed without defining the index variable so the loop processing is performed without reference to the index variable during the loop processing.

### Claim 7 (depends on 6)

The system of claim 6, in which parallel executions are independent from each other.

### Claim 8 (depends on 6)

The system of claim 6, in which the at least one processor is to execute the one or more measurements using a scripting language.

### Claim 9 (depends on 6)

The system of claim 6, in which multiple measurements are run in parallel.

### Claim 10 (depends on 6)

The system of claim 6, the at least one processor is further to determine whether to execute a single measurement in parallel iterative blocks.

### Claim 11

A computer program product comprising a non-transitory computer usable medium having executable code to execute a process for executing a measurement in parallel, the process comprising:
receiving a statement to run measurements;
determining whether multiple measurements are to be executed;
identifying whether one or more conditions are specified;
determining whether one or more previous values are to be used;
executing a measurement by using a loop processing to generate results, wherein the act of executing the measurement by using the loop processing comprises:
associating the measurement with a dataset that is stored independently to maintain independence of measurements based at least in part upon the one or more conditions or the one or more previous values; and
performing independent parallel iterations of activities for the loop processing to simulate or emulate one or more activities of an electronic circuit over a range of parameter values without using serial looping constructs, wherein
either an access to an index variable for the loop processing is removed, or the loop processing is performed without defining the index variable so the loop processing is performed without reference to the index variable during the loop processing.

### Claim 12 (depends on 11)

The computer program product of claim 11, in which parallel executions are independent from each other.

### Claim 13 (depends on 11)

The computer program product of claim 11, in which the process is executed using a scripting language.

### Claim 14 (depends on 11)

The computer program product of claim 11, in which multiple measurements are run in parallel.

### Claim 15 (depends on 11)

The computer program product of claim 11, the process further comprising determining whether to execute a single measurement in parallel iterative blocks.

### Claim 16 (depends on 1)

The computer implemented method of claim 1, in which the loop processing uses an iterative looping construct to capture all variables declared outside the loop processing and assigned within the loop.

### Claim 17 (depends on 16)

The computer implemented method of claim 16, in which a vector captured by the loop processing is resized to include a same number of elements as multiple iterates in the loop processing.

### Claim 18 (depends on 1)

The computer implemented method of claim 1, the process further comprising:
using a sweeping process to sweep over a range of parameter values for the loop processing without referencing the index variable during the loop processing.

### Claim 19 (depends on 1)

The computer implemented method of claim 1, in which an array captured by the loop processing comprises one lower dimension within the loop processing than outside the loop processing.

### Claim 20 (depends on 1)

The computer implemented method of claim 1, the process further comprising:
re-dimensioning one or more arrays associated with the loop processing, the act of re-dimensioning the one or more arrays further comprising:
adding a dimension to at least one of the one or more arrays by combining the at least one of the one or more arrays and another array of the one or more arrays.

### Claim 21 (depends on 6)

The system of claim 6, in which the loop processing is to use an iterative looping construct to capture all variables declared outside the loop processing and assigned within the loop.

### Claim 22 (depends on 21)

The system of claim 21, in which a vector captured by the loop processing is resized to include a same number of elements as multiple iterates in the loop processing.

### Claim 23 (depends on 6)

The system of claim 6, the at least one processor is further to:
use a sweeping process to sweep over a range of parameter values for the loop processing without referencing the index variable during the loop processing.

### Claim 24 (depends on 6)

The system of claim 6, in which an array captured by the loop processing comprises one lower dimension within the loop processing than outside the loop processing.

### Claim 25 (depends on 5)

The system of claim 5, the at least one processor is further to:
re-dimension one or more arrays associated with the loop processing, in which the at least one processor that is to re-dimension the one or more arrays is further to:
add a dimension to at least one of the one or more arrays by combining the at least one of the one or more arrays and another array of the one or more arrays.

### Claim 26 (depends on 11)

The computer program product of claim 11, in which the loop processing uses an iterative looping construct to capture all variables declared outside the loop processing and assigned within the loop.

### Claim 27 (depends on 26)

The computer program product of claim 26, in which a vector captured by the loop processing is resized to include a same number of elements as multiple iterates in the loop processing.

### Claim 28 (depends on 11)

The computer program product of claim 11, the process further comprising:
using a sweeping process to sweep over a range of parameter values for the loop processing without referencing the index variable during the loop processing.

### Claim 29 (depends on 1)

The computer program product of claim 1, in which an array captured by the loop processing comprises one lower dimension within the loop processing than outside the loop processing.

### Claim 30 (depends on 11)

The computer program product of claim 11, the process further comprising:
re-dimensioning one or more arrays associated with the loop processing, the act of re-dimensioning the one or more arrays further comprising:
adding a dimension to at least one of the one or more arrays by combining the at least one of the one or more arrays and another array of the one or more arrays.
