A scalable approach for automated precision analysis

ACM/SIGDA International Symposium on Field Programmable Gate Arrays - FPGA

Volumn , Issue , 2012, Pages 185-194

  Boland, David ^a   Constantinides, George A ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

precision analysis; range analysis; word length optimisation

Indexed keywords

ANALYTICAL TECHNIQUES; COMPUTATIONAL RESULTS; DATA PATHS; DOUBLE PRECISION; EXECUTION TIME; HARDWARE ACCELERATORS; ITERATIVE ALGORITHM; KEY FACTORS; NUMERICAL PRECISION; NUMERICAL PROPERTIES; OPERATING FREQUENCY; OPTIMIZATION FRAMEWORK; PRECISION ANALYSIS; RANGE ANALYSIS; RELATIVE ERRORS; SCALABLE APPROACH; SILICON AREA; SYSTEM OF LINEAR EQUATIONS; WORD LENGTH;

ALGORITHMS; COMMERCE; FACTOR ANALYSIS; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); OPTIMIZATION;

NUMERICAL METHODS;

EID: 84858168073     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2145694.2145726     Document Type: Conference Paper

References (28)

1. G. Chow, K. Kwok, W. Luk, and P. Leong, "Mixed precision processing in reconfigurable systems," in Proc. IEEE. Symp. on Field-Programmable Custom Computing Machines, 2011, pp. 17-24.
2. A. R. Lopes and G. A. Constantinides, "A fused hybrid floating-point and fixed-point dot-product for FPGAs." in Proc. Int. Symp. on Applied Reconfigurable Recomputing, 2010, pp. 157-168.
3. M. deLorimier and A. DeHon, "Floating-point sparse matrix-vector multiply for FPGAs," in Proc. Int. Symp. on Field-Programmable Gate Arrays, 2005, pp. 75-85.
4. L. Zhuo, G. R. Morris, and V. K. Prasanna, "High-performance reduction circuits using deeply pipelined operators on FPGAs," IEEE Trans. Parallel Distrib. Syst., vol. 18, no. 10, pp. 1377-1392, 2007.
5. A. Kinsman and N. Nicolici, "Bit-width allocation for hardware accelerators for scientific computing using SAT-modulo theory," IEEE Trans. Comp.-Aided Des. Integ. Cir. Sys., vol. 29, pp. 405-413, 2010.
6. D. Boland and G. Constantinides, "Bounding variable values and round-off effects using handelman representations,"IEEE Trans. Comp.-Aided Des. Integ. Cir. Sys., vol. 30, no. 11, pp. 1691 -1704, 2011.
7. Y. Pang, K. Radecka, and Z. Zilic, "Optimization of imprecise circuits represented by Taylor series and real-valued polynomials," IEEE Trans. Comp.-Aided Des. Integ. Cir. Sys., vol. 29, pp. 1177-1190, August 2010.
8. G. Constantinides, P. Cheung, and W. Luk, "Optimum wordlength allocation," Proc. Int. Symp. Field-Programmable Custom Computing Machines, pp. 219-228, 2002.
9. D.-U. Lee, A. Gaffar, R. Cheung, O. Mencer, W. Luk, and G. Constantinides, "Accuracy-guaranteed bit-width optimization," IEEE Trans. Comp.-Aided Des. Integ. Cir. Sys., vol. 25, no. 10, pp. 1990-2000, 2006.
10. M. L. Chang and S. Hauck, "Automated least-significant bit datapath optimization for FPGAs," Proc. IEEE Symp. on Field-Programmable Custom Computing Machines, pp. 59-67, 2004.
11. R. Barrett, M. Berry, T. F. Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, and H. V. der Vorst, Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. Philadelphia: SIAM, 1994.
12. G. Constantinides, A. Kinsman, and N. Nicolici, "Numerical data representations for FPGA-based scientific computing,"Design & Test of Computers, vol. 28, no. 4, pp. 8-17, 2011.
13. Z. Zhao and M. Leeser, "Precision modeling and bit-width optimization of floating-point applications," in High Performance Embedded Computing, 2003, pp. 141-142.
14. R. E. Moore, Interval Analysis. Englewood Cliff, NJ: Prentice-Hall, 1966.
15. B. Einarsson, Handbook on Accuracy and Reliability in Scientific Computation. Soc for Industrial & Applied Math, 2005, ch. 10, pp. 195 - 240.
16. F. de Dinechin, C. Q. Lauter, and G. Melquiond, "Assisted verification of elementary functions using gappa," in Proc. Symp. Applied computing, 2006, pp. 1318-1322.
17. A. Kinsman and N. Nicolici, "Computational bit-width allocation for operations in vector calculus," in IEEE Int. Conf. on Computer Design, oct. 2009, pp. 433 -438.
18. -, "Robust design methods for hardware accelerators for iterative algorithms in scientific computing," in Proc. Design Automation Conference, 2010, pp. 254-257.
19. A. Neumaier, "Taylor forms - use and limits," Reliable Computing, vol. 9, pp. 43-79, 2003.
20. N. Courtois, A. Klimov, J. Patarin, and A. Shamir, "Efficient algorithms for solving overdefined systems of multivariate polynomial equations," in Proc. Int. Conf. on Theory and application of cryptographic techniques, 2000, pp. 392-407.
21. L. H. de Figueiredo and J. Stolfi, Self-Validated Numerical Methods and Applications. Rio de Janeiro: IMPA/CNPq, 1997.
22. K. Makino and M. Berz, "Taylor models and other validated functional inclusion methods," International Journal of Pure and Applied Mathematics, vol. 4, pp. 379-456, 2003.
23. J.-M. Muller, Elementary Functions: Algorithms and Implementation. Birkhauser, 2005.
24. N. J. Higham, Accuracy and Stability of Numerical Algorithms, 2nd ed. Philadelphia, PA, USA: Soc for Industrial & Applied Math, 2002.
25. W. S. Brown, "A simple but realistic model of floating-point computation," ACM Trans. Math. Softw., vol. 7, pp. 445-480, December 1981.
26. H. Ratschek, "Centered forms," SIAM Journal on Numerical Analysis, vol. 17, no. 5, pp. pp. 656-662, 1980.
27. D. Boland and G. Constantinides, "Optimising memory bandwidth use and performance for matrix-vector multiplication in iterative methods," ACM Trans. Reconfigurable Technol. Syst., vol. 4, pp. 22:1-22:14, 2011.
28. -, "An FPGA-based implementation of the MINRES algorithm," in Proc. Int. Conf. Field Programmable Logic and Applications, Sept. 2008, pp. 379-384.