kth.sePublikationer KTH
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Matrix Engines for High Performance Computing: A Paragon of Performance or Grasping at Straws?
RIKEN, CCS, Kobe, Hyogo, Japan.;Tokyo Inst Technol, Tokyo, Japan..
RIKEN, CCS, Kobe, Hyogo, Japan.;Tokyo Inst Technol, Tokyo, Japan..ORCID-id: 0000-0001-7494-5048
RIKEN, CCS, Kobe, Hyogo, Japan.;Tokyo Inst Technol, Tokyo, Japan..
Natl Inst Adv Ind Sci & Technol, Tokyo, Japan..
Visa övriga samt affilieringar
2021 (Engelska)Ingår i: 2021 IEEE 35TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), Institute of Electrical and Electronics Engineers (IEEE) , 2021, s. 1056-1065Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

Matrix engines or units, in different forms and affinities, are becoming a reality in modern processors; CPUs and otherwise. The current and dominant algorithmic approach to Deep Learning merits the commercial investments in these units, and deduced from the No.1 benchmark in supercomputing, namely High Performance Linpack, one would expect an awakened enthusiasm by the HPC community, too. Hence, our goal is to identify the practical added benefits for HPC and machine learning applications by having access to matrix engines. For this purpose, we perform an in-depth survey of software stacks, proxy applications and benchmarks, and historical batch job records. We provide a cost-benefit analysis of matrix engines, both asymptotically and in conjunction with state-of-the-art processors. While our empirical data will temper the enthusiasm, we also outline opportunities to misuse these dense matrix-multiplication engines if they come for free.

Ort, förlag, år, upplaga, sidor
Institute of Electrical and Electronics Engineers (IEEE) , 2021. s. 1056-1065
Serie
International Parallel and Distributed Processing Symposium IPDPS, ISSN 1530-2075
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
URN: urn:nbn:se:kth:diva-303380DOI: 10.1109/IPDPS49936.2021.00114ISI: 000695273000106Scopus ID: 2-s2.0-85110825497OAI: oai:DiVA.org:kth-303380DiVA, id: diva2:1603382
Konferens
35th IEEE International Parallel and Distributed Processing Symposium (IPDPS), MAY 17-21, 2021, ELECTR NETWORK
Anmärkning

Part of proceedings: ISBN 978-1-6654-4066-0, QC 20230117

Tillgänglig från: 2021-10-15 Skapad: 2021-10-15 Senast uppdaterad: 2023-01-17Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Person

Podobas, Artur

Sök vidare i DiVA

Av författaren/redaktören
Vatai, EmilMukunoki, DaichiPodobas, Artur
Av organisationen
Beräkningsvetenskap och beräkningsteknik (CST)
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 87 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf