Invention Grant
- Patent Title: Variable format, variable sparsity matrix multiplication instruction
-
Application No.: US16003545Application Date: 2018-06-08
-
Publication No.: US10599429B2Publication Date: 2020-03-24
- Inventor: Mark A. Anders , Himanshu Kaul , Sanu Mathew
- Applicant: Intel Corporation
- Applicant Address: US CA Santa Clara
- Assignee: Intel Corporation
- Current Assignee: Intel Corporation
- Current Assignee Address: US CA Santa Clara
- Agency: Nicholson De Vos Webster & Elliott, LLP
- Main IPC: G06F9/30
- IPC: G06F9/30 ; G06F17/16 ; G06N20/00 ; G06N3/063

Abstract:
Disclosed embodiments relate to a variable format, variable sparsity matrix multiplication (VFVSMM) instruction. In one example, a processor includes fetch and decode circuitry to fetch and decode a VFVSMM instruction specifying locations of A, B, and C matrices having (M×K), (K×N), and (M×N) elements, respectively, execution circuitry, responsive to the decoded VFVSMM instruction, to: route each row of the specified A matrix, staggering subsequent rows, into corresponding rows of a (M×N) processing array, and route each column of the specified B matrix, staggering subsequent columns, into corresponding columns of the processing array, wherein each of the processing units is to generate K products of A-matrix elements and matching B-matrix elements having a same row address as a column address of the A-matrix element, and to accumulate each generated product with a corresponding C-matrix element.
Public/Granted literature
- US20190042250A1 VARIABLE FORMAT, VARIABLE SPARSITY MATRIX MULTIPLICATION INSTRUCTION Public/Granted day:2019-02-07
Information query