IP Library Granted Patent US 12,293,186
Granted Patent B2
US 12,293,186 · App. 18/386,407 · Granted May 6, 2025

Systems and methods to store a tile register pair to memory

Inventors: Raanan Sade (Kibutz Sarid, IL); Simon Rubanovich (Haifa, IL); Amit Gradstein (Binyamina, IL); Zeev Sperber (Zichron Yackov, IL); Alexander Heinecke (San Jose, CA); Robert Valentine (Kiryat Tivon, IL); Mark J. Charney (Lexington, MA); Bret Toll (Hillsboro, OR); Jesus Corbal (King City, OR); Elmoustapha Ould-Ahmed-Vall (Chander, AZ); Menachem Adelman (Modi'in, IL)
Assignee: Intel Corporation
G06F9/30145G06F9/30036G06F9/30038G06F9/30043
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,293,186
App. No.
18/386,407
Granted
May 6, 2025
Kind
B2
Abstract

Embodiments detailed herein relate to systems and methods to store a tile register pair to memory. In one example, a processor includes: decode circuitry to decode a store matrix pair instruction having fields for an opcode and source and destination identifiers to identify source and destination matrices, respectively, each matrix having a PAIR parameter equal to TRUE; and execution circuitry to execute the decoded store matrix pair instruction to store every element of left and right tiles of the identified source matrix to corresponding element positions of left and right tiles of the identified destination matrix, respectively, wherein the executing stores a chunk of C elements of one row of the identified source matrix at a time.

Claims (42)

1. An apparatus comprising:

circuitry to receive an instruction, the instruction to identify a first two-dimensional source tile that is to be stored in memory and a second two-dimensional source tile that is to be stored in the memory; and

execution circuitry to perform operations corresponding to the instruction, including to:

determine that an indicator indicates that a pair of matrices are to be loaded; and

load elements from element positions of each row of the first two-dimensional source tile into corresponding element positions of a first two-dimensional destination tile, and load elements from element positions of each row of the second two-dimensional source tile into corresponding element positions of a second two-dimensional destination tile, in response to the determination that the indicator indicates that the pair of matrices are to be loaded, wherein the execution circuitry is to load every element of the first two-dimensional source tile into the first two-dimensional destination tile, and load every element of the second two-dimensional source tile into the second two-dimensional destination tile.

2. The apparatus of claim 1 , wherein the first two-dimensional source tile and the second two-dimensional source tile are to be next to one another in memory.

3. The apparatus of claim 1 , wherein the first and second two-dimensional destination tiles each comprise a plurality of registers of a processor, and wherein the execution circuitry is in a graphics processing unit.

4. The apparatus of claim 1 , wherein the first and second two-dimensional source tiles each have eight rows, and wherein the instruction has a field to specify a size of the elements of the first two-dimensional source tile.

5. The apparatus of claim 1 , further comprising:

a plurality of memory controllers;

a level-two (L2) cache memory coupled to the plurality of memory controllers; and

a processor core coupled to the plurality of memory controllers, and coupled to the L2 cache memory, the processor core including the execution circuitry.

6. The apparatus of claim 1 , wherein the circuitry to receive the instruction is to convert the instruction into one or more other instructions.

7. An apparatus comprising:

circuitry to convert a first instruction into one or more other instructions, the first instruction to identify a first two-dimensional source tile that is to be stored in memory and a second two-dimensional source tile that is to be stored in the memory;

execution circuitry to perform operations corresponding to the first instruction, including to:

determine that an indicator indicates that a pair of matrices are to be loaded; and

load elements from element positions of each row of the first two-dimensional source tile into corresponding element positions of a first two-dimensional destination tile, and load elements from element positions of each row of the second two-dimensional source tile into corresponding element positions of a second two-dimensional destination tile, in response to the determination that the indicator indicates that the pair of matrices are to be loaded;

a plurality of memory controllers;

a level-two (L2) cache memory coupled to the plurality of memory controllers; and

a processor core coupled to the plurality of memory controllers, and coupled to the L2 cache memory, the processor core including the execution circuitry.

8. The apparatus of claim 7 , wherein the execution circuitry is in a graphics processing unit.

9. The apparatus of claim 8 , wherein the first and second two-dimensional destination tiles each comprise a plurality of processor registers.

10. The apparatus of claim 9 , wherein the execution circuitry is to load every element of the first two-dimensional source tile into the first two-dimensional destination tile, and load every element of the second two-dimensional source tile into the second two-dimensional destination tile.

11. The apparatus of claim 9 , wherein the first two-dimensional source tile and the second two-dimensional source tile are to be next to one another in memory.

12. The apparatus of claim 9 , wherein the first and second two-dimensional source tiles each have eight rows, and wherein the first instruction has a field to specify a size of the elements of the first two-dimensional source tile.

13. An apparatus comprising:

an instruction converter to convert a first instruction into one or more other instructions, the first instruction identifying a first two-dimensional source tile in memory and a second two-dimensional source tile in the memory, wherein the first instruction has a field to specify a size of the elements of the first two-dimensional source tile; and

execution circuitry to perform operations corresponding to the first instruction, including to:

determine that an indicator indicates that a pair of matrices are to be loaded; and

load elements from element positions of each row of the first two-dimensional source tile into corresponding element positions of a first two-dimensional destination tile, and load elements from element positions of each row of the second two-dimensional source tile into corresponding element positions of a second two-dimensional destination tile, in response to the determination that the indicator indicates that the pair of matrices are to be loaded.

14. The apparatus of claim 13 , wherein the first and second two-dimensional source tiles each have eight rows.

15. The apparatus of claim 14 , wherein the execution circuitry is in a graphics processing unit.

16. The apparatus of claim 13 , wherein the first and second two-dimensional destination tiles each comprise a plurality of processor registers.

17. The apparatus of claim 13 , wherein the execution circuitry is to load every element of the first two-dimensional source tile into the first two-dimensional destination tile, and load every element of the second two-dimensional source tile into the second two-dimensional destination tile.

18. The apparatus of claim 13 , wherein the first two-dimensional source tile and the second two-dimensional source tile are to be next to one another in memory.

19. The apparatus of claim 13 , further comprising:

a plurality of memory controllers;

a level-two (L2) cache memory coupled to the plurality of memory controllers; and

a processor core coupled to the plurality of memory controllers, and coupled to the L2 cache memory, the processor core including the execution circuitry.

20. The apparatus of claim 13 , wherein the instruction converter comprises a machine-readable storage medium storing instructions that when executed by the apparatus cause the apparatus to said convert the first instruction into the one or more other instructions.

21. The apparatus of claim 13 , wherein the instruction converter comprises a circuitry to convert the first instruction into the one or more other instructions.

Continuity (2)
Continuation 15858937 · Dec 29, 2017
Related Publication 20240143328A1 · May 2, 2024
References Cited (179)
US 4967388A · Tate · 1990 [cited by applicant]
US 5247632A · Newman · 1993 [cited by applicant]
US 5475631A · Parkinson et al. · 1995 [cited by applicant]
US 5475822A · Sibigtroth et al. · 1995 [cited by applicant]
US 5892962A · Cloutier · 1999 [cited by applicant]
US 6161219A · Ramkumar et al. · 2000 [cited by applicant]
US 6212112B1 · Naura et al. · 2001 [cited by applicant]
US 6332186B1 · Elwood et al. · 2001 [cited by applicant]
US 6877020B1 · Bratt et al. · 2005 [cited by applicant]
US 7003542B2 · Devir · 2006 [cited by applicant]
US 7209939B2 · Castrapel et al. · 2007 [cited by applicant]
US 7725521B2 · Chen et al. · 2010 [cited by applicant]
US 7792895B1 · Juffa et al. · 2010 [cited by applicant]
US 7844352B2 · Vouzis et al. · 2010 [cited by applicant]
US 7873812B1 · Mimar · 2011 [cited by applicant]
US 7912889B1 · Juffa et al. · 2011 [cited by applicant]
US 7932910B2 · Hansen et al. · 2011 [cited by applicant]
US 8392487B1 · Mesh et al. · 2013 [cited by applicant]
US 8417758B1 · Rao et al. · 2013 [cited by applicant]
US 8924455B1 · Barman et al. · 2014 [cited by applicant]
US 8984043B2 · Ginzburg et al. · 2015 [cited by applicant]
US 9442723B2 · Yang et al. · 2016 [cited by applicant]
US 9557998B2 · Ould-Ahmed-Vall et al. · 2017 [cited by applicant]
US 9906359B2 · Gueron · 2018 [cited by applicant]
US 9960907B2 · Gueron · 2018 [cited by applicant]
US 10535114B2 · Bolz · 2020 [cited by applicant]
US 10664287B2 · Hughes · 2020 [cited by examiner]
US 10671913B2 · Liu · 2020 [cited by examiner]
US 10719323B2 · Baum · 2020 [cited by examiner]
US 10838734B2 · Hughes · 2020 [cited by examiner]
US 10853067B2 · Henry · 2020 [cited by examiner]
US 10860681B2 · Zhang · 2020 [cited by examiner]
US 10866786B2 · Sade · 2020 [cited by examiner]
US 10896043B2 · Toll · 2021 [cited by examiner]
US 10922077B2 · Espig · 2021 [cited by examiner]
US 10929503B2 · Azizi · 2021 [cited by examiner]
US 10942985B2 · Espig · 2021 [cited by examiner]
US 10963246B2 · Heinecke · 2021 [cited by examiner]
US 10963256B2 · Sade · 2021 [cited by examiner]
US 10970076B2 · Ould-Ahmed-Vall · 2021 [cited by examiner]
US 10990396B2 · Toll · 2021 [cited by examiner]
US 11023235B2 · Sade · 2021 [cited by examiner]
US 11093247B2 · Sade · 2021 [cited by examiner]
US 11163565B2 · Valentine · 2021 [cited by examiner]
US 11294671B2 · Hughes · 2022 [cited by examiner]
US 11567765B2 · Valentine · 2023 [cited by examiner]
US 11579883B2 · Hughes · 2023 [cited by examiner]
US 11669326B2 · Sade · 2023 [cited by examiner]
US 11809869B2 · Sade · 2023 [cited by examiner]
US 20020198911A1 · Blomgren et al. · 2002 [cited by applicant]
US 20030126176A1 · Devir · 2003 [cited by applicant]
US 20040111587A1 · Nair et al. · 2004 [cited by applicant]
US 20050053012A1 · Moyer · 2005 [cited by applicant]
US 20050193050A1 · Sazegari · 2005 [cited by applicant]
US 20060101245A1 · Nair et al. · 2006 [cited by applicant]
US 20060184837A1 · Al-Omari · 2006 [cited by applicant]
US 20060190517A1 · Guerrero · 2006 [cited by applicant]
US 20070186210A1 · Hussain et al. · 2007 [cited by applicant]
US 20080071851A1 · Zohar et al. · 2008 [cited by applicant]
US 20080140994A1 · Khailany et al. · 2008 [cited by applicant]
US 20080208942A1 · Won et al. · 2008 [cited by applicant]
US 20090043836A1 · Dupaquis et al. · 2009 [cited by applicant]
US 20090044271A1 · Benameur et al. · 2009 [cited by applicant]
US 20090113185A1 · Hansen · 2009 [cited by examiner]
US 20090292758A1 · Brokenshire et al. · 2009 [cited by applicant]
US 20090300091A1 · Brokenshire et al. · 2009 [cited by applicant]
US 20090300249A1 · Moyer et al. · 2009 [cited by applicant]
US 20100180100A1 · Lu et al. · 2010 [cited by applicant]
US 20100325187A1 · Juffa et al. · 2010 [cited by applicant]
US 20120079252A1 · Sprangle · 2012 [cited by applicant]
US 20120113133A1 · Shpigelblat · 2012 [cited by applicant]
US 20120137074A1 · Kim et al. · 2012 [cited by applicant]
US 20120254588A1 · Adrian et al. · 2012 [cited by applicant]
US 20120314774A1 · Yang et al. · 2012 [cited by applicant]
US 20130305020A1 · Valentine et al. · 2013 [cited by applicant]
US 20140032876A1 · Burkart et al. · 2014 [cited by applicant]
US 20140149480A1 · Catanzaro et al. · 2014 [cited by applicant]
US 20150067302A1 · Gueron · 2015 [cited by applicant]
US 20150199266A1 · Franchetti et al. · 2015 [cited by applicant]
US 20150249468A1 · Nikkila et al. · 2015 [cited by applicant]
US 20160179523A1 · Ould-Ahmed-Vall et al. · 2016 [cited by applicant]
US 20170053012A1 · Levy et al. · 2017 [cited by applicant]
US 20170053656A1 · Moriya et al. · 2017 [cited by applicant]
US 20180074824A1 · Sazegari et al. · 2018 [cited by applicant]
US 20180113708A1 · Corbal et al. · 2018 [cited by applicant]
US 20190042255A1 · Sade · 2019 [cited by examiner]
US 20220091848A1 · Sade · 2022 [cited by examiner]
KR 1020110079495A · 2011 [cited by applicant]
WO 2004053841A2 · 2004 [cited by applicant]
WO 2016003740A1 · 2016 [cited by applicant]
WO 2016105727A1 · 2016 [cited by applicant]
WO 2018125250A1 · 2018 [cited by applicant]
WO 2018174925A1 · 2018 [cited by applicant]
WO 2018174935A1 · 2018 [cited by applicant]
Advisory Action, U.S. Appl. No. 15/859,271, Sep. 20, 2022, 4 pages. [cited by applicant]
Advisory Action, U.S. Appl. No. 15/858,916, May 8, 2023, 5 pages. [cited by applicant]
Advisory Action, U.S. Appl. No. 15/858,937, May 18, 2020, 3 pages. [cited by applicant]
Advisory Action, U.S. Appl. No. 15/859,271, Jul. 18, 2022, 3 pages. [cited by applicant]
Cascaval et al., “A taxonomy of accelerator architectures and their programming models”, In: IBM Journal of Research and Development, vol. 54, No. 5, Sep./Oct. 2010, pp. 5:1-5:10. [cited by applicant]
Corrected Notice of Allowability, U.S. Appl. No. 15/201,442, Jan. 22, 2019, 5 pages. [cited by applicant]
Corrected Notice of Allowability, U.S. Appl. No. 15/201,442, Mar. 11, 2019, 2 pages. [cited by applicant]
Eiron et al., “Matrix Multiplication: A Case Study of Algorithm Engineering”, 2nd Workshop on Algorithm Engineering (WAE98), Aug. 20-22, 1998, pp. 98-109. [cited by applicant]
Final Office Action, U.S. Appl. No. 15/858,916, Mar. 17, 2020, 10 pages. [cited by applicant]
Final Office Action, U.S. Appl. No. 15/858,916, Nov. 14, 2022, 10 pages. [cited by applicant]
Final Office Action, U.S. Appl. No. 15/858,916, Sep. 15, 2021, 18 pages. [cited by applicant]
Final Office Action, U.S. Appl. No. 15/858,937, Feb. 10, 2020, 8 pages. [cited by applicant]
Final Office Action, U.S. Appl. No. 15/858,937, Sep. 3, 2021, 19 pages. [cited by applicant]
Final Office Action, U.S. Appl. No. 15/858,947, Oct. 10, 2019, 6 pages. [cited by applicant]
Final Office Action, U.S. Appl. No. 15/859,268, Jul. 20, 2022, 17 pages. [cited by applicant]
Final Office Action, U.S. Appl. No. 15/859,268, Feb. 23, 2021, 14 pages. [cited by applicant]
Final Office Action, U.S. Appl. No. 15/859,268, Sep. 16, 2019, 9 pages. [cited by applicant]
Final Office Action, U.S. Appl. No. 15/859,271, Aug. 20, 2021, 21 pages. [cited by applicant]
Final Office Action, U.S. Appl. No. 15/859,271, Jun. 21, 2022, 22 pages. [cited by applicant]
Final Office Action, U.S. Appl. No. 15/859,271, Mar. 9, 2020, 13 pages. [cited by applicant]
International Preliminary Report on Patentability, PCT App. No. PCT/US2017/040546, Oct. 3, 2019, 10 pages. [cited by applicant]
International Search Report and Written Opinion, PCT App. No. PCT/US2017/036038, Sep. 5, 2017 , 15 pages. [cited by applicant]
International Search Report and Written Opinion, PCT App. No. PCT/US2017/040534, Jan. 3, 2018, 11 pages. [cited by applicant]
International Search Report and Written Opinion, PCT App. No. PCT/US2017/040536, Dec. 20, 2017, 11 pages. [cited by applicant]
International Search Report and Written Opinion, PCT App. No. PCT/US2017/040537, Dec. 20, 2017, 11 pages. [cited by applicant]
International Search Report and Written Opinion, PCT App. No. PCT/US2017/040540, Jan. 3, 2018, 14 pages. [cited by applicant]
International Search Report and Written Opinion, PCT App. No. PCT/US2017/040546, Jan. 24, 2018, 15 pages. [cited by applicant]
Joerg-Henrik Heine, “RDocumentation—Pair—Rasch Item Parameter”, RDocumentation, Available Online at <https://www.rdocumentation.org/packages/pairwise/versions/0.3.1/topics/pair>, Version 0.3.1, 2015, 1 page. [cited by applicant]
Lahr, David L., “Distractions: Timing Matrix Multiplication in SciDB and Setting the Number of Worker Instances in SciDB and Running Matrix Multiplication Piecemeal”, Available Online at <http://dllahr.blogspot.com/2012… [cited by applicant]
Merchant et al., “Accelerating BLAS on Custom Architecture through Algorithm-Architecture Co-design”, arXiv:1610.06385v5 [cs.AR], Nov. 27, 2016, pp. 1-15. [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 15/201,442, May 4, 2018, 11 pages. [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 15/858,916, Apr. 7, 2021, 14 pages. [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 15/858,916, Apr. 6, 2022, 18 pages. [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 15/858,916, Sep. 16, 2019, 9 pages. [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 15/858,932, Dec. 27, 2019, 7 pages. [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 15/858,932, May 3, 2019, 11 pages. [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 15/858,937, Mar. 22, 2021, 14 pages. [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 15/858,937, Dec. 22, 2022, 21 pages. [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 15/858,937, Sep. 3, 2019, 21 pages. [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 15/858,947, May 6, 2019, 7 pages. [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 15/859,268, Feb. 2, 2023, 14 pages. [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 15/859,268, Mar. 2, 2022, 15 pages. [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 15/859,268, Oct. 1, 2020, 10 pages. [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 15/859,268, May 28, 2019, 8 pages. [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 15/859,271, Mar. 9, 2021, 21 pages. [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 15/859,271, Mar. 2, 2022, 20 pages. [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 15/859,271, Sep. 12, 2019, 9 pages. [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 16/398,200, Jul. 28, 2020, 16 pages. [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 17/335,377, Jul. 25, 2022, 5 pages. [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 17/398,927, Jun. 20, 2022, 7 pages. [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Jan. 27, 2021 for U.S. Appl. No. 15/858,947, 9 pages. [cited by applicant]
Notice of Allowance, U.S. Appl. No. 15/201,442, Dec. 14, 2018, 5 pages. [cited by applicant]
Notice of Allowance, U.S. Appl. No. 15/858,916, Jun. 15, 2023, 7 pages. [cited by applicant]
Notice of Allowance, U.S. Appl. No. 15/858,916, Sep. 12, 2023, 2 pages. [cited by applicant]
Notice of Allowance, U.S. Appl. No. 15/858,932, Apr. 21, 2021, 9 pages. [cited by applicant]
Notice of Allowance, U.S. Appl. No. 15/858,932, Jun. 2, 2020, 9 pages. [cited by applicant]
Notice of Allowance, U.S. Appl. No. 15/858,932, May 12, 2021, 7 pages. [cited by applicant]
Notice of Allowance, U.S. Appl. No. 15/858,932, Sep. 10, 2019, 8 pages. [cited by applicant]
Notice of Allowance, U.S. Appl. No. 15/858,937, Jul. 11, 2023, 9 pages. [cited by applicant]
Notice of Allowance, U.S. Appl. No. 15/858,947, Jan. 27, 2021, 9 pages. [cited by applicant]
Notice of Allowance, U.S. Appl. No. 15/859,268, Jul. 12, 2023, 9 pages. [cited by applicant]
Notice of Allowance, U.S. Appl. No. 15/859,268, Oct. 13, 2023, 2 pages. [cited by applicant]
Notice of Allowance, U.S. Appl. No. 15/859,271, Jan. 25, 2023, 13 pages. [cited by applicant]
Notice of Allowance, U.S. Appl. No. 17/335,377, Feb. 16, 2023, 2 pages. [cited by applicant]
Notice of Allowance, U.S. Appl. No. 17/335,377, Jan. 10, 2023, 7 pages. [cited by applicant]
Notice of Allowance, U.S. Appl. No. 17/398,927, Feb. 22, 2023, 5 pages. [cited by applicant]
Notice of Allowance, U.S. Appl. No. 17/398,927, Jan. 10, 2023, 6 pages. [cited by applicant]
Notice of Allowance, U.S. Appl. No. 17/398,927, Nov. 17, 2022, 10 pages. [cited by applicant]
Office Action, DE App. No. 102018010465.7, Jun. 8, 2022, 28 pages of Original Document Only. [cited by applicant]
Office Action, DE App. No. 102018010565.3, Nov. 23, 2023, 10 pages of Original Document Only. [cited by applicant]
Office Action, DE App. No. 102018125971.9, Nov. 27, 2023, 12 pages of Original Document Only. [cited by applicant]
Okuyama et al., “Design of a Coarse-Grained Processing Element for Matrix Multiplication on FPGA”, 2014 IEEE 8th International Symposium on Embedded Multicore/Manycore SoCs, 2014, pp. 237-241. [cited by applicant]
Pedram et al., “Co-Design Tradeoffs for High-Performance, Low-Power Linear Algebra Architectures”, IEEE Transactions on Computers, vol. 61, No. 12, Dec. 2012, pp. 1724-1736. [cited by applicant]
Pedram et al., “On the Efficiency of Register File versus Broadcast Interconnect for Collective Communications in Data-Parallel Hardware Accelerators”, 2012 IEEE 24th International Symposium on Computer Architecture and… [cited by applicant]
Takahashi et al., “Design and Power Performance Evaluation of On-Chip Memory Processor with Arithmetic Accelerators”, 2008 International Workshop on Innovative Architecture for Future Generation High-Performance Process… [cited by applicant]
Wikipedia, “Basic Linear Algebra Subprograms”, In: Wikipedia, the free encyclopedia, Available Online at <https://en.wikipedia.org/w/index.php?title=Basic_Linear Algebra_ Subprograms&oldid=S14369141>, Dec. 8, 2017, 10 p… [cited by applicant]
Wikipedia, “Communication-avoiding algorithm”, In: Wikipedia, the free encyclopedia, Available Online at <https://en.wikipedia.org/w/index.php?title=Communication-avoiding_algorithm&oldid=701848984>, Jan. 26, 2016, 4 pa… [cited by applicant]
Wikipedia, “Matrix multiplication algorithm”, In: Wikipedia, the free encyclopedia, Available Online at <https://en.wikipedia.org/w/index.php?title=Matrix_multiplication_algorithm&oldid=808248148>, Nov. 1, 2017, 10 page… [cited by applicant]
Wikipedia, “Multiply-accumulate operation”, In: Wikipedia, the free encyclopedia, Available Online at <https://en.wikipedia.org/w/index.php?title=Multiply%E2%80%93accumulate_operation&oldid=784090047>, Jun. 6, 2017, 4 p… [cited by applicant]
Wikipedia, “Systolic array”, In: Wikipedia, the free encyclopedia, Available Online at <https://en.wikipedia.org/w/index.php?title=Systolic_ array&oldid=771564406>, Mar. 22, 2017, 5 pages. [cited by applicant]
Eiron et al., “Matrix Multiplication: A Case Study of Algorithm Engineering”, 2nd Workshop on Algorithm Engineering (WAE98), 1998, pp. 98-109. [cited by applicant]
International Preliminary Reporton Patentability, PCT App. No. PCT/US2017/036038, Jan. 17, 2019, 14 pages. [cited by applicant]
Joerg-Henrik Heine, “RDocumentation—Pair—Rasch Item Parameter”, RDocumentation, Version 0.3.1,2015, https://www.rdocumentation.org/packages/pairwise/versions/0.3.1/topics/pair (Year: 2015). [cited by applicant]
Lahr Dave, “Timing Matrix Multiplication in SciDB and Setting the Number of Worker Instances in SciDB and RunningMatrix Multiplication Piecemeal”, Available Online at <http://dllahr.blogspot.com/2012/11/timing-matrix-mu… [cited by applicant]
Okuyama et al., “Design of a Coarse-Grained Processing Element for Matrix Multiplication on FPGA”, 2014 IEEE 8th International Symposium on Embedded Multicore/Manycore SoCs, Sep. 23-25, 2014, pp. 237-241. [cited by applicant]