# US 2017/0364473 A1 · Program counter alignment across a reconfigurable hum fabric

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

- Number: US 2017/0364473 A1
- Document ID: US20170364473A1
- Status: Published application
- Kind: A1
- Application number: 15/691,254
- Filed: 2017-08-30
- Published: 2017-12-21
- Earliest claimed: 2016-03-31
- Assignees: Wave Computing, Inc.
- Applicants: Wave Computing, Inc.
- Inventors: Gajendra Prasad Singh; Shaishav Desai
- Web page: https://patentgrep.com/patent/US20170364473A1

## CPC

- G06F 15/17325: {Synchronisation; Hardware support therefor (intertask synchronisation G06F9/52)}
- G06F 1/10: Distribution of clock signals {, e.g. skew}
- G06F 15/177: Initialisation or configuration control {(processor initialisation G06F9/4405)}
- G06F 15/7867: {with reconfigurable architecture}
- G06F 15/825: {Dataflow computers}
- Y02D 10/00: Energy efficient computing, e.g. low power processors, power management or thermal management
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE

## Abstract

Techniques are disclosed for circuit synchronization. Information is obtained on logical distances between circuits on a semiconductor chip. A plurality of clusters is determined within the chip circuits, where a cluster within the plurality of clusters is synchronized to a tic cycle boundary. A tic cycle count separation is evaluated across the clusters using the information on the logical distances. A plurality of counter initializations is calculated where the counter initializations compensate for the tic cycle count separation across the clusters. A plurality of counters is initialized, with a counter from the plurality of counters being associated with each cluster from the plurality of clusters, where the counters are distributed across the clusters, and where the initializing is based on the counter initializations that were calculated. The plurality of counters is started to coordinate calculation across the plurality of clusters. Reset, debug, and calculation stoppage are provided through the plurality of counters.

## Claims

### Claim 1

A processor-implemented method for circuit synchronization comprising:
obtaining information on logical distances between circuits on a semiconductor chip;
determining a plurality of clusters within the circuits on the semiconductor chip, wherein a cluster within the plurality of clusters is synchronized to a tic cycle boundary;
evaluating a tic cycle count separation across the plurality of clusters using the information on the logical distances;
calculating a plurality of counter initializations wherein the counter initializations compensate for the tic cycle count separation across the plurality of clusters;
initializing a plurality of counters, with a counter from the plurality of counters being associated with each cluster from the plurality of clusters, wherein the counters from the plurality of counters are distributed across the plurality of clusters, and wherein the initializing is based on the counter initializations that were calculated; and
starting the plurality of counters to coordinate calculation across the plurality of clusters.

### Claim 2 (depends on 1)

The method of claim 1 wherein the starting the plurality of counters includes starting a first counter in a first cluster, from the plurality of clusters, followed by starting a second counter in a second cluster, from the plurality of clusters.

### Claim 3 (depends on 2)

The method of claim 2 wherein the second cluster is a neighboring cluster, from the plurality of clusters, to the first cluster.

### Claim 4 (depends on 1)

The method of claim 1 wherein the tic cycle count separation between two neighboring clusters, from the plurality of clusters, is a single tic count.

### Claim 5 (depends on 1)

The method of claim 1 wherein the tic cycle count separation between two neighboring clusters, from the plurality of clusters, is a two tic count.

### Claim 6 (depends on 1)

The method of claim 1 wherein one counter, from the plurality of counters, is in each of the plurality of clusters.

### Claim 7 (depends on 1)

The method of claim 1 wherein the plurality of counters comprises down counters.

### Claim 8 (depends on 1)

The method of claim 1 wherein a tic cycle, from the tic cycle count separation, defines alignment edges for synchronized operation of logic.

### Claim 9 (depends on 1)

The method of claim 1 wherein the evaluating of the tic cycle count separation includes a propagation timing of a deterministic value from a first cluster to a second cluster, wherein the first cluster and the second cluster are from the plurality of clusters, and wherein the first cluster is adjacent to the second cluster.

### Claim 10 (depends on 9)

The method of claim 9 wherein the deterministic value is one tic cycle.

### Claim 11 (depends on 1)

The method of claim 1 wherein the tic cycle count separation is determined based on Manhattan distances.

### Claim 12 (depends on 1)

The method of claim 1 wherein the logical distances comprise sequential tic cycle counts.

### Claim 13 (depends on 1)

The method of claim 1 wherein the circuits comprise a reconfigurable fabric on the semiconductor chip.

### Claim 14 (depends on 13)

The method of claim 13 wherein the reconfigurable fabric is synchronized by hum generation signals.

### Claim 15 (depends on 13)

The method of claim 13 further comprising initializing and programming the fabric such that runtime active states result.

### Claim 16 (depends on 15)

The method of claim 15 further comprising halting the fabric while switches and direct memory access are active.

### Claim 17 (depends on 16)

The method of claim 16 further comprising further programming the halted fabric.

### Claim 18 (depends on 1)

The method of claim 1 wherein a cluster comprises a region within the semiconductor chip.

### Claim 19 (depends on 1)

The method of claim 1 further comprising resetting the plurality of counters.

### Claim 20 (depends on 19)

The method of claim 19 wherein the plurality of counters is reset prior to the initializing.

### Claim 21 (depends on 1)

The method of claim 1 wherein the plurality of counters is set to specific values, based on the logical distances, at time of boot for the semiconductor chip.

### Claim 22 (depends on 21)

The method of claim 21 wherein the specific values provide for synchronized startup of operation across a reconfigurable fabric.

### Claim 23 (depends on 1)

The method of claim 1 further comprising providing a set of debug values for the plurality of counters to facilitate analysis of a portion of a reconfigurable fabric.

### Claim 24 (depends on 1)

The method of claim 1 wherein the initializing of the plurality of counters occurs during hardware paging.

### Claim 25 (depends on 1)

The method of claim 1 further comprising stopping calculation across the plurality of clusters based on values included based on the initializing the plurality of counters.

### Claim 26

A computer program product embodied in a non-transitory computer readable medium for circuit synchronization comprising code which causes one or more processors to perform operations of:
obtaining information on logical distances between circuits on a semiconductor chip;
determining a plurality of clusters within the circuits on the semiconductor chip, wherein a cluster within the plurality of clusters is synchronized to a tic cycle boundary;
evaluating a tic cycle count separation across the plurality of clusters using the information on the logical distances;
calculating a plurality of counter initializations wherein the counter initializations compensate for the tic cycle count separation across the plurality of clusters;
initializing a plurality of counters, with a counter from the plurality of counters being associated with each cluster from the plurality of clusters, wherein the counters from the plurality of counters are distributed across the plurality of clusters, and wherein the initializing is based on the counter initializations that were calculated; and
starting the plurality of counters to coordinate calculation across the plurality of clusters.

### Claim 27

A computer system for circuit synchronization comprising:
a memory which stores instructions;
one or more processors attached to the memory wherein the one or more processors, when executing the instructions which are stored, are configured to:
obtain information on logical distances between circuits on a semiconductor chip;
determine a plurality of clusters within the circuits on the semiconductor chip, wherein a cluster within the plurality of clusters is synchronized to a tic cycle boundary;
evaluate a tic cycle count separation across the plurality of clusters using the information on the logical distances;
calculate a plurality of counter initializations wherein the counter initializations compensate for the tic cycle count separation across the plurality of clusters;
initialize a plurality of counters, with a counter from the plurality of counters being associated with each cluster from the plurality of clusters, wherein the counters from the plurality of counters are distributed across the plurality of clusters, and wherein the initializing is based on the counter initializations that were calculated; and
start the plurality of counters to coordinate calculation across the plurality of clusters.
