The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Feb. 15, 2022

Filed:

Mar. 29, 2021
Applicant:

Sambanova Systems, Inc., Palo Alto, CA (US);

Inventors:

Tejas Nagendra Babu Nama, Sunnyvale, CA (US);

Ruddhi Arun Chaphekar, Santa Clara, CA (US);

Ram Sivaramakrishnan, San Jose, CA (US);

Raghu Prabhakar, San Jose, CA (US);

Sumti Jairath, Santa Clara, CA (US);

Junjue Wang, San Mateo, CA (US);

Kaizhao Liang, Palo Alto, CA (US);

Adi Fuchs, West Windsor, NJ (US);

Matheen Musaddiq, Austin, TX (US);

Arvind Sujeeth, San Francisco, CA (US);

Assignee:

SambaNova Systems, Inc., Palo Alto, CA (US);

Attorneys:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G06F 16/90 (2019.01); G06F 15/78 (2006.01); G06F 17/16 (2006.01); G06T 1/20 (2006.01); G06N 3/02 (2006.01); G06K 9/62 (2006.01); G06N 3/08 (2006.01); G06F 15/76 (2006.01); G06F 16/901 (2019.01);
U.S. Cl.
CPC ...
G06F 16/9024 (2019.01); G06F 15/7839 (2013.01); G06F 15/7892 (2013.01); G06F 17/16 (2013.01); G06K 9/6256 (2013.01); G06N 3/02 (2013.01); G06N 3/082 (2013.01); G06T 1/20 (2013.01); G06F 2015/763 (2013.01);
Abstract

Disclosed is a data processing system which includes compile time logic configured to section a graph into a sequence of subgraphs, the sequence of subgraphs including at least a first subgraph. The compile time logic configures the first subgraph to generate a plurality of output tiles of an output tensor. A runtime logic configured with the compile time logic is to execute the sequence of subgraphs to generate, at the output of the first subgraph, the plurality of output tiles of the output tensor, and write the plurality of output tiles in a memory in an overlapping configuration. In an example, an overlapping region between any two neighboring output tiles of the plurality of output tiles comprises a summation of a corresponding region of a first neighboring output tile and a corresponding region of a second neighboring output tile.


Find Patent Forward Citations

Loading…