SYSTEMS AND METHODS TO ACCELERATE MULTIPLICATION OF SPARSE MATRICES

Disclosed embodiments relate to accelerating multiplication of sparse matrices. In one example, a processor is to fetch and decode an instruction having fields to specify locations of first, second, and third matrices, and an opcode indicating the processor is to multiply and accumulate matching non...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: CHARNEY, Mark J, SADE, Raanan, HUGHES, Christopher J, OULD-AHMED-VALL, Elmoustapha, VALENTINE, Robert, HEINECKE, Alexander F, KOREN, Chen, ESPIG, Michael, BAUM, Dan
Format: Patent
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator CHARNEY, Mark J
SADE, Raanan
HUGHES, Christopher J
OULD-AHMED-VALL, Elmoustapha
VALENTINE, Robert
HEINECKE, Alexander F
KOREN, Chen
ESPIG, Michael
BAUM, Dan
description Disclosed embodiments relate to accelerating multiplication of sparse matrices. In one example, a processor is to fetch and decode an instruction having fields to specify locations of first, second, and third matrices, and an opcode indicating the processor is to multiply and accumulate matching non-zero (NZ) elements of the first and second matrices with corresponding elements of the third matrix, and executing the decoded instruction as per the opcode to generate NZ bitmasks for the first and second matrices, broadcast up to two NZ elements at a time from each row of the first matrix and each column of the second matrix to a processing engine (PE) grid, each PE to multiply and accumulate matching NZ elements of the first and second matrices with corresponding elements of the third matrix. Each PE further to store an NZ element for use in a subsequent multiplications.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2020210517A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2020210517A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2020210517A13</originalsourceid><addsrcrecordid>eNrjZHAOjgwOcfUNVnD0c1HwdQ3x8HcJVgjxV3B0dnb1cQ1yDHFV8A31CfEM8PF0dgzx9PdT8HdTCA5wDAoGSjiGBHk6uwbzMLCmJeYUp_JCaW4GZTfXEGcP3dSC_PjU4oLE5NS81JL40GAjAyA0NDA1NHc0NCZOFQDrWCx6</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>SYSTEMS AND METHODS TO ACCELERATE MULTIPLICATION OF SPARSE MATRICES</title><source>esp@cenet</source><creator>CHARNEY, Mark J ; SADE, Raanan ; HUGHES, Christopher J ; OULD-AHMED-VALL, Elmoustapha ; VALENTINE, Robert ; HEINECKE, Alexander F ; KOREN, Chen ; ESPIG, Michael ; BAUM, Dan</creator><creatorcontrib>CHARNEY, Mark J ; SADE, Raanan ; HUGHES, Christopher J ; OULD-AHMED-VALL, Elmoustapha ; VALENTINE, Robert ; HEINECKE, Alexander F ; KOREN, Chen ; ESPIG, Michael ; BAUM, Dan</creatorcontrib><description>Disclosed embodiments relate to accelerating multiplication of sparse matrices. In one example, a processor is to fetch and decode an instruction having fields to specify locations of first, second, and third matrices, and an opcode indicating the processor is to multiply and accumulate matching non-zero (NZ) elements of the first and second matrices with corresponding elements of the third matrix, and executing the decoded instruction as per the opcode to generate NZ bitmasks for the first and second matrices, broadcast up to two NZ elements at a time from each row of the first matrix and each column of the second matrix to a processing engine (PE) grid, each PE to multiply and accumulate matching NZ elements of the first and second matrices with corresponding elements of the third matrix. Each PE further to store an NZ element for use in a subsequent multiplications.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2020</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20200702&amp;DB=EPODOC&amp;CC=US&amp;NR=2020210517A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76290</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20200702&amp;DB=EPODOC&amp;CC=US&amp;NR=2020210517A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>CHARNEY, Mark J</creatorcontrib><creatorcontrib>SADE, Raanan</creatorcontrib><creatorcontrib>HUGHES, Christopher J</creatorcontrib><creatorcontrib>OULD-AHMED-VALL, Elmoustapha</creatorcontrib><creatorcontrib>VALENTINE, Robert</creatorcontrib><creatorcontrib>HEINECKE, Alexander F</creatorcontrib><creatorcontrib>KOREN, Chen</creatorcontrib><creatorcontrib>ESPIG, Michael</creatorcontrib><creatorcontrib>BAUM, Dan</creatorcontrib><title>SYSTEMS AND METHODS TO ACCELERATE MULTIPLICATION OF SPARSE MATRICES</title><description>Disclosed embodiments relate to accelerating multiplication of sparse matrices. In one example, a processor is to fetch and decode an instruction having fields to specify locations of first, second, and third matrices, and an opcode indicating the processor is to multiply and accumulate matching non-zero (NZ) elements of the first and second matrices with corresponding elements of the third matrix, and executing the decoded instruction as per the opcode to generate NZ bitmasks for the first and second matrices, broadcast up to two NZ elements at a time from each row of the first matrix and each column of the second matrix to a processing engine (PE) grid, each PE to multiply and accumulate matching NZ elements of the first and second matrices with corresponding elements of the third matrix. Each PE further to store an NZ element for use in a subsequent multiplications.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2020</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZHAOjgwOcfUNVnD0c1HwdQ3x8HcJVgjxV3B0dnb1cQ1yDHFV8A31CfEM8PF0dgzx9PdT8HdTCA5wDAoGSjiGBHk6uwbzMLCmJeYUp_JCaW4GZTfXEGcP3dSC_PjU4oLE5NS81JL40GAjAyA0NDA1NHc0NCZOFQDrWCx6</recordid><startdate>20200702</startdate><enddate>20200702</enddate><creator>CHARNEY, Mark J</creator><creator>SADE, Raanan</creator><creator>HUGHES, Christopher J</creator><creator>OULD-AHMED-VALL, Elmoustapha</creator><creator>VALENTINE, Robert</creator><creator>HEINECKE, Alexander F</creator><creator>KOREN, Chen</creator><creator>ESPIG, Michael</creator><creator>BAUM, Dan</creator><scope>EVB</scope></search><sort><creationdate>20200702</creationdate><title>SYSTEMS AND METHODS TO ACCELERATE MULTIPLICATION OF SPARSE MATRICES</title><author>CHARNEY, Mark J ; SADE, Raanan ; HUGHES, Christopher J ; OULD-AHMED-VALL, Elmoustapha ; VALENTINE, Robert ; HEINECKE, Alexander F ; KOREN, Chen ; ESPIG, Michael ; BAUM, Dan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2020210517A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2020</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>CHARNEY, Mark J</creatorcontrib><creatorcontrib>SADE, Raanan</creatorcontrib><creatorcontrib>HUGHES, Christopher J</creatorcontrib><creatorcontrib>OULD-AHMED-VALL, Elmoustapha</creatorcontrib><creatorcontrib>VALENTINE, Robert</creatorcontrib><creatorcontrib>HEINECKE, Alexander F</creatorcontrib><creatorcontrib>KOREN, Chen</creatorcontrib><creatorcontrib>ESPIG, Michael</creatorcontrib><creatorcontrib>BAUM, Dan</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>CHARNEY, Mark J</au><au>SADE, Raanan</au><au>HUGHES, Christopher J</au><au>OULD-AHMED-VALL, Elmoustapha</au><au>VALENTINE, Robert</au><au>HEINECKE, Alexander F</au><au>KOREN, Chen</au><au>ESPIG, Michael</au><au>BAUM, Dan</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>SYSTEMS AND METHODS TO ACCELERATE MULTIPLICATION OF SPARSE MATRICES</title><date>2020-07-02</date><risdate>2020</risdate><abstract>Disclosed embodiments relate to accelerating multiplication of sparse matrices. In one example, a processor is to fetch and decode an instruction having fields to specify locations of first, second, and third matrices, and an opcode indicating the processor is to multiply and accumulate matching non-zero (NZ) elements of the first and second matrices with corresponding elements of the third matrix, and executing the decoded instruction as per the opcode to generate NZ bitmasks for the first and second matrices, broadcast up to two NZ elements at a time from each row of the first matrix and each column of the second matrix to a processing engine (PE) grid, each PE to multiply and accumulate matching NZ elements of the first and second matrices with corresponding elements of the third matrix. Each PE further to store an NZ element for use in a subsequent multiplications.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2020210517A1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title SYSTEMS AND METHODS TO ACCELERATE MULTIPLICATION OF SPARSE MATRICES
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T15%3A20%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=CHARNEY,%20Mark%20J&rft.date=2020-07-02&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2020210517A1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true