# US 2015/0178426 A1 · Hardware simulation controller, system and method for functional verification

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

- Number: US 2015/0178426 A1
- Document ID: US20150178426A1
- Status: Published application
- Kind: A1
- Application number: 14/641,922
- Filed: 2015-03-09
- Published: 2015-06-25
- Earliest claimed: 2013-03-15
- Assignees: Mentor Graphics Corporation
- Applicants: Mentor Graphics Corporation
- Inventors: Arthur J. Stamness; Brian Etscheid; Randy Misustin
- Web page: https://patentgrep.com/patent/US20150178426A1

## CPC

- G06F 30/3308: using simulation
- G06F 30/327: Logic synthesis; Behaviour synthesis, e.g. mapping logic, HDL to netlist, high-level language to RTL or netlist
- G06F 30/33: Design verification, e.g. functional simulation or model checking
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Systems and methods of using hardware to simulate software, specifically the semantic operations defined in HDL simulation languages. Traditional software HDL simulation kernel operations of advancing time, activating threads in response to notified events, and scheduling those threads of execution are handled via a simulation controller. The simulation controller is comprised of a timing wheel, an event-processor, a thread/process dispatch engine, a token processor, and a resource-allocator. These components work together with a control logic component to perform the semantic operations of an HDL software kernel.

## Claims

### Claim at position 1

1-9. (canceled)

### Claim 10

A controller for simulating a hardware description language (HDL), comprising:
a time wheel module comprising a plurality of physical queues to which virtual queues that represent an HDL simulator description are mapped; and
control logic which controls the mapping of the virtual queues to physical queues to represent an advancement of time.

### Claim 11 (depends on 10)

The controller of claim 10, further comprising an event processor that swaps processing between different physical queues.

### Claim 12 (depends on 11)

The controller of claim 11, wherein the event processor swaps processing between an active queue and a processing queue so that the processing queue includes an event to be processed.

### Claim 13 (depends on 12)

The controller of claim 12, wherein the event processor determines a memory address for the event to be processed.

### Claim 14 (depends on 13)

The controller of claim 13, further comprising a token datapath which is configured to retrieve a value from memory based on the memory address determined by the event processor.

### Claim 15 (depends on 14)

The controller of claim 14, wherein the token datapath is configured to forward the value to the event processor if the value represents an event.

### Claim 16 (depends on 14)

The controller of claim 14, further comprising a dispatch engine for managing threads and process tokens.

### Claim 17 (depends on 16)

The controller of claim 16, wherein the token datapath is configured to forward the value to the dispatch engine if the value represents a thread or process.

### Claim 18 (depends on 17)

The controller of claim 17, wherein the dispatch engine is configured to prevent two threads from running concurrently if the two threads are invocations of the same thread.

### Claim 19 (depends on 18)

The controller of claim 18, wherein the dispatch engine is configured to place a duplicative thread in a cancellation queue which is used to cancel any further attempts to invoke the duplicative thread while the duplicative thread is pending in the cancellation queue.

### Claim at position 12

20-26. (canceled)

### Claim 27

A method for simulating a hardware description language (HDL), the method comprising:
mapping virtual queues that represent an HDL simulator description to physical queues on a processor; and
using control logic to control the mapping of the virtual queues to physical queues so as to represent an advancement of time.

### Claim 28 (depends on 27)

The method of claim 27, further comprising using an event processor to swap processing between different physical queues.

### Claim 29 (depends on 28)

The method of claim 28, wherein the event processor swaps processing between an active queue and a processing queue so that the processing queue includes an event to be processed.

### Claim 30 (depends on 29)

The method of claim 29, further comprising using the event processor to determine a memory address for the event to be processed.

### Claim 31 (depends on 30)

The method of claim 30, further comprising retrieving a value from memory based on the memory address determined by the event processor.

### Claim 32 (depends on 31)

The method of claim 31, further comprising forwarding the value to the event processor if the value represents an event.

### Claim 33 (depends on 31)

The method of claim 31, further comprising forwarding the value to a dispatch engine for managing threads and process tokens if the value represents a thread or process.

### Claim 34 (depends on 33)

The method of claim 33, further comprising using the dispatch engine to prevent two threads from running concurrently if the two threads are invocations of the same thread.

### Claim 35 (depends on 34)

The method of claim 34, further comprising placing a duplicative thread in a cancellation queue which is used to cancel any further attempts to invoke the duplicative thread while the duplicative thread is pending in the cancellation queue.
