Matches in SemOpenAlex for { <https://semopenalex.org/work/W4288363829> ?p ?o ?g. }
Showing items 1 to 66 of
66
with 100 items per page.
- W4288363829 abstract "Asymptotically tight lower bounds are derived for the I/O complexity of a general class of hybrid algorithms computing the product of $n times n$ square matrices combining ``emph{Strassen-like}'' fast matrix multiplication approach with computational complexity $Theta{n^{log_2 7}}$, and ``emph{standard}'' matrix multiplication algorithms with computational complexity $Omegaleft(n^3right)$. We present a novel and tight $Omegaleft(left(frac{n}{max{sqrt{M},n_0}}right)^{log_2 7}left(max{1,frac{n_0}{M}}right)^3Mright)$ lower bound for the I/O complexity a class of ``emph{uniform, non-stationary}'' hybrid algorithms when executed in a two-level storage hierarchy with $M$ words of fast memory, where $n_0$ denotes the threshold size of sub-problems which are computed using standard algorithms with algebraic complexity $Omegaleft(n^3right)$. The lower bound is actually derived for the more general class of ``emph{non-uniform, non-stationary}'' hybrid algorithms which allow recursive calls to have a different structure, even when they refer to the multiplication of matrices of the same size and in the same recursive level, although the quantitative expressions become more involved. Our results are the first I/O lower bounds for these classes of hybrid algorithms. All presented lower bounds apply even if the recomputation of partial results is allowed and are asymptotically tight. The proof technique combines the analysis of the Grigoriev's flow of the matrix multiplication function, combinatorial properties of the encoding functions used by fast Strassen-like algorithms, and an application of the Loomis-Whitney geometric theorem for the analysis of standard matrix multiplication algorithms. Extensions of the lower bounds for a parallel model with $P$ processors are also discussed." @default.
- W4288363829 created "2022-07-29" @default.
- W4288363829 creator A5033637373 @default.
- W4288363829 date "2019-04-29" @default.
- W4288363829 modified "2023-10-16" @default.
- W4288363829 title "The I/O complexity of hybrid algorithms for square matrix multiplication" @default.
- W4288363829 doi "https://doi.org/10.48550/arxiv.1904.12804" @default.
- W4288363829 hasPublicationYear "2019" @default.
- W4288363829 type Work @default.
- W4288363829 citedByCount "0" @default.
- W4288363829 crossrefType "posted-content" @default.
- W4288363829 hasAuthorship W4288363829A5033637373 @default.
- W4288363829 hasBestOaLocation W42883638291 @default.
- W4288363829 hasConcept C106487976 @default.
- W4288363829 hasConcept C11413529 @default.
- W4288363829 hasConcept C114614502 @default.
- W4288363829 hasConcept C118615104 @default.
- W4288363829 hasConcept C121332964 @default.
- W4288363829 hasConcept C134306372 @default.
- W4288363829 hasConcept C159985019 @default.
- W4288363829 hasConcept C17349429 @default.
- W4288363829 hasConcept C192562407 @default.
- W4288363829 hasConcept C201290732 @default.
- W4288363829 hasConcept C2779557605 @default.
- W4288363829 hasConcept C33923547 @default.
- W4288363829 hasConcept C39096654 @default.
- W4288363829 hasConcept C48372109 @default.
- W4288363829 hasConcept C62520636 @default.
- W4288363829 hasConcept C77553402 @default.
- W4288363829 hasConcept C84114770 @default.
- W4288363829 hasConcept C94375191 @default.
- W4288363829 hasConceptScore W4288363829C106487976 @default.
- W4288363829 hasConceptScore W4288363829C11413529 @default.
- W4288363829 hasConceptScore W4288363829C114614502 @default.
- W4288363829 hasConceptScore W4288363829C118615104 @default.
- W4288363829 hasConceptScore W4288363829C121332964 @default.
- W4288363829 hasConceptScore W4288363829C134306372 @default.
- W4288363829 hasConceptScore W4288363829C159985019 @default.
- W4288363829 hasConceptScore W4288363829C17349429 @default.
- W4288363829 hasConceptScore W4288363829C192562407 @default.
- W4288363829 hasConceptScore W4288363829C201290732 @default.
- W4288363829 hasConceptScore W4288363829C2779557605 @default.
- W4288363829 hasConceptScore W4288363829C33923547 @default.
- W4288363829 hasConceptScore W4288363829C39096654 @default.
- W4288363829 hasConceptScore W4288363829C48372109 @default.
- W4288363829 hasConceptScore W4288363829C62520636 @default.
- W4288363829 hasConceptScore W4288363829C77553402 @default.
- W4288363829 hasConceptScore W4288363829C84114770 @default.
- W4288363829 hasConceptScore W4288363829C94375191 @default.
- W4288363829 hasLocation W42883638291 @default.
- W4288363829 hasLocation W42883638292 @default.
- W4288363829 hasOpenAccess W4288363829 @default.
- W4288363829 hasPrimaryLocation W42883638291 @default.
- W4288363829 hasRelatedWork W1983419392 @default.
- W4288363829 hasRelatedWork W2043670592 @default.
- W4288363829 hasRelatedWork W2165928982 @default.
- W4288363829 hasRelatedWork W2367131071 @default.
- W4288363829 hasRelatedWork W2521053666 @default.
- W4288363829 hasRelatedWork W3009870468 @default.
- W4288363829 hasRelatedWork W3047787696 @default.
- W4288363829 hasRelatedWork W3091839222 @default.
- W4288363829 hasRelatedWork W4301181185 @default.
- W4288363829 hasRelatedWork W4318225266 @default.
- W4288363829 isParatext "false" @default.
- W4288363829 isRetracted "false" @default.
- W4288363829 workType "article" @default.