IP Library Granted Patent US 12,292,473
Granted Patent B2
US 12,292,473 · App. 18/527,902 · Granted May 6, 2025

Yield improvements for three-dimensionally stacked neural network accelerators

Inventors: Andreas Georg Nowatzyk (San Jose, CA); Olivier Temam (Antony, FR)
Assignee: Google LLC
G01R31/31723G01R31/31718G01R31/31722G06N3/045H02J50/10H04L45/06H04L45/28
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,292,473
App. No.
18/527,902
Granted
May 6, 2025
Kind
B2
Abstract

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for three-dimensionally stacked neural network accelerators. In one aspect, a method includes obtaining data specifying that a tile from a plurality of tiles in a three-dimensionally stacked neural network accelerator is a faulty tile. The three-dimensionally stacked neural network accelerator includes a plurality of neural network dies, each neural network die including a respective plurality of tiles, each tile has input and output connections. The three-dimensionally stacked neural network accelerator is configured to process inputs by routing the input through each of the plurality of tiles according to a dataflow configuration and modifying the dataflow configuration to route an output of a tile before the faulty tile in the dataflow configuration to an input connection of a tile that is positioned above or below the faulty tile on a different neural network die than the faulty tile.

Claims (28)

1. A device comprising a plurality of stacked dies, each die comprising a plurality of tiles, wherein each tile comprises:

a processing element configured to perform one or more computations;

an inductive coil that is reconfigurable to receive data from a vertically adjacent tile of another die in the plurality of stacked dies; and

switching circuitry that is reconfigurable to select between routing input data received through the inductive coil to the processing element or routing the input data to a processing element bypass that bypasses the processing element.

2. The device of claim 1 , wherein the device has a dataflow configuration that in operation causes the tiles of the stacked dies to implement the computations of a neural network.

3. The device of claim 1 , wherein the dataflow configuration causes a first tile of a plurality of tiles of a first die to route input data to a first processing element of the first tile.

4. The device of claim 3 , wherein the dataflow configuration causes a second tile of the plurality of tiles of the first die to route input data to a processing element bypass of the second tile.

5. The device of claim 4 , wherein the dataflow configuration causes the first tile to receive the input data routed through the processing element bypass of the second tile.

6. The device of claim 5 , wherein the dataflow configuration causes a third tile of the first die to be bypassed entirely.

7. The device of claim 1 , wherein each tile comprises a pair of inductive coils that are reconfigurable to transmit or receive data from an adjacent tile of another die.

8. The device of claim 7 , wherein the pair of inductive coils are reconfigurable to transmit or receive data from a vertically adjacent tile of another die.

9. A method of routing data in device comprising a plurality of stacked dies, each die comprising a plurality of tiles, wherein each tile comprises:

a processing element configured to perform one or more computations;

an inductive coil that is reconfigurable to receive data from a vertically adjacent tile of another die in the plurality of stacked dies; and

switching circuitry that is reconfigurable to select between routing input data received through the inductive coil to the processing element or routing the input data to a processing element bypass that bypasses the processing element,

the method comprising routing, by switching circuitry of a first tile of a first die of the plurality of stacked dies in accordance with a dataflow configuration of the device, input data received by the first tile to a processing element bypass of the first tile.

10. The method of claim 9 , further comprising implementing the computations of a neural network using the plurality of stacked dies.

11. The method of claim 9 , further comprising routing, by switching circuitry of a second tile of the first die, input data to a processing element of the second tile.

12. The method of claim 11 , further comprising receiving, by the second tile, input data routed through the processing element bypass of the first tile.

13. The method of claim 9 , further comprising bypassing a third tile of the first die in accordance with the dataflow configuration.

14. The method of claim 9 , wherein each tile comprises a pair of inductive coils that are reconfigurable to transmit or receive data from an adjacent tile of another die.

15. The method of claim 14 , wherein the pair of inductive coils are reconfigurable to transmit or receive data from a vertically adjacent tile of another die.

16. A method of reconfiguring a device comprising a plurality of stacked dies, each die comprising a plurality of tiles, wherein each tile comprises:

a processing element configured to perform one or more computations;

an inductive coil that is reconfigurable to receive data from a vertically adjacent tile of another die in the plurality of stacked dies; and

switching circuitry that is reconfigurable to select between routing input data received through the inductive coil to the processing element or routing the input data to a processing element bypass that bypasses the processing element,

the method comprising reconfiguring switching circuitry of a first tile of the plurality of tiles to route input data to a processing element bypass of the first instead of a processing element of the first tile.

17. The method of claim 16 , further comprising reconfiguring switching circuitry of a second tile of the plurality of tiles to route input data to a processing element of the second tile instead of to a processing element bypass of the second tile.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 19, 2023
From: NOWATZYK, ANDREAS GEORG; TEMAM, OLIVIER
To: GOOGLE INC.
Reel/Frame 065916/0883 →
CHANGE OF NAME Recorded Dec 19, 2023
From: GOOGLE INC.
To: GOOGLE LLC
Reel/Frame 066087/0947 →
Continuity (3)
Continuation 17213871 · Mar 26, 2021
Continuation 15685672 · Aug 24, 2017
Related Publication 20240220773A1 · Jul 4, 2024
References Cited (40)
US 5422983A · Castelaz et al. · 1995 [cited by applicant]
US 5712968A · Nakayama et al. · 1998 [cited by applicant]
US 7426501B2 · Nugent · 2008 [cited by applicant]
US 7804504B1 · Agarwal · 2010 [cited by examiner]
US 8933447B1 · Rahman · 2015 [cited by examiner]
US 9882562B1 · Voogel · 2018 [cited by applicant]
US 10650286B2 · Ben-Ari et al. · 2020 [cited by applicant]
US 20030159077A1 · Matsuo · 2003 [cited by examiner]
US 20080320069A1 · Lin · 2008 [cited by examiner]
US 20120256653A1 · Cordero et al. · 2012 [cited by applicant]
US 20140095923A1 · Rivera et al. · 2014 [cited by applicant]
US 20150355769A1 · Kim et al. · 2015 [cited by applicant]
US 20150371683A1 · Vorbach · 2015 [cited by examiner]
US 20160323137A1 · Alvarez-Icaza et al. · 2016 [cited by applicant]
US 20160350645A1 · Brothers et al. · 2016 [cited by applicant]
US 20160364644A1 · Brothers et al. · 2016 [cited by applicant]
US 20180121196A1 · Temam et al. · 2018 [cited by applicant]
US 20180246853A1 · Fowers et al. · 2018 [cited by applicant]
US 20190004994A1 · Fleming · 2019 [cited by examiner]
US 20190065937A1 · Nowatzyk · 2019 [cited by applicant]
CN 1191626 · 2005 [cited by applicant]
CN 106462803 · 2017 [cited by applicant]
TW I527132 · 2016 [cited by applicant]
TW I585584 · 2017 [cited by applicant]
Dave Ditzel, Tadahiro Kuroda and Stephen Lee; Low-Cost 3D Chip Stacking with ThruChip Wireless Connections; ThruChip Communications Aug. 11, 2014 (Year: 2014). [cited by examiner]
Campbell et al., “3-D Wafer Scale Architectures for Neural Network Computing,” IEEE Transactions on Components, Hybrids and Manufacturing Technology, Nov. 1, 1993, 16(7):10 pages. [cited by applicant]
Chen et al., “DaDianNao: A Machine-Learning Supercomputer,” 2014 47th Annual IEEE/ACM International Symposium on Microarchitecture, Cambridge, United Kingdom, Dec. 13-17, 2014, 14 pages. [cited by applicant]
Chen et al., “DianNao: A Small-Footprint High-Throughput Accelerator for Ubiquitous Machine-Learning,” ACM Sigplan Notices, Mar. 1-5, 2014, 48(4):269-283. [cited by applicant]
Chi et al., “Prime: A Novel Processing-in-memory Architecture for Neural Network Computation in ReRAM-based Main Memory,” Proceedings of International Symposium on Computer Architecture, Seoul, South Korea, Jun. 18-22, … [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/US2018/047468, mailed on Feb. 25, 2020, 11 pages. [cited by applicant]
International Search Report in International Appln. No. PCT/US2018/047468, mailed on Dec. 4, 2018, 18 pages. [cited by applicant]
Kuroda, “ThruChip Interface for 3D system integration,” IEEE 2010 International Symposium on VLSI Technology Systems and Applications, Apr. 26, 2010, 1 page. [cited by applicant]
Nomura et al., “3D Shared Bus Architecture Using Inductive Coupling Interconnect,” IEEE 9th International Symposium on Embedded Multicore/Many-Core Systems-on-Chip, Sep. 23, 2015, 8 pages. [cited by applicant]
Notice of Allowance in Chinese Appln. No. 201880038452.5, mailed on Jun. 30, 2023, 7 pages (with English translation). [cited by applicant]
Octcharov et al., “Accelerating Deep Convolutional Neural Networks Using Specialized Hardware,” Microsoft Research Whitepaper, Feb. 2015, 2(11):4 pages. [cited by applicant]
Office Action in Chinese Appln. No. 201880038452.5, mailed on Feb. 11, 2023, 26 pages (with English translation). [cited by applicant]
Office Action in European Appln. No. 18766435.4, mailed on Nov. 9, 2022, 7 pages. [cited by applicant]
Office Action in European Appln. No. 18766435.4, mailed on Sep. 8, 2021, 10 pages. [cited by applicant]
Office Action in Taiwan Appln. No. 107129464, mailed on Aug. 22, 2019, 17 pages (with English translation). [cited by applicant]
Zhang et al., “Optimizing FPGA-based Accelerator Design for Deep Convolutional Neural Networks,” Proceedings of the 2015 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, Feb. 22, 2015, 10 pages. [cited by applicant]