arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1804.00705cs.DCcs.ETcs.OS
收藏

近似记忆在数值应用中的反应式NaN修复

Reactive NaN Repair for Applying Approximate Memory to Numerical Applications

Shinsuke Hamada, Soramichi Akiyama, Mitaro Namiki

摘要:

人工智能和高性能计算领域的应用需要大量的内存容量,服务器主机的内存消耗的能量不断增加。通过应用近似计算可以大大降低主存的能量消耗,以换取增加的比特出错率。AI和HPC应用程序在一定程度上对比特错误具有鲁棒性,因为小的数值错误可以通过其迭代性质进行摊销。然而,由于位翻转导致的NaN的单次出现破坏了整个计算结果。问题是使用ECC修复每个位翻转会产生太多开销,因为位出错率比正常环境中高得多。我们提出了一个低开销的方法来修复NaNs时,近似计算应用到主内存。其主要思想是反应性地修复NaN,同时保留其他非致命的数值错误,以减少开销。我们利用x86 CPU的浮点异常实现了一个原型,初步评估表明,我们的方法产生的开销可以忽略不计。

英文摘要:

Applications in the AI and HPC fields require much memory capacity, and the amount of energy consumed by main memory of server machines is ever increasing. Energy consumption of main memory can be greatly reduced by applying approximate computing in exchange for increased bit error rates. AI and HPC applications are to some extent robust to bit errors because small numerical errors are amortized by their iterative nature. However, a single occurrence of a NaN due to bit-flips corrupts the whole calculation result. The issue is that fixing every bit-flip using ECC incurs too much overhead because the bit error rate is much higher than in normal environments. We propose a low-overhead method to fix NaNs when approximate computing is applied to main memory. The main idea is to reactively repair NaNs while leaving other non-fatal numerical errors as-is to reduce the overhead. We implemented a prototype by leveraging floating-point exceptions of x86 CPUs, and the preliminary evaluations showed that our method incurs negligible overhead.

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

↑