IP Library Granted Patent US 12,282,525
Granted Patent B2
US 12,282,525 · App. 18/386,771 · Granted Apr 22, 2025

Systems, methods, and apparatuses for matrix operations

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 (Chandler, AZ); Menachem Adelman (Modi'in, IL)
Assignee: Intel Corporation
G06F17/16G06F9/30036G06F9/30038G06F9/30101
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,282,525
App. No.
18/386,771
Filed
Nov 3, 2023
Granted
Apr 22, 2025
Kind
B2
Art Unit
2182
USPC
712/208
Abstract

Embodiments detailed herein relate to matrix (tile) operations. For example, decode circuitry to decode an instruction having fields for an opcode and a memory address, and execution circuitry to execute the decoded instruction to store configuration information about usage of storage for two-dimensional data structures at the memory address.

Claims (21)

1. An apparatus comprising:

decode circuitry configured to decode at least an instance of a single instruction having an opcode and memory location information, wherein the opcode is to indicate execution circuitry is to retrieve configuration information about how storage of the apparatus was configured as two-dimensional data structures to be used by execution circuitry configured to perform two-dimensional matrix operations and store the retrieved configuration information as description data at a memory location to be identified from the memory location information, wherein the description data is to include a palette identifier, and a value to indicate a row to be used to restart; and

execution circuitry, in response to the decoded instance of the single instruction, to be configured to execute the decoded instance of the single instruction according to the opcode.

2. The apparatus of claim 1 , wherein the storage is a plurality of packed data registers and the two-dimensional data structures are overlaid on the plurality of packed data registers.

3. The apparatus of claim 1 , wherein the memory location is to be accessed using information to be stored in a scale-index-base format.

4. The apparatus of claim 1 , wherein the description data comprises an index into a table which is to store a number of bytes in a two-dimensional data structure, and bytes per row of the two-dimensional data structure and indications of a number of rows and columns per two-dimensional data structure.

5. The apparatus of claim 1 , wherein the description data is to be retrieved from at least one register of the apparatus.

6. An apparatus comprising:

a processor core comprising decode circuitry configured to decode at least an instance of a single instruction having an opcode and memory location information, wherein the opcode is to indicate execution circuitry is to retrieve configuration information about how storage of the apparatus was configured as two-dimensional data structures to be used by execution circuitry configured to perform two-dimensional matrix operations and store the retrieved configuration information as description data at a memory location to be identified from the memory location information, wherein the description data is to include a palette identifier, and a value to indicate a row to be used to restart; and

an accelerator comprising execution circuitry, in response to the decoded instance of the single instruction, to be configured to execute the decoded instance of the single instruction according to the opcode.

7. The apparatus of claim 6 , wherein the storage is a plurality of packed data registers and the two-dimensional data structures are overlaid on the plurality of packed data registers.

8. The apparatus of claim 6 , wherein the memory location is to be accessed using information to be stored in a scale-index-base format.

9. The apparatus of claim 6 , wherein the description data comprises an index into a table which is to store a number of bytes in a two-dimensional data structure, and bytes per row of the two-dimensional data structure and indications of a number of rows and columns per two-dimensional data structure.

10. The apparatus of claim 6 , wherein the description data is to be retrieved from at least one register of the apparatus.

11. A non-transitory machine readable medium storing an occurrence of an instruction, wherein a processor upon encountering the occurrence of the instruction is to perform a method comprising:

decoding at least an instance of a single instruction having an opcode and memory location information, wherein the opcode is to indicate execution circuitry is to retrieve configuration information about how storage of an apparatus was configured as two-dimensional data structures to be used by execution circuitry configured to perform two-dimensional matrix operations and store the retrieved configuration information as description data at a memory location to be identified from the memory location information, wherein the description data is to include a palette identifier, and a value to indicate a row to be used to restart; and

executing the decoded instance of the single instruction to retrieve configuration information about how storage of an apparatus was configured as two-dimensional data structures to be used by execution circuitry configured to perform two-dimensional matrix operations and store the retrieved configuration information as description data at a memory location identified from the memory location information.

12. The non-transitory machine readable medium of claim 11 , wherein the storage is a plurality of packed data registers and the two-dimensional data structures are overlaid on the plurality of packed data registers.

13. The non-transitory machine readable medium of claim 11 , wherein the memory location is accessed using information to be stored in a scale-index-base format.

14. The non-transitory machine readable medium of claim 11 , wherein the description data comprises an index into a table which is to store a number of bytes in a two-dimensional data structure, and bytes per row of the two-dimensional data structure and indications of a number of rows and columns per two-dimensional data structure.

15. The non-transitory machine readable medium of claim 11 , wherein the description data is to be retrieved from at least one register.

Continuity (2)
Continuation 15859268 · Dec 29, 2017
Related Publication 20240143325A1 · May 2, 2024
References Cited (197)
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 et al. · 2020 [cited by applicant]
US 10671913B2 · Liu et al. · 2020 [cited by applicant]
US 10719323B2 · Baum et al. · 2020 [cited by applicant]
US 10838734B2 · Hughes et al. · 2020 [cited by applicant]
US 10853067B2 · Henry et al. · 2020 [cited by applicant]
US 10860681B2 · Zhang et al. · 2020 [cited by applicant]
US 10866786B2 · Sade et al. · 2020 [cited by applicant]
US 10896043B2 · Toll et al. · 2021 [cited by applicant]
US 10922077B2 · Espig et al. · 2021 [cited by applicant]
US 10929503B2 · Azizi et al. · 2021 [cited by applicant]
US 10942985B2 · Espig et al. · 2021 [cited by applicant]
US 10963246B2 · Heinecke et al. · 2021 [cited by applicant]
US 10963256B2 · Sade et al. · 2021 [cited by applicant]
US 10970076B2 · Ould-Ahmed-Vall et al. · 2021 [cited by applicant]
US 10990396B2 · Toll et al. · 2021 [cited by applicant]
US 11023235B2 · Sade et al. · 2021 [cited by applicant]
US 11093247B2 · Sade et al. · 2021 [cited by applicant]
US 11163565B2 · Valentine et al. · 2021 [cited by applicant]
US 11294671B2 · Hughes et al. · 2022 [cited by applicant]
US 11567765B2 · Valentine et al. · 2023 [cited by applicant]
US 11579883B2 · Hughes et al. · 2023 [cited by applicant]
US 11669326B2 · Sade et al. · 2023 [cited by applicant]
US 11809869B2 · Sade et al. · 2023 [cited by applicant]
US 11816483B2 · 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 et al. · 2009 [cited by applicant]
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 20130013843A1 · Radovic et al. · 2013 [cited by applicant]
US 20130073599A1 · Maloney · 2013 [cited by applicant]
US 20130290680A1 · Keller et al. · 2013 [cited by applicant]
US 20130305020A1 · Valentine et al. · 2013 [cited by applicant]
US 20140032876A1 · Burkart et al. · 2014 [cited by applicant]
US 20140095842A1 · Caprioli et al. · 2014 [cited by applicant]
US 20140149480A1 · Catanzaro et al. · 2014 [cited by applicant]
US 20150067302A1 · Gueron · 2015 [cited by applicant]
US 20150081753A1 · Iyer et al. · 2015 [cited by applicant]
US 20150199266A1 · Franchetti et al. · 2015 [cited by applicant]
US 20150249468A1 · Nikkila et al. · 2015 [cited by applicant]
US 20150356054A1 · Barak et al. · 2015 [cited by applicant]
US 20160063284A1 · Tiwari · 2016 [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 20170132008A1 · Uliel 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 et al. · 2019 [cited by applicant]
US 20220091848A1 · Sade et al. · 2022 [cited by applicant]
US 20240143325A1 · Sade · 2024 [cited by examiner]
CN 102918495A · 2013 [cited by applicant]
CN 103377037A · 2013 [cited by applicant]
CN 104603766A · 2015 [cited by applicant]
EP 2889758A2 · 2015 [cited by applicant]
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]
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, 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]
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/036038, Jan. 17, 2019, 14 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, Version 0.3.1,2015, https://www.rdocumentation.org/packages/pairwise/versions/0.3.1/topics/pair (Year: 2015). [cited by applicant]
Lahr, David L., “Distractions: Timing Matrix Multiplication in SciDB and Setting the No. of Worker Instances in SciDB and Running Matrix Multiplication Piecemeal”, Available Online at <http://dllahr.blogspot.com/2012/11… [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]
Eiron et al., “Matrix Multiplication: A Case Study of Algorithm Engineering”, 2nd Workshop on Algorithm Engineering (WAE98), 1998, pp. 98-109. [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 Dave, “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/11/timing-matrix-m… [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 18/186,710, Jul. 17, 2024, 11 pages. [cited by applicant]
Non-Final Office Action, U.S. Appl. No. 18/386,407, Jun. 26, 2024, 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]
Office Action, CN App. No. 202111269207.5, Nov. 29, 2024, 07 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, Sep. 23-25, 2014, pp. 237-241. [cited by applicant]
Reviriego et al., “An Efficient Technique to Protect Serial Shift Registers Against Soft Errors”, IEEE Transactions On Circuits and Systems—II: Express Briefs, vol. 60, No. 8, Aug. 2013, 5 pages. [cited by applicant]