# US 2021/0280266 A1 · Systems and methods for implementing redundancy for tile-based intelligence processing computing architecture

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

- Number: US 2021/0280266 A1
- Document ID: US20210280266A1
- Status: Published application
- Kind: A1
- Application number: 17/331,095
- Filed: 2021-05-26
- Published: 2021-09-09
- Earliest claimed: 2019-11-26
- Assignees: Mythic, Inc.
- Applicants: Mythic, Inc.
- Inventors: Malav Parikh; Zainab Nasreen Zaidi; Sergio Schuler; Natarajan Seshan; Raul A. Garibay, Jr.; David Fick
- Web page: https://patentgrep.com/patent/US20210280266A1

## CPC

- G11C 29/44: Indication or identification of errors, e.g. for repair
- G11C 29/4401: {for self repair}
- G06F 12/1009: using page tables, e.g. page table structures
- G11C 29/38: Response verification devices
- G11C 29/54: Arrangements for designing test circuits, e.g. design for test [DFT] tools
- G11C 29/76: {using address translation or modifications}
- G06F 2212/657: Virtual address space management
- G11C: STATIC STORES (semiconductor memory devices H10B)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A system and method for virtually addressing an array of accelerator tiles of a mixed-signal integrated circuit includes testing each of a plurality of distinct matrix multiply accelerator (MMA) tiles of a grid of MMA tiles, the grid of MMA tiles being defined by the plurality of distinct grid of MMA tiles being arranged in a plurality of rows and a plurality of columns along an integrated circuit, each of the plurality of distinct MMA tiles within the grid of MMA tiles having a distinct physical address on the integrated circuit; identifying one or more defective MMA tiles within the grid of MMA tiles based on the testing; and configuring the grid of MMA tiles with a plurality of virtual addresses for routing data to or routing data from one or more non-defective MMA tiles of grid of MMA tiles based on identifying the one or more defective MMA tiles.

## Claims

### Claim 1

A method for virtually addressing an array of computing tiles, the method comprising:
virtually addressing a plurality of distinct computing tiles of an integrated circuit, wherein the virtually addressing includes:
(i) assigning a distinct valid virtual address to each distinct non-defective computing tile within the plurality of distinct computing tiles; and
(ii) disabling each defective computing tile within the plurality of distinct computing tiles,
wherein each distinct non-defective computing tile and each defective computing tile of the plurality of distinct computing tiles has a distinct physical tile address within the integrated circuit.

### Claim 2 (depends on 1)

The method according to claim 1, wherein
the distinct valid virtual address enables a routing, using a virtual address map, of data to each distinct non-defective computing tile.

### Claim 3 (depends on 11)

The method according to claim 11, wherein:
the disabling includes assigning an invalid virtual address to each defective computing tile; and
the invalid virtual address disables a routing, using a virtual address map, of data to each defective computing tile.

### Claim 4 (depends on 1)

The method according to claim 1, further comprising:
enabling routing of data along the integrated circuit based on a virtual address map, the virtual address map including:
(a) a physical n-dimensional coordinate along the integrated circuit for each distinct non-defective computing tile, and
(b) a virtual n-dimensional coordinate along the integrated circuit for each distinct non-defective computing tile.

### Claim 5

A method for dually addressing an array of computing tiles of an integrated circuit, the method comprising:
dually addressing one or more of a plurality of computing tiles arranged along an integrated circuit, wherein dually addressing includes:
(i) assigning a distinct physical tile address to each of the plurality of computing tiles along the integrated circuit;
(ii) assigning a valid virtual address to each distinct computing tile within a portion of the plurality of computing tiles; and
(iii) disabling each distinct computing tile within a distinct portion of the plurality of computing tiles.

### Claim 6 (depends on 5)

The method according to claim 5, wherein:
the disabling includes assigning an invalid virtual address to each distinct computing tile within a distinct portion; and
the null virtual address renders each distinct computing tile within the distinct potion unreachable via virtual addressing using a data packet routing algorithm.

### Claim 7 (depends on 5)

The method according to claim 5, wherein
the valid virtual address renders each distinct computing tile within the portion reachable via virtual addressing using a data packet routing algorithm.

### Claim 8 (depends on 5)

The method according to claim 5, wherein:
the disabling includes assigning a null virtual address to each distinct computing tile within a distinct portion; and
assigning the null address includes setting a same value as a null virtual address coordinate at each of a plurality of distinct computing tiles within the distinct portion.

### Claim 9 (depends on 6)

The method according to claim 6, wherein
each distinct physical tile address comprises a physical n-dimensional coordinate of the integrated circuit, and
the null address comprises a virtual n-dimensional coordinate.

### Claim 10

A method for virtually addressing computing tiles of an integrated circuit, the method comprising:
identifying one or more of a plurality of distinct computing tiles as a subset of disabled computing tiles;
identifying one or more of the plurality of distinct computing tiles as a subset of non-defective computing tiles;
wherein each of the plurality of distinct computing tiles is associated with a distinct physical address along an integrated circuit;
virtually addressing the plurality of distinct computing tiles including:
(i) assigning a distinct valid virtual address to each distinct computing tile within the subset of non-defective computing tiles; and
(ii) bypassing an assignment of the distinct valid virtual address to each computing tile within the subset of disabled computing tiles.

### Claim 11 (depends on 10)

The method according to claim 10, wherein
the distinct valid virtual address enables a routing, using a virtual address map, of data along the subset of non-defective computing tiles.

### Claim 12 (depends on 10)

The method according to claim 10, further comprising:
assigning an invalid virtual address to each computing tile with the subset of disabled computing tiles,
wherein the invalid virtual address disables a routing, using a virtual address map, of data along the subset of non-defective computing tiles using the invalid virtual address.

### Claim 13 (depends on 10)

The method according to claim 10, further comprising:
assigning an invalid virtual address to each computing tile with the subset of disabled computing tiles,
wherein the invalid virtual address comprises a null address that set a disabled computing tile within the subset of disabled computing tile to a virtually offline state preventing a routing of data to each of the one or more of the plurality of distinct computing tiles of the subset of disabled computing tiles when using virtual addressing.

### Claim 14 (depends on 10)

The method according to claim 10, further comprising:
assigning an invalid virtual address to each computing tile with the subset of disabled computing tiles,
wherein the invalid virtual address comprises a null virtual address causing a given disabled computing tile having the null virtual address to continue to pass a data packet traveling in a first direction to a neighboring computing tile along the first direction.

### Claim 15 (depends on 10)

The method according to claim 10, further comprising:
implementing a defect agnostic routing algorithm that acknowledges non-defective computing tiles as virtually addressable computing tiles and ignores the disabled computing tiles having a null virtual address as non-virtually addressable computing tiles.

### Claim 16 (depends on 10)

The method according to claim 10, further comprising:
a defect agnostic routing algorithm implements dual addressing for interchangeably setting either a physical routing address or a virtual routing address for each data packet traveling into the plurality of distinct computing tiles of the integrated circuit.

### Claim 17 (depends on 10)

The method according to claim 10, wherein
the virtually addressing the plurality of distinct computing tiles includes:
at manufacture time of the integrated circuit, using one or more fuses to program virtual addresses for the plurality of distinct computing tiles, wherein each of the one or more fuses stores an electrical value corresponding to a distinct virtual address value.

### Claim 18 (depends on 10)

The method according to claim 10, further comprising:
assigning an invalid virtual address to each computing tile with the subset of disabled computing tiles, wherein
the invalid virtual address sets each computing tile within the subset of disabled computing tiles to a virtually offline state preventing a routing of data to each of the subset of disabled computing tiles.

### Claim 19 (depends on 10)

The method according to claim 10, further comprising
using one or more fuses to program addresses for the plurality of distinct computing tiles, wherein each of the one or more fuses stores an electrical value corresponding to a distinct address value.

### Claim 20 (depends on 10)

The method according to claim 10, further comprising:
a routing algorithm implements data packet addressing based on virtually addressed computing tiles and disabled computing tiles along the integrated circuit.
