Self-Adaptive Run-Time Variable Floating-Point Precision for Iterative Algorithms: A Joint HW/SW Approach

نویسندگان

چکیده

Using standard Floating-Point (FP) formats for computation leads to significant hardware overhead since these are over-designed error-resilient workloads such as iterative algorithms. Hence, FP Unit (FPU) architectures need run-time variable precision capabilities. In this work, we propose a new method and an FPU architecture that enable designers dynamically tune computations’ automatically at called Variable Precision in Time (VPT), leading power consumption, execution time, energy savings. spite of its circuit area overhead, the proposed approach simplifies integration existing software any level stack (OS, RTOS, or application-level): it only requires lightweight support solely relies on traditional assembly instructions, without specialized compiler custom instructions. We apply technique Jacobi Gauss–Seidel methods taking full advantage suggested FPU. For each algorithm, two modified versions proposed: conservative version relaxed one. Both algorithms analyzed compared statistically understand effects VPT applications. The implementations demonstrate up 70.67% consumption saving, 59.80% time 88.20% total saving w.r.t reference double implementation, with no accuracy loss.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Precision Floating Point LLL

The LLL algorithm is one of the most studied lattice basis reduction algorithms in the literature. Among all of its variants, the floating point version, also known as L, is the most popular one, due to its efficiency and its practicality. In its classic setting, the floating point precision is a fixed value, determined by the dimension of the input basis at the initiation of the algorithm. We ...

متن کامل

Algorithms for arbitrary precision floating point arithmetic

We present techniques which may be used to perform computations of very high accuracy using only straightforward oating point arithmetic operations of limited precision, and we prove the validity of these techniques under very general hypotheses satissed by most implementations of oating point arithmetic. To illustrate the application of these techniques, we present an algorithm which computes ...

متن کامل

An Effective BIST TPG for Variable Precision Floating Point Multiplier

The accuracy of the multiplication depends on the precision of the multiplier. The variable precision floating point multiplier will have more accuracy when compared with the fixed precision multiplier. In this paper a variable precision floating point multiplier is considered. An effective BIST test pattern generator for variable precision floating point multiplier is proposed. A BIST TPG cons...

متن کامل

Algorithms for Quad-Double Precision Floating Point Arithmetic

A quad-double number is an unevaluated sum of four IEEE double precision numbers, capable of representing at least 212 bits of signi cand. We present the algorithms for various arithmetic operations (including the four basic operations and various algebraic and transcendental operations) on quad-double numbers. The performance of the algorithms, implemented in C++, is also presented.

متن کامل

Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates

Exact computer arithmetic has a variety of uses including, but not limited to, the robust implementation of geometric algorithms. This report has three purposes. The first is to offer fast software-level algorithms for exact addition and multiplication of arbitrary precision floating-point values. The second is to propose a technique for adaptive-precision arithmetic that can often speed these ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2021

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics10182209