On fault tolerance of hardware samplers

In this research, we evaluate the robustness of hardware samplers to hardware faults. This study was motivated by our observation that several applications use sampling as a primitive and that sampling itself is an approximate method for computation. As such, it might be possible to lower energy consumption of hardware implementations of applications by implementing the samplers using more energy efficient, but fault prone, devices. We implemented a sampler in hardware and characterized its output quality in the presence of stuck-at faults and transient faults using an FPGA based gate level fault injection methodology. To understand the application level implications of such errors made by the sampler, we studied its impact on two applications: particle filtering and clustering using a Dirichlet Process Mixture Model (DPMM). Our results indicate that hardware samplers are indeed robust to hardware faults and that their robustness improves in the context of application level metrics. Specifically, we observed that (a) the two applications can tolerate multiple stuck-at faults in the sampler ( > 5 faults at the same time), (b) the applications can tolerate gate level transient fault rates as high as 2.4 × 10−4, and (c) only faults in a small number of gates (< 5.2%) affect the output quality of the applications. The results show that there may be significant promise to leveraging this robustness to implement sampling based applications with much higher energy efficiency than what was previously thought possible.

[1]  Nando de Freitas,et al.  An Introduction to MCMC for Machine Learning , 2004, Machine Learning.

[2]  Muhammad Ashraful Alam,et al.  Reliability- and Process-variation aware design of integrated circuits — A broader perspective , 2008, 2011 International Reliability Physics Symposium.

[3]  Evgueni A. Haroutunian,et al.  Information Theory and Statistics , 2011, International Encyclopedia of Statistical Science.

[4]  Vikash K. Mansinghka,et al.  Building fast Bayesian computing machines out of intentionally stochastic, digital parts , 2014, ArXiv.

[5]  Ankur Srivastava,et al.  Algorithmic and architectural design methodology for particle filters in hardware , 2005, 2005 International Conference on Computer Design.

[6]  Petar M. Djuric,et al.  Generic Hardware Architectures for Sampling and Resampling in Particle Filters , 2005, EURASIP J. Adv. Signal Process..

[7]  Douglas L. Jones,et al.  Stochastic computation , 2010, Design Automation Conference.

[8]  John A. Gunnels,et al.  Extending stability beyond CPU millennium: a micron-scale atomistic simulation of Kelvin-Helmholtz instability , 2007, Proceedings of the 2007 ACM/IEEE Conference on Supercomputing (SC '07).

[9]  A. Doucet,et al.  A Tutorial on Particle Filtering and Smoothing: Fifteen years later , 2008 .

[10]  J. L. Roux An Introduction to the Kalman Filter , 2003 .

[11]  Petar M. Djuric,et al.  Architectures for efficient implementation of particle filters , 2004 .

[12]  Alex A. Birklykke,et al.  Markov chain algorithms: a template for building future robust low-power systems , 2014, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[13]  C. Striebel,et al.  On the maximum likelihood estimates for linear dynamic systems , 1965 .

[14]  Joshua B. Tenenbaum,et al.  Natively probabilistic computation , 2009 .

[15]  Hai Wei,et al.  Carbon nanotube circuits: Opportunities and challenges , 2013, 2013 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[16]  Radford M. Neal Markov Chain Sampling Methods for Dirichlet Process Mixture Models , 2000 .

[17]  Todd M. Austin,et al.  CrashTest: A fast high-fidelity FPGA-based resiliency analysis framework , 2008, 2008 IEEE International Conference on Computer Design.

[18]  Michael Isard,et al.  CONDENSATION—Conditional Density Propagation for Visual Tracking , 1998, International Journal of Computer Vision.

[19]  Radford M. Neal Pattern Recognition and Machine Learning , 2007, Technometrics.

[20]  Olivier Temam,et al.  A defect-tolerant accelerator for emerging high-performance applications , 2012, 2012 39th Annual International Symposium on Computer Architecture (ISCA).

[21]  Carl E. Rasmussen,et al.  The Infinite Gaussian Mixture Model , 1999, NIPS.

[22]  Shekhar Y. Borkar,et al.  Design perspectives on 22nm CMOS and beyond , 2009, 2009 46th ACM/IEEE Design Automation Conference.

[23]  Karthikeyan Sankaralingam,et al.  Relax: an architectural framework for software recovery of hardware faults , 2010, ISCA.

[24]  P. K. Dubey,et al.  Recognition, Mining and Synthesis Moves Comp uters to the Era of Tera , 2005 .

[25]  J. Pitman Combinatorial Stochastic Processes , 2006 .

[26]  Erik B. Sudderth Graphical models for visual object recognition and tracking , 2006 .

[27]  Luc Devroye,et al.  Sample-based non-uniform random variate generation , 1986, WSC '86.