Matches in SemOpenAlex for { <https://semopenalex.org/work/W2941605743> ?p ?o ?g. }
- W2941605743 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.
- W2941605743 created "2019-05-03" @default.
- W2941605743 creator A5033637373 @default.
- W2941605743 date "2019-04-29" @default.
- W2941605743 modified "2023-09-23" @default.
- W2941605743 title "The I/O complexity of hybrid algorithms for square matrix multiplication" @default.
- W2941605743 cites W1525570549 @default.
- W2941605743 cites W1526545853 @default.
- W2941605743 cites W1564514837 @default.
- W2941605743 cites W1598993252 @default.
- W2941605743 cites W1744930860 @default.
- W2941605743 cites W1967894204 @default.
- W2941605743 cites W1972501001 @default.
- W2941605743 cites W1986272312 @default.
- W2941605743 cites W2004916460 @default.
- W2941605743 cites W2010747199 @default.
- W2941605743 cites W2011717090 @default.
- W2941605743 cites W201315547 @default.
- W2941605743 cites W2023122441 @default.
- W2941605743 cites W2035476608 @default.
- W2941605743 cites W2038142281 @default.
- W2941605743 cites W2040832766 @default.
- W2941605743 cites W2061851195 @default.
- W2941605743 cites W2087674115 @default.
- W2941605743 cites W2090322880 @default.
- W2941605743 cites W2119106791 @default.
- W2941605743 cites W2120248756 @default.
- W2941605743 cites W2164946224 @default.
- W2941605743 cites W2165156793 @default.
- W2941605743 cites W2521053666 @default.
- W2941605743 cites W2556863009 @default.
- W2941605743 cites W28521761 @default.
- W2941605743 cites W2903237208 @default.
- W2941605743 cites W2951415183 @default.
- W2941605743 cites W2953128281 @default.
- W2941605743 cites W2971930414 @default.
- W2941605743 cites W3103849684 @default.
- W2941605743 cites W2404014258 @default.
- W2941605743 cites W2963372459 @default.
- W2941605743 hasPublicationYear "2019" @default.
- W2941605743 type Work @default.
- W2941605743 sameAs 2941605743 @default.
- W2941605743 citedByCount "0" @default.
- W2941605743 crossrefType "posted-content" @default.
- W2941605743 hasAuthorship W2941605743A5033637373 @default.
- W2941605743 hasConcept C106487976 @default.
- W2941605743 hasConcept C114614502 @default.
- W2941605743 hasConcept C118615104 @default.
- W2941605743 hasConcept C121332964 @default.
- W2941605743 hasConcept C134306372 @default.
- W2941605743 hasConcept C159985019 @default.
- W2941605743 hasConcept C17349429 @default.
- W2941605743 hasConcept C192562407 @default.
- W2941605743 hasConcept C201290732 @default.
- W2941605743 hasConcept C2524010 @default.
- W2941605743 hasConcept C2779557605 @default.
- W2941605743 hasConcept C33923547 @default.
- W2941605743 hasConcept C39096654 @default.
- W2941605743 hasConcept C48372109 @default.
- W2941605743 hasConcept C62520636 @default.
- W2941605743 hasConcept C77553402 @default.
- W2941605743 hasConcept C84114770 @default.
- W2941605743 hasConcept C90673727 @default.
- W2941605743 hasConcept C94375191 @default.
- W2941605743 hasConceptScore W2941605743C106487976 @default.
- W2941605743 hasConceptScore W2941605743C114614502 @default.
- W2941605743 hasConceptScore W2941605743C118615104 @default.
- W2941605743 hasConceptScore W2941605743C121332964 @default.
- W2941605743 hasConceptScore W2941605743C134306372 @default.
- W2941605743 hasConceptScore W2941605743C159985019 @default.
- W2941605743 hasConceptScore W2941605743C17349429 @default.
- W2941605743 hasConceptScore W2941605743C192562407 @default.
- W2941605743 hasConceptScore W2941605743C201290732 @default.
- W2941605743 hasConceptScore W2941605743C2524010 @default.
- W2941605743 hasConceptScore W2941605743C2779557605 @default.
- W2941605743 hasConceptScore W2941605743C33923547 @default.
- W2941605743 hasConceptScore W2941605743C39096654 @default.
- W2941605743 hasConceptScore W2941605743C48372109 @default.
- W2941605743 hasConceptScore W2941605743C62520636 @default.
- W2941605743 hasConceptScore W2941605743C77553402 @default.
- W2941605743 hasConceptScore W2941605743C84114770 @default.
- W2941605743 hasConceptScore W2941605743C90673727 @default.
- W2941605743 hasConceptScore W2941605743C94375191 @default.
- W2941605743 hasOpenAccess W2941605743 @default.
- W2941605743 hasRelatedWork W1728431544 @default.
- W2941605743 hasRelatedWork W1839377101 @default.
- W2941605743 hasRelatedWork W1974392368 @default.
- W2941605743 hasRelatedWork W1979036815 @default.
- W2941605743 hasRelatedWork W1983863143 @default.
- W2941605743 hasRelatedWork W2005609859 @default.
- W2941605743 hasRelatedWork W2008130084 @default.
- W2941605743 hasRelatedWork W2019755630 @default.
- W2941605743 hasRelatedWork W2031530686 @default.
- W2941605743 hasRelatedWork W226380574 @default.
- W2941605743 hasRelatedWork W2346477972 @default.
- W2941605743 hasRelatedWork W2486198464 @default.
- W2941605743 hasRelatedWork W2951505009 @default.
- W2941605743 hasRelatedWork W2963299230 @default.
- W2941605743 hasRelatedWork W2964011532 @default.
- W2941605743 hasRelatedWork W2992231035 @default.