Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Michael O. Lam"'
Autor:
Harshitha Menon, James Diffenderfer, Giorgis Georgakoudis, Ignacio Laguna, Michael O. Lam, Daniel Osei-Kuffuor, Konstantinos Parasyris, Jackson Vanover
Publikováno v:
IT Professional. 25:7-15
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99993a9fbda436ab1da079532f26a0b5
https://doi.org/10.1109/mitp.2023.3254642
https://doi.org/10.1109/mitp.2023.3254642
Autor:
Ignacio Laguna, Tristan Vanderbruggen, Markus Schordan, Giorgis Georgakoudis, Daniel Osei-Kuffuor, Harshitha Menon, Michael O. Lam, Konstantinos Parasyris
Publikováno v:
IISWC
With the increasing interest in applying approximate computing to HPC applications, representative benchmarks are needed to evaluate and compare various approximate computing algorithms and programming frameworks. To this end, we propose HPC-MixPBenc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e136dfc1023496bb0c08894d999c727
https://doi.org/10.1109/iiswc50251.2020.00012
https://doi.org/10.1109/iiswc50251.2020.00012
Publikováno v:
Monatshefte für Mathematik. 188:121-130
We develop a new algorithm to compute a basis for $$M_k(\Gamma _0(N))$$ , the space of weight k holomorphic modular forms on $$\Gamma _0(N)$$ , in the case when the graded algebra of modular forms over $$\Gamma _0(N)$$ is generated at weight two. Our
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::67e3530e85e0d135f1c81aee7c7de467
https://doi.org/10.1007/s00605-018-1168-9
https://doi.org/10.1007/s00605-018-1168-9
Publikováno v:
ACM Transactions on Embedded Computing Systems. 16:1-19
Modern embedded systems are becoming more reliant on real-valued arithmetic as they employ mathematically complex vision algorithms and sensor signal processing. Double-precision floating point is the most commonly used precision in computer vision a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2dd7848779c38ca07b243108f9d3b666
https://doi.org/10.1145/3126519
https://doi.org/10.1145/3126519
Publikováno v:
CORRECTNESS@SC
Mixed-precision computing offers potential data size reduction and performance improvement at the cost of accuracy, a tradeoff that many practitioners in high-performance computing and related fields are becoming more interested in as workloads becom
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4beb7dae8bc19e297358625fb3697a41
https://doi.org/10.1109/correctness49594.2019.00009
https://doi.org/10.1109/correctness49594.2019.00009
Publikováno v:
SIGCSE
Introducing software testing has taken on a greater importance in undergraduate computer science curricula in the last several years, with many departments using JUnit or other testing frameworks in the programming sequence and software engineering c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f4353575c9a79d79a64fe38c8af5e414
https://doi.org/10.1145/3287324.3287502
https://doi.org/10.1145/3287324.3287502
Publikováno v:
The International Journal of High Performance Computing Applications. 32:231-245
Floating-point computation is ubiquitous in high-performance scientific computing, but rounding error can compromise the results of extended calculations, especially at large scales. In this paper, we present new techniques that use binary instrument
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::633ebc79df92d057eaa4d823907cd8cb
https://doi.org/10.1177/1094342016652462
https://doi.org/10.1177/1094342016652462
Autor:
Kathryn Mohror, Michael O. Lam, Jeffrey Hittinger, Daniel Osei-Kuffuor, Markus Schordan, Harshitha Menon, Scott Lloyd
Publikováno v:
SC
HPC applications use floating point arithmetic operations extensively to solve computational problems. Mixed-precision computing seeks to use the lowest precision data type that is sufficient to achieve a desired accuracy, improving performance and r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a16dc1d97a247fcd573625a95820fc2
https://doi.org/10.1109/sc.2018.00051
https://doi.org/10.1109/sc.2018.00051
Autor:
Siddhartha Bishnu, Robert W. Robey, Michael O. Lam, Laura Monroe, Yuliana Yajaira Zamora, Joe Schoonover, Shane Fogerty, Steve Poole
Publikováno v:
CLUSTER
Approximate computing addresses many of the identified challenges for exascale computing, leading to performance improvements that may include changes in fidelity of calculation. In this paper, we examine approximate approaches for a range of DOE-rel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::060ef60ed399a5c1f9d8b56f7a6de54b
https://doi.org/10.1109/cluster.2017.120
https://doi.org/10.1109/cluster.2017.120