arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2104.04043cs.MS
收藏

RLIBM-32:用于32位浮点表示的高性能正确舍入数学库

RLIBM-32: High Performance Correctly Rounded Math Libraries for 32-bit Floating Point Representations

Jay P. Lim, Santosh Nagarakatte

摘要:

本文提出了一套技术,以开发正确的舍入数学库的32位浮点型和浮点型。它增强了我们的RLibm方法,该方法将生成正确舍入库的问题框架为16位类型上下文中的线性编程问题,以扩展到32位类型。具体而言,本文提出了新的算法(1)生成多项式,使用反例引导的多项式生成为所有输入生成正确的舍入输出,(2)生成有效的分段多项式与基于位模式的域分裂,以及(3)推导出可用于产生正确的结果时,范围减少涉及多个基本功能的自由量。生成的32位浮点型数学库比最先进的数学库更快,同时为所有输入生成正确的输出。我们还开发了一套正确的舍入初等函数的32位posits。

英文摘要:

This paper proposes a set of techniques to develop correctly rounded math libraries for 32-bit float and posit types. It enhances our RLibm approach that frames the problem of generating correctly rounded libraries as a linear programming problem in the context of 16-bit types to scale to 32-bit types. Specifically, this paper proposes new algorithms to (1) generate polynomials that produce correctly rounded outputs for all inputs using counterexample guided polynomial generation, (2) generate efficient piecewise polynomials with bit-pattern based domain splitting, and (3) deduce the amount of freedom available to produce correct results when range reduction involves multiple elementary functions. The resultant math library for the 32-bit float type is faster than state-of-the-art math libraries while producing the correct output for all inputs. We have also developed a set of correctly rounded elementary functions for 32-bit posits.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑