# US 2017/0255716 A1 · Event-driven design simulation

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

- Number: US 2017/0255716 A1
- Document ID: US20170255716A1
- Status: Published application
- Kind: A1
- Application number: 15/400,011
- Filed: 2017-01-06
- Published: 2017-09-07
- Earliest claimed: 2016-03-04
- Assignees: Montana Systems Inc.
- Applicants: Montana Systems Inc.
- Inventors: VIVIAN CHOU; JULIEN LAMOUREUX; SHERMAN LEE
- Web page: https://patentgrep.com/patent/US20170255716A1

## CPC

- G06F 9/3001: {Arithmetic instructions}
- G06F 9/30029: {Logical and Boolean instructions, e.g. XOR, NOT}
- G06F 9/30043: {LOAD or STORE instructions; Clear instruction}
- G06F 9/3005: {to perform operations for flow control}
- G06F 9/30145: {Instruction analysis, e.g. decoding, instruction word fields}
- G06F 9/3802: {Instruction prefetching}
- G06F 9/3838: {Dependency mechanisms, e.g. register scoreboarding}
- G06F 9/3851: {from multiple instruction streams, e.g. multistreaming}
- G06F 9/3885: {using a plurality of independent parallel functional units}
- G06F 12/023: {Free address space management}
- G06F 30/33: Design verification, e.g. functional simulation or model checking
- G06F 30/3308: using simulation
- G06F 30/331: with hardware acceleration, e.g. by using field programmable gate array [FPGA] or emulation
- G06F 30/367: Design verification, e.g. using simulation, simulation program with integrated circuit emphasis [SPICE], direct methods or relaxation methods
- G06F 30/39: Circuit design at the physical level (physical level design for reconfigurable circuits G06F30/347)
- G06F 2212/251: Local memory within processor subsystem
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A simulation system that includes a simulation accelerator that uses parallel processing to accelerate the simulation of register transfer level codes (RTLs) while minimizing memory access latency is disclosed. The accelerator has an array of parallel computing resources. The simulation accelerator receives compiled RTLs in which the components of the design are mapped to instructions. The instructions are divided into groups, in which instructions belonging to a same group are logically independent of each other. The simulation accelerator fetches instructions and data for processing by the parallel computing resources for one group of instructions at a time.

## Claims

### Claim 1

A method comprising:
receiving a specification of a digital circuit, the specification comprising a plurality of instructions that are divided into a plurality of groups of instructions, wherein each instruction belonging to a group of instructions is logically and temporally independent of any other instruction belonging to the group;
maintaining a pending events table, each bit of the pending events table indicating absence or presence of a pending event at an input of an instruction in the plurality of instructions;
selecting a group of instructions having pending input events by examining the pending events table;
executing the selected group of instructions to produce outputs to serve as inputs for destination instructions in other groups; and
updating the pending events table by clearing bits in the pending events table that correspond to inputs of the selected group and setting bits in the pending events table that correspond to inputs of destination instructions.

### Claim 2 (depends on 1)

The method of claim 1, wherein the bits indicating absence or presence of pending events at the inputs of the instructions of the selected group are located in a same word of the pending events table.

### Claim 3 (depends on 1)

The method of claim 1, wherein executing the instruction further comprises identifying a destination instructions in another group of instructions that receives a fan-out of the particular instruction and setting pending input event for the destination instruction in the pending events table.

### Claim 4 (depends on 1)

The method of claim 1, wherein the pending events table contains groups of instructions that are scheduled to execute in a current time step but not instructions that are scheduled to execute in other time steps.

### Claim 5 (depends on 1)

The method of claim 1 further comprising advancing a simulation time to a next time step when all bits of the pending events table are cleared and

### Claim 6 (depends on 5)

The method of claim 5 further comprising populating the pending events table with contents of a time wheel storage for the next time step.

### Claim 7 (depends on 1)

The method of claim 1 further comprising maintaining a time wheel storage for storing pending events at inputs of instructions scheduled to execute in a future time step after the current time step.

### Claim 8 (depends on 7)

The method of claim 7 further comprising storing a pending input event into the time wheel storage when a destination instruction is scheduled to execute in a future time step.

### Claim 9

An integrated circuit (IC) comprising:
an instruction memory storing a plurality of instructions that are sorted into a plurality of groups, wherein each instruction belonging to a group of instructions is logically and temporally independent of any other instruction belonging to the group;
an event manager circuit configured to (i) maintain a pending events table, each bit of the pending events table indicating absence or presence of a pending event at an input of an instruction in the plurality of instructions, (ii) select a group of instructions by identifying an instruction having a pending input event in the pending events table, and (iii) update the pending events table by clearing bits in the pending events table that correspond to inputs of the selected group and setting bits in the pending events table that correspond to inputs of destination instructions; and
a set of processing units configured to execute the selected group of instructions to produce outputs to serve as inputs for the destination instructions.

### Claim 10 (depends on 9)

The IC of claim 9, wherein the bits indicating absence or presence of pending events at the inputs of the instructions of the selected group are located in a same word of the pending events table.

### Claim 11 (depends on 9)

The IC of claim 9, wherein the pending events table contains groups of instructions that are scheduled to execute in a current time step but not instructions that are scheduled to execute in other time steps.

### Claim 12 (depends on 9)

The IC of claim 9, wherein a simulation time is advanced to a next time step when all bits of the pending events table are cleared, wherein the event manger circuit populates the pending events table with contents of a time wheel storage for the next time step when all bits of the pending events table are cleared.

### Claim 13 (depends on 9)

The IC of claim 9, wherein the event manager circuit is further configured to maintain a time wheel storage for storing pending events at inputs of instructions scheduled to execute in a future time step after the current time step.

### Claim 14 (depends on 13)

The IC of claim 13, wherein the event manager circuit is further configured to storing a pending input event into the time wheel storage when a destination instruction is scheduled to execute in a future time step.

### Claim 15

A simulation system comprising:
a simulation processor configured to execute a set of compiled models to generate stimulus for testing a design of a digital circuit; and
a simulation accelerator configured to perform acts comprising:
receiving a plurality of instructions emulating the behavior of the digital circuit by applying the generated stimulus, wherein the plurality of instructions are sorted into a plurality of groups of instructions, wherein each instruction belonging to a group of instructions is logically and temporally independent of any other instruction belonging to the group,
maintaining a pending events table, each bit of the pending events table indicating absence or presence of a pending event at an input of an instruction in the plurality of instructions;
selecting a group of instructions having pending input events by examining the pending events table;
executing the selected group of instructions to produce outputs to serve as inputs for destination instructions in other groups; and
updating the pending events table by clearing bits in the pending events table that correspond to inputs of the selected group and setting bits in the pending events table that correspond to inputs of destination instructions.

### Claim 16 (depends on 15)

The simulation system of claim 15, wherein the bits indicating absence or presence of pending events at the inputs of the instructions of the selected group are located in a same word of the pending events table.

### Claim 17 (depends on 15)

The simulation system of claim 15, wherein the pending events table contains groups of instructions that are scheduled to execute in a current time step but not instructions that are scheduled to execute in other time steps.

### Claim 18 (depends on 15)

The simulation system of claim 15, wherein the simulation accelerator is further configured to advance a simulation time to a next time step when all bits of the pending events table are cleared.

### Claim 19 (depends on 18)

The simulation system of claim 18, wherein the simulation accelerator is further configured to populate the pending events table with contents of a time wheel storage for the next time step.

### Claim 20 (depends on 15)

The simulation system of claim 15, wherein the simulation accelerator is further configured to maintain a time wheel storage for storing pending events at inputs of instructions scheduled to execute in a future time step after the current time step and storing a pending input event into the time wheel storage when a destination instruction is scheduled to execute in a future time step.
