메뉴 건너뛰기




Volumn , Issue , 2013, Pages

Precimonious: Tuning assistant for floating-point precision

Author keywords

Delta debugging algorithm; Dynamic program analysis; Mixed precision; Oating point arithmetic; Program optimization

Indexed keywords

TOOLS;

EID: 84896898835     PISSN: 21674329     EISSN: 21674337     Source Type: Conference Proceeding    
DOI: 10.1145/2503210.2503296     Document Type: Conference Paper
Times cited : (248)

References (29)
  • 5
    • 84874138141 scopus 로고    scopus 로고
    • Automatic detection of oating-point exceptions
    • R. Giacobazzi and R. Cousot, editors. ACM
    • E. T. Barr, T. Vo, V. Le, and Z. Su. Automatic detection of oating-point exceptions. In R. Giacobazzi and R. Cousot, editors, POPL, pages 549-560. ACM, 2013.
    • (2013) POPL , pp. 549-560
    • Barr, E.T.1    Vo, T.2    Le, V.3    Su, Z.4
  • 6
    • 84863500860 scopus 로고    scopus 로고
    • A dynamic program analysis to nd oating-point accuracy problems
    • J. Vitek, H. Lin, and F. Tip, editors. ACM
    • F. Benz, A. Hildebrandt, and S. Hack. A dynamic program analysis to nd oating-point accuracy problems. In J. Vitek, H. Lin, and F. Tip, editors, PLDI, pages 453-462. ACM, 2012.
    • (2012) PLDI , pp. 453-462
    • Benz, F.1    Hildebrandt, A.2    Hack, S.3
  • 7
    • 0030661485 scopus 로고    scopus 로고
    • Optimizing matrix multiply using PHiPAC: A portable, high-performance, ANSI C coding methodology
    • Vienna, Austria, July. ACM SIGARC. see
    • J. Bilmes, K. Asanovific, C. Chin, and J. Demmel. Optimizing matrix multiply using PHiPAC: A portable, high-performance, ANSI C coding methodology. In Proceedings of the International Conference on Supercomputing, Vienna, Austria, July 1997. ACM SIGARC. see http://www. icsi. berkeley. edu/bilmes/phipac.
    • (1997) Proceedings of the International Conference on Supercomputing
    • Bilmes, J.1    Asanovific, K.2    Chin, C.3    Demmel, J.4
  • 9
    • 35548992612 scopus 로고    scopus 로고
    • Using mixed precision for sparse matrix computations to enhance the performance while achieving 64-bit accuracy
    • July
    • A. Buttari, J. Dongarra, J. Kurzak, P. Luszczek, and S. Tomov. Using mixed precision for sparse matrix computations to enhance the performance while achieving 64-bit accuracy. ACM Trans. Math. Softw., 34(4):17:1-17:22, July 2008. URL http://doi. acm. org/10. 1145/1377596. 1377597.
    • (2008) ACM Trans. Math. Softw. , vol.34 , Issue.4 , pp. 171-1722
    • Buttari, A.1    Dongarra, J.2    Kurzak, J.3    Luszczek, P.4    Tomov, S.5
  • 11
    • 81455141864 scopus 로고    scopus 로고
    • Trustworthy numerical computation in scala
    • C. V. Lopes and K. Fisher, editors. ACM
    • E. Darulova and V. Kuncak. Trustworthy numerical computation in scala. In C. V. Lopes and K. Fisher, editors, OOPSLA, pages 325-344. ACM, 2011.
    • (2011) OOPSLA , pp. 325-344
    • Darulova, E.1    Kuncak, V.2
  • 12
    • 78650971531 scopus 로고    scopus 로고
    • Certifying the oating-point implementation of an elementary function using gappa
    • Feb.
    • F. de Dinechin, C. Lauter, and G. Melquiond. Certifying the oating-point implementation of an elementary function using gappa. IEEE Trans. Comput., 60(2):242-253, Feb. 2011. URL http://dx. doi. org/10. 1109/TC. 2010. 128.
    • (2011) IEEE Trans. Comput. , vol.60 , Issue.2 , pp. 242-253
    • De Dinechin, F.1    Lauter, C.2    Melquiond, G.3
  • 15
    • 0026122066 scopus 로고
    • What every computer scientist should know about oating point arithmetic
    • D. Goldberg. What every computer scientist should know about oating point arithmetic. ACM Computing Surveys, 23(1):5-48, 1991.
    • (1991) ACM Computing Surveys , vol.23 , Issue.1 , pp. 5-48
    • Goldberg, D.1
  • 16
    • 0034859064 scopus 로고    scopus 로고
    • Algorithms for quad-double precision oating point arithmetic
    • Washington, DC, USA, IEEE Computer Society. URL
    • Y. Hida, X. S. Li, and D. H. Bailey. Algorithms for quad-double precision oating point arithmetic. In Proceedings of the 15th IEEE Symposium on Computer Arithmetic, ARITH'01, pages 155-, Washington, DC, USA, 2001. IEEE Computer Society. URL http: //dl. acm. org/citation. cfm?id=872021. 872445.
    • (2001) Proceedings of the 15th IEEE Symposium on Computer Arithmetic, ARITH'01 , pp. 155
    • Hida, Y.1    Li, X.S.2    Bailey, D.H.3
  • 17
    • 0036457301 scopus 로고    scopus 로고
    • Accuracy and stability of numerical algorithms
    • Philadelphia, PA, USA, second edition
    • N. J. Higham. Accuracy and Stability of Numerical Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, second edition, 2002.
    • (2002) Society for Industrial and Applied Mathematics
    • Higham, N.J.1
  • 20
    • 84879807319 scopus 로고    scopus 로고
    • Automatically adapting programs for mixed-precision oating-point computation
    • A. D. Malony, M. Nemirovsky, and S. P. Midki, editors. ACM
    • M. O. Lam, J. K. Hollingsworth, B. R. de Supinski, and M. P. LeGendre. Automatically adapting programs for mixed-precision oating-point computation. In A. D. Malony, M. Nemirovsky, and S. P. Midki, editors, ICS, pages 369-378. ACM, 2013.
    • (2013) ICS , pp. 369-378
    • Lam, M.O.1    Hollingsworth, J.K.2    De Supinski, B.R.3    Legendre, M.P.4
  • 28
    • 84971442244 scopus 로고    scopus 로고
    • Automatically tuned linear algebra software (ATLAS)
    • C. Whaley. Automatically Tuned Linear Algebra Software (ATLAS). math-atlas. sourceforge. net, 2012.
    • (2012) Math-atlas. Sourceforge. Net
    • Whaley, C.1
  • 29
    • 0036472476 scopus 로고    scopus 로고
    • Simplifying and isolating failure-inducing input
    • A. Zeller and R. Hildebrandt. Simplifying and isolating failure-inducing input. IEEE Trans. Software Eng., 28(2):183-200, 2002.
    • (2002) IEEE Trans. Software Eng. , vol.28 , Issue.2 , pp. 183-200
    • Zeller, A.1    Hildebrandt, R.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.