Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Guilherme Vieira Leobas"'
Publikováno v:
Proceedings of the ACM on Programming Languages. 4:1-28
This paper describes a compiler optimization to eliminates dynamic occurrences of expressions in the format a ← a ⊕ b ⊗ c . The operation ⊕ must admit an identity element z , such that a ⊕ z = a . Also, z must be the absorbing element of
Publikováno v:
ACM Transactions on Architecture and Code Optimization
ACM Transactions on Architecture and Code Optimization, Association for Computing Machinery, 2019, 15 (4), pp.#44. ⟨10.1145/3280848⟩
ACM Transactions on Architecture and Code Optimization, Association for Computing Machinery, 2019, 15 (4), pp.#44. ⟨10.1145/3280848⟩
International audience; A Store operation is called “silent” if it writes in memory a value that is already there. e ability to detect silent stores is important, because they might indicate performance bugs, might enable code optimizations, an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e87b0190ce5c07e7851512bb48eab31
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01912634
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01912634
Publikováno v:
SBLP
In modern software development, high-level languages are becoming progressively more feature-rich. The expressiveness and increased abstraction provided by these features allow programmers to be more productive and less concerned with low-level detai
Publikováno v:
SBLP
This paper presents TaskMiner, a tool that automatically finds task parallelism in C code. TaskMiner solves classic problems of irregular parallelism, such as finding the memory ranges accessed by tasks, removing spurious static dependencies, detecti