Zobrazeno 1 - 10
of 99
pro vyhledávání: '"David I. August"'
Autor:
Zujun Tan, Yebin Chon, Michael Kruse, Johannes Doerfert, Ziyang Xu, Brian Homerding, Simone Campanoni, David I. August
Publikováno v:
Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 3.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c799876ccabbe7edaf5f0d8de7890b0
https://doi.org/10.1145/3582016.3582058
https://doi.org/10.1145/3582016.3582058
Publikováno v:
Proceedings of the ACM on Programming Languages. 5:1-23
Type-safe languages improve application safety by eliminating whole classes of vulnerabilities–such as buffer overflows–by construction. However, this safety sometimes comes with a performance cost. As a result, many modern type-safe languages pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::523df57e16387c93d1631f772c9ae8e6
https://doi.org/10.1145/3485480
https://doi.org/10.1145/3485480
Autor:
Angelo Matni, Enrico Armenio Deiana, Yian Su, Lukas Gross, Souradip Ghosh, Sotiris Apostolakis, Ziyang Xu, Zujun Tan, Ishita Chaturvedi, Brian Homerding, Tommy McMichen, David I. August, Simone Campanoni
Publikováno v:
2022 IEEE/ACM International Symposium on Code Generation and Optimization (CGO).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::419007388f48e4ecaf129febceb06365
https://doi.org/10.1109/cgo53902.2022.9741276
https://doi.org/10.1109/cgo53902.2022.9741276
Autor:
Tipp Moseley, Hyoun Kyu Cho, Grant Ayers, Parthasarathy Ranganathan, Nayana Prasad Nagendra, Heiner Litz, Svilen Kanev, David I. August, Christos Kozyrakis, Trivikram Krishnamurthy
Publikováno v:
ISCA
The large instruction working sets of private and public cloud workloads lead to frequent instruction cache misses and costs in the millions of dollars. While prior work has identified the growing importance of this problem, to date, there has been l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::81d4043f3bf8b37dace0f4132ba9d567
https://doi.org/10.1109/mm.2020.2986212
https://doi.org/10.1109/mm.2020.2986212
Publikováno v:
PLDI
Program analysis determines the potential dataflow and control flow relationships among instructions so that compiler optimizations can respect these relationships to transform code correctly. Since many of these relationships rarely or never occur,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab3cfa0666700f82a7e359d26947a57f
https://doi.org/10.1145/3385412.3386028
https://doi.org/10.1145/3385412.3386028
Publikováno v:
ASPLOS
The promise of automatic parallelization, freeing programmers from the error-prone and time-consuming process of making efficient use of parallel processing resources, remains unrealized. For decades, the imprecision of memory analysis limited the ap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::78f4115ebe6474a4c94cf3f561794f29
https://doi.org/10.1145/3373376.3378458
https://doi.org/10.1145/3373376.3378458
Autor:
Sophie Qiu, Jordan Fix, Sotiris Apostolakis, Hansen Zhang, Nayana Prasad Nagendra, David I. August
Publikováno v:
ASPLOS
Speculation with transactional memory systems helps pro- grammers and compilers produce profitable thread-level parallel programs. Prior work shows that supporting transactions that can span multiple threads, rather than requiring transactions be con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3369dae6be4246b0bb673ec76adc173
https://doi.org/10.1145/3296957.3173172
https://doi.org/10.1145/3296957.3173172
Autor:
Jordan Fix, Stephen R. Beard, Nayana Prasad Nagendra, Soumyadeep Ghosh, Sotiris Apostolakis, Taewook Oh, David I. August, Hansen Zhang
Publikováno v:
ASPLOS
Software security techniques rely on correct execution by the hardware. Securing hardware components has been challenging due to their complexity and the proportionate attack surface they present during their design, manufacture, deployment, and oper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::edb0435e5c1e377a782adf626d05e438
https://doi.org/10.1145/3297858.3304020
https://doi.org/10.1145/3297858.3304020
Publikováno v:
PACT
Several classes of algorithms for combinatorial search and optimization problems employ memoization data structures to speed up their serial convergence. However, accesses to these data structures impose dependences that obstruct program parallelizat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8531dc648b252aed311bee1d5421aabf
https://doi.org/10.1145/3243176.3243193
https://doi.org/10.1145/3243176.3243193
Publikováno v:
PACT
Computational scientists are typically not expert programmers, and thus work in easy to use dynamic languages. However, they have very high performance requirements, due to their large datasets and experimental setups. Thus, the performance required
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f056b6d0b8a717607cc7c9aa3b9737d0
https://doi.org/10.1109/pact.2017.28
https://doi.org/10.1109/pact.2017.28