Matches in SemOpenAlex for { <https://semopenalex.org/work/W3020132311> ?p ?o ?g. }
- W3020132311 endingPage "496" @default.
- W3020132311 startingPage "483" @default.
- W3020132311 abstract "Polyhedral compilation has been successful in the design and implementation of complex loop nest optimizers and parallelizing compilers. The algorithmic complexity and scalability limitations remain one important weakness. We address it using sub-polyhedral under-aproximations of the systems of constraints resulting from affine scheduling problems. We propose a sub-polyhedral scheduling technique using (Unit-)Two-Variable-Per-Inequality or (U)TVPI Polyhedra. This technique relies on simple polynomial time algorithms to under-approximate a general polyhedron into (U)TVPI polyhedra. We modify the state-of-the-art PLuTo compiler using our scheduling technique, and show that for a majority of the Polybench (2.0) kernels, the above under-approximations yield polyhedra that are non-empty. Solving the under-approximated system leads to asymptotic gains in complexity, and shows practically significant improvements when compared to a traditional LP solver. We also verify that code generated by our sub-polyhedral parallelization prototype matches the performance of PLuTo-optimized code when the under-approximation preserves feasibility." @default.
- W3020132311 created "2020-05-01" @default.
- W3020132311 creator A5049923423 @default.
- W3020132311 creator A5075524478 @default.
- W3020132311 date "2013-01-23" @default.
- W3020132311 modified "2023-09-30" @default.
- W3020132311 title "Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra" @default.
- W3020132311 cites W1509560532 @default.
- W3020132311 cites W1518247129 @default.
- W3020132311 cites W1598202309 @default.
- W3020132311 cites W1723902394 @default.
- W3020132311 cites W1772407568 @default.
- W3020132311 cites W1823736747 @default.
- W3020132311 cites W1970141743 @default.
- W3020132311 cites W1991031013 @default.
- W3020132311 cites W1994293250 @default.
- W3020132311 cites W2000472767 @default.
- W3020132311 cites W2019609597 @default.
- W3020132311 cites W2034053794 @default.
- W3020132311 cites W2034761517 @default.
- W3020132311 cites W2038543880 @default.
- W3020132311 cites W2049745956 @default.
- W3020132311 cites W2055383402 @default.
- W3020132311 cites W2062873592 @default.
- W3020132311 cites W2073873127 @default.
- W3020132311 cites W2079235644 @default.
- W3020132311 cites W2080333071 @default.
- W3020132311 cites W2087970026 @default.
- W3020132311 cites W2090286414 @default.
- W3020132311 cites W2106473597 @default.
- W3020132311 cites W2132331020 @default.
- W3020132311 cites W2135736783 @default.
- W3020132311 cites W2139559439 @default.
- W3020132311 cites W2149546641 @default.
- W3020132311 cites W2150529683 @default.
- W3020132311 cites W2151888904 @default.
- W3020132311 cites W2152506070 @default.
- W3020132311 cites W2155488254 @default.
- W3020132311 cites W2165086189 @default.
- W3020132311 cites W2169287093 @default.
- W3020132311 cites W2171048544 @default.
- W3020132311 cites W2227557434 @default.
- W3020132311 cites W2293095839 @default.
- W3020132311 cites W2340604309 @default.
- W3020132311 cites W3100198463 @default.
- W3020132311 cites W3158747708 @default.
- W3020132311 cites W4231316372 @default.
- W3020132311 cites W4298290503 @default.
- W3020132311 cites W77311303 @default.
- W3020132311 doi "https://doi.org/10.1145/2480359.2429127" @default.
- W3020132311 hasPublicationYear "2013" @default.
- W3020132311 type Work @default.
- W3020132311 sameAs 3020132311 @default.
- W3020132311 citedByCount "4" @default.
- W3020132311 countsByYear W30201323112014 @default.
- W3020132311 countsByYear W30201323112015 @default.
- W3020132311 countsByYear W30201323112016 @default.
- W3020132311 countsByYear W30201323112018 @default.
- W3020132311 crossrefType "journal-article" @default.
- W3020132311 hasAuthorship W3020132311A5049923423 @default.
- W3020132311 hasAuthorship W3020132311A5075524478 @default.
- W3020132311 hasBestOaLocation W30201323112 @default.
- W3020132311 hasConcept C113391598 @default.
- W3020132311 hasConcept C11413529 @default.
- W3020132311 hasConcept C114614502 @default.
- W3020132311 hasConcept C118615104 @default.
- W3020132311 hasConcept C126255220 @default.
- W3020132311 hasConcept C1306188 @default.
- W3020132311 hasConcept C145691206 @default.
- W3020132311 hasConcept C169590947 @default.
- W3020132311 hasConcept C173608175 @default.
- W3020132311 hasConcept C199360897 @default.
- W3020132311 hasConcept C202444582 @default.
- W3020132311 hasConcept C206729178 @default.
- W3020132311 hasConcept C2778770139 @default.
- W3020132311 hasConcept C33923547 @default.
- W3020132311 hasConcept C41008148 @default.
- W3020132311 hasConcept C48044578 @default.
- W3020132311 hasConcept C54829058 @default.
- W3020132311 hasConcept C77088390 @default.
- W3020132311 hasConcept C92757383 @default.
- W3020132311 hasConceptScore W3020132311C113391598 @default.
- W3020132311 hasConceptScore W3020132311C11413529 @default.
- W3020132311 hasConceptScore W3020132311C114614502 @default.
- W3020132311 hasConceptScore W3020132311C118615104 @default.
- W3020132311 hasConceptScore W3020132311C126255220 @default.
- W3020132311 hasConceptScore W3020132311C1306188 @default.
- W3020132311 hasConceptScore W3020132311C145691206 @default.
- W3020132311 hasConceptScore W3020132311C169590947 @default.
- W3020132311 hasConceptScore W3020132311C173608175 @default.
- W3020132311 hasConceptScore W3020132311C199360897 @default.
- W3020132311 hasConceptScore W3020132311C202444582 @default.
- W3020132311 hasConceptScore W3020132311C206729178 @default.
- W3020132311 hasConceptScore W3020132311C2778770139 @default.
- W3020132311 hasConceptScore W3020132311C33923547 @default.
- W3020132311 hasConceptScore W3020132311C41008148 @default.
- W3020132311 hasConceptScore W3020132311C48044578 @default.
- W3020132311 hasConceptScore W3020132311C54829058 @default.