Abstract
As interest in randomization has grown within the computing community, the number of pseudorandom value generators (PRVGs) at developers' disposal dramatically increased. Today, developers lack the tools necessary to obtain optimal behavior from their PRVGs. We provide the first deep study into the tradeoffs among the PRVGs in the C++ standard, finding no silver bullet for all programs and architectures. With this in mind, we have built PRV Jeeves, the first fully automatic PRVG selector. We demonstrate that when compiling widely-used, highly optimized programs with PRV Jeeves, we are able to cut execution time by 34% on average. This enhancement comes at no cost to developers.
Author supplied keywords
Cite
CITATION STYLE
Leonard, M., & Campanoni, S. (2020). Introducing the pseudorandom value generator selection in the compilation toolchain. In CGO 2020 - Proceedings of the 18th ACM/IEEE International Symposium on Code Generation and Optimization (pp. 256–267). Association for Computing Machinery, Inc. https://doi.org/10.1145/3368826.3377906
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
