Communication lower bounds for distributed-memory matrix multiplication (Q1886368)

From MaRDI portal
Revision as of 21:48, 4 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57275426, #quickstatements; #temporary_batch_1712261475387)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Communication lower bounds for distributed-memory matrix multiplication
scientific article

    Statements

    title
    Communication lower bounds for distributed-memory matrix multiplication (English)
    0 references
    author
    Dror Irony
    0 references
    Sivan Toledo
    0 references
    Alexander Tiskin
    0 references
    publication date
    18 November 2004
    0 references
    zbMATH Keywords
    Communication
    0 references
    Lower bounds
    0 references
    Distributed memory
    0 references
    Matrix multiplication
    0 references
    describes a project that uses
    PHiPAC
    0 references
    GEMM
    0 references
    ATLAS
    0 references
    SUMMA
    0 references

    Identifiers

    zbMATH DE Number
    2116276
    0 references
    OpenAlex ID
    W2010747199
    0 references
    Wikidata QID
    Q57275426
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1886368&oldid=33242765"
    Powered by MediaWiki