Many soft applications such as machine learning and probabilistic computational modeling can benefit from approximate but high-performance implementations. In this thesis, we study how Binary decision diagrams (BDDs) can be used to synthesize approximate high-performance implementations from high-level specifications such as program kernels written in a C-like language. We demonstrate the potential of our approach by designing nanoscale crossbars from such approximate Boolean decision diagrams. Our work may be useful in designing massively-parallel approximate crossbar computing systems for application-specific domains such as probabilistic computational modeling.
If this is your thesis or dissertation, and want to learn how to access it or for more information about readership statistics, contact us at STARS@ucf.edu
Jha, Sumit Kumar
Master of Science (M.S.)
College of Engineering and Computer Science
Length of Campus-only Access
Sivakumar, Anagha, "Approximate Binary Decision Diagrams for High-Performance Computing" (2018). Electronic Theses and Dissertations. 6232.