Proceedings of the Conference for Next Generation Arithmetic最新文献

Provably correct posit arithmetic with fixed-point big integer 可证明正确的定点大整数正数算术

Proceedings of the Conference for Next Generation Arithmetic Pub Date : 2018-03-28 DOI: 10.1145/3190339.3190341

S. Chung

{"title":"Provably correct posit arithmetic with fixed-point big integer","authors":"S. Chung","doi":"10.1145/3190339.3190341","DOIUrl":"https://doi.org/10.1145/3190339.3190341","url":null,"abstract":"Floating-point number format is used extensively in many applications, especially scientific software. The applications rely on efficient hardware floating-point support to perform arithmetic operations. With the advent of multicore CPUs and massively parallel GPUs, the memory bandwidth of a computer system is increasingly limited for each of the compute cores. The limited memory bandwidth is a serious bottleneck to the system performance. The posit number format [12] is a promising approach to improve the accuracy of the arithmetic operations with more efficient use of bit storage, hence, reducing memory contention. However, robust and reliable software implementations of posit arithmetic libraries in C/C++ or Python are not readily available. In this paper, we seek to develop provably correct posit arithmetic based on fixed-point big integers. A robust and reliable implementation can then serve as a reference for other hardware-optimized implementations, as a test bed for applications to experiment with different posit bit configurations, and to analyze the relative errors of using smaller bit sizes in the posit numbers compared to using the native 32-bit or 64-bit floating-point numbers.","PeriodicalId":402566,"journal":{"name":"Proceedings of the Conference for Next Generation Arithmetic","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125314739","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

High-level .NET software implementations of unum type I and posit with simultaneous FPGA implementation using Hastlayer 高级。net软件实现unum类型I和posix，同时使用哈斯层FPGA实现

Proceedings of the Conference for Next Generation Arithmetic Pub Date : 2018-03-28 DOI: 10.1145/3190339.3190343

Zoltan Lehoczky, A. Retzler, Richard Toth, Álmos Szabó, Ben Farkas, Krisztian Somogyi

引用次数: 5

The slide number format 幻灯片编号格式

Proceedings of the Conference for Next Generation Arithmetic Pub Date : 2018-03-28 DOI: 10.1145/3190339.3190342

Ignaz Kohlbecker

引用次数: 0

A matrix-multiply unit for posits in reconfigurable logic leveraging (open)CAPI 在可重构逻辑中利用(开放)CAPI的位置的矩阵乘单元

Proceedings of the Conference for Next Generation Arithmetic Pub Date : 2018-03-28 DOI: 10.1145/3190339.3190340

Jianyu Chen, Z. Al-Ars, H. P. Hofstee

引用次数: 14

Universal coding of the reals: alternatives to IEEE floating point 实数的通用编码:IEEE浮点数的替代方案

Proceedings of the Conference for Next Generation Arithmetic Pub Date : 2018-03-28 DOI: 10.1145/3190339.3190344

Peter Lindstrom, Scott Lloyd, J. Hittinger

引用次数: 23

Proceedings of the Conference for Next Generation Arithmetic 下一代算术会议论文集

Proceedings of the Conference for Next Generation Arithmetic Pub Date : 1900-01-01 DOI: 10.1145/3190339

引用次数: 1