Back to search

Central Florida

Approximate Binary Decision Diagrams for High-Performance Computing

Abstract

dc:description.abstract

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.

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Sivakumar, Anagha
Contributors dc:contributor
  • Jha, Sumit Kumar

Subjects

dc:subject × 1

Rights

Language dc:language
English

Identifiers

dc:identifier.*
Identifier
CFE0007414

Chain of custody

source
Harvested from
Central Florida
Base URL
stars.library.ucf.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Sivakumar, Anagha. Approximate Binary Decision Diagrams for High-Performance Computing. https://stars.library.ucf.edu/etd/6232