Zobrazeno 1 - 10
of 11
pro vyhledávání: '"William S. Moses"'
Autor:
Zifan Carl Guo, William S. Moses
Publikováno v:
2022 IEEE High Performance Extreme Computing Conference (HPEC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::976119698f501549074935af4324ad79
https://doi.org/10.1109/hpec55821.2022.9926313
https://doi.org/10.1109/hpec55821.2022.9926313
Autor:
Jan Hückelheim, Michel Schanen, William S. Moses, Sri Hari Krishna Narayanan, Ludger Paehler, Valentin Churavy, Johannes Doerfert
Publikováno v:
SC
Computing derivatives is key to many algorithms in scientific computing and machine learning such as optimization, uncertainty quantification, and stability analysis. Enzyme is a LLVM compiler plugin that performs reverse-mode automatic differentiati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b3566ed82299aff65453c1bc0bf8da7
https://doi.org/10.1145/3458817.3476165
https://doi.org/10.1145/3458817.3476165
Publikováno v:
PACT
We present Polygeist, a new compilation flow that connects the MLIR compiler infrastructure to cutting edge polyhedral optimization tools. It consists of a C and C++ frontend capable of converting a broad range of existing codes into MLIR suitable fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::14d832ef46823715f4ed384d13c2e555
https://doi.org/10.1109/pact52795.2021.00011
https://doi.org/10.1109/pact52795.2021.00011
Publikováno v:
ACM Transactions on Parallel Computing. 6:1-33
Tapir (pronounced TAY-per) is a compiler intermediate representation (IR) that embeds recursive fork-join parallelism, as supported by task-parallel programming platforms such as Cilk and OpenMP, into a mainstream compiler’s IR. Mainstream compiler
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc0fd1efffdc7f8eab0c1ec2c089747a
https://doi.org/10.1145/3365655
https://doi.org/10.1145/3365655
Autor:
Theodoros Theodoridis, William S. Moses, Albert Cohen, Sven Verdoolaege, Priya Goyal, Oleksandr Zinenko, Andrew Adams, Nicolas Vasilache, Zachary DeVito
Publikováno v:
ACM Transactions on Architecture and Code Optimization. 16:1-26
Deep learning frameworks automate the deployment, distribution, synchronization, memory allocation, and hardware acceleration of models represented as graphs of computational operators. These operators wrap high-performance libraries such as cuDNN or
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a78c501fca6d71cf85f21c821ecd7ef5
https://doi.org/10.1145/3355606
https://doi.org/10.1145/3355606
Publikováno v:
PPOPP
This paper explores how fork-join parallelism, as supported by concurrency platforms such as Cilk and OpenMP, can be embedded into a compiler's intermediate representation (IR). Mainstream compilers typically treat parallel linguistic constructs as s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6d9878afb152431330b47cae1e474992
https://doi.org/10.1145/3155284.3018758
https://doi.org/10.1145/3155284.3018758
Autor:
John Wawrzynek, Ion Stoica, Krste Asanovic, William S. Moses, Ameer Haj-Ali, John Xiang, Qijing Huang
Publikováno v:
FCCM
The performance of the code generated by a compiler depends on the order in which the optimization passes are applied. In high-level synthesis, the quality of the generated circuit relates directly to the code generated by the front-end compiler. Cho
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5d99cff493dc917cda7f75785b58018
https://doi.org/10.1109/fccm.2019.00049
https://doi.org/10.1109/fccm.2019.00049
Publikováno v:
MIT web domain
PMAM@PPoPP
PMAM@PPoPP
© 2019 ACM. Deterministic software transactional memory (STM) is a useful programming model for writing parallel codes, as it improves programmability (by supporting transactions) and debuggability (by supporting determinism). This paper presents Li
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::28863d3123912a13ec9b89ae10269341
https://hdl.handle.net/1721.1/137461
https://hdl.handle.net/1721.1/137461
Autor:
Erik D. Demaine, William S. Moses
This paper proves that arrangement of music is NP-hard when subject to various constraints: avoiding musical dissonance, limiting how many notes can be played simultaneously, and limiting transition speed between chords. These results imply the compu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::128c1573ce62cc5032e185ff0f9f4d59
https://doi.org/10.1515/9781400889136-021
https://doi.org/10.1515/9781400889136-021
Publikováno v:
LLVM-HPC@SC
Optimizing compilers for task-level parallelism are still in their infancy. This work explores a compiler front end that translates OpenMP tasking semantics to Tapir, an extension to LLVM IR that represents fork-join parallelism. This enables analyse
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1035e9e9aaf5c6a072a2b182d95ca57b
https://doi.org/10.1145/3148173.3148186
https://doi.org/10.1145/3148173.3148186