The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Precimonious: tuning assistant for floating-point precision
Abstract
Given the variety of numerical errors that can occur, floating-point programs are difficult to write, test and debug. One common practice employed by developers without an advanced background in numerical analysis is using the highest available precision. While more robust, this can degrade program performance significantly. In this paper we present Precimonious, a dynamic program analysis tool to assist developers in tuning the precision of floating-point programs. Precimonious performs a search on the types of the floating-point program variables trying to lower their precision subject to accuracy constraints and performance goals. Our tool recommends a type instantiation that uses lower precision while producing an accurate enough answer without causing exceptions. We evaluate Precimonious on several widely used functions from the GNU Scientific Library, two NAS Parallel Benchmarks, and three other numerical programs. For most of the programs analyzed, Precimonious reduces precision, which results in performance improvements as high as 41%.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Accuracy and Stability of Numerical Algorithms: Second Edition
Higham, N. J. (2002) · doi:10.1137/1.9780898718027 · Cited by 3,803
Bailey, D. H., Barszcz, E., Barton, J. T., Browning, D. S., Carter, R. L., Dagum, L., Fatoohi, R. A., Frederickson, P. O., Lasinski, T. A., Schreiber, R. S., et al. (1991) · The International Journal of Supercomputing Applications · doi:10.1177/109434209100500306 · Cited by 2,395
Self-citationWhat every computer scientist should know about floating-point arithmetic
Goldberg, D. (1991) · ACM Computing Surveys · doi:10.1145/103162.103163 · Cited by 1,750
CUTE: a concolic unit testing engine for C
Sen, K., Marinov, D., & Agha, G. (2005) · Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering · doi:10.1145/1081706.1081750 · Cited by 1,651
Self-citationIEEE Standard for Floating-Point Arithmetic
(2008) · doi:10.1109/ieeestd.2008.4610935 · Cited by 1,328
Simplifying and isolating failure-inducing input
Zeller, A., & Hildebrandt, R. (2002) · IEEE Transactions on Software Engineering · doi:10.1109/32.988498 · Cited by 1,079
Automatically Tuned Linear Algebra Software
Whaley, R. C., & Dongarra, J. J. (1998) · Conference on High Performance Computing (Supercomputing) · doi:10.5555/509058.509096 · Cited by 854
SPIRAL: Code Generation for DSP Transforms
Puschel, M., Moura, J. M. F., Johnson, J. R., Padua, D., Veloso, M. M., Singer, B. W., Xiong, J., Franchetti, F., Gacic, A., Voronenko, Y., et al. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840306 · Cited by 826 · cited 1×
“Autotuning of codes to improve performance is a very large area of research, just a few citations being [7, 14, 23, 27, 28].”
BackgroundOSKI: A library of automatically tuned sparse matrix kernels
Vuduc, R., Demmel, J. W., & Yelick, K. A. (2005) · Journal of Physics: Conference Series · doi:10.1088/1742-6596/16/1/071 · Cited by 490
Self-citationOptimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology
Bilmes, J., Asanovic, K., Chin, C.-W., & Demmel, J. (2014) · 25th Anniversary International Conference on Supercomputing Anniversary Volume - · doi:10.1145/2591635.2667174 · Cited by 453
Self-citationA fast Fourier transform compiler
Frigo, M. (1999) · Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation · doi:10.1145/301618.301661 · Cited by 438
Optimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology
Bilmes, J., Asanovic, K., Chin, C.-W., & Demmel, J. (1997) · Proceedings of the 11th international conference on Supercomputing - ICS '97 · doi:10.1145/263580.263662 · Cited by 308
Self-citationDesign, implementation and testing of extended and mixed precision BLAS
Li, X. S., Demmel, J. W., Bailey, D. H., Henry, G., Hida, Y., Iskandar, J., Kahan, W., Kang, S. Y., Kapur, A., Martin, M. C., et al. (2002) · ACM Transactions on Mathematical Software · doi:10.1145/567806.567808 · Cited by 226
Self-citationAccelerating scientific computations with mixed precision algorithms
Baboulin, M., Buttari, A., Dongarra, J., Kurzak, J., Langou, J., Langou, J., Luszczek, P., & Tomov, S. (2009) · Computer Physics Communications · doi:10.1016/j.cpc.2008.11.005 · Cited by 205
Towards an Industrial Use of FLUCTUAT on Safety-Critical Avionics Software
Delmas, D., Goubault, É., Putot, S., et al. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04570-7_6 · Cited by 140
Buttari, A., Dongarra, J. J., Kurzak, J., Łuszczek, P., & Tomov, S. Z. (2008) · ACM Transactions on Mathematical Software · doi:10.1145/1377596.1377597 · Cited by 124
Automatically adapting programs for mixed-precision floating-point computation
Lam, M. O., Hollingsworth, J. K., de Supinski, B. R., & LeGendre, M. (2013) · International Conference on Supercomputing · doi:10.1145/2464996.2465018 · Cited by 124
Automatic detection of floating-point exceptions
Barr, E. T., Vo, T., Le, V., & Su, Z. (2013) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/2429069.2429133 · Cited by 101
Dynamic floating-point cancellation detection
Lam, M. O., Hollingsworth, J. K., & Stewart, G. W. (2012) · Parallel Computing · doi:10.1016/j.parco.2012.08.002 · Cited by 56
Trustworthy numerical computation in Scala
Darulová, E., & Kunčak, V. (2011) · ACM International Conference on Object Oriented Programming Systems Languages and Applications (OOPSLA) · doi:10.1145/2048066.2048094 · Cited by 54
ATLAS (Automatically Tuned Linear Algebra Software)
Karmani, R. K., Agha, G., Squillante, M. S., Seiferas, J., Brezina, M., Hu, J., Tuminaro, R. S., Sanders, P., Träffe, J. L., Geijn, R. A., et al. (2011) · Springer eBooks · doi:10.1007/978-0-387-09766-4_85 · Cited by 24
Cited by
Compiling KB-sized machine learning models to tiny IoT devices
Gopinath, S., Ghanathe, N., Seshadri, V., & Sharma, R. (2019) · Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/3314221.3314597 · Cited by 92
Metadata
- Authors
- Rubio-González, C., Nguyen, C., Nguyen, H. D., Demmel, J., Kahan, W., Sen, K., Bailey, D. H., Iancu, C., & Hough, D.
- Venue
- Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
- Publisher
- ACM
- Published
- 2013-11-17
- Pages
- 1-12
- OpenAlex
- W2081368694
- Cited by
- 281
- References
- 21
- FWCI
- 14.41
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.