{"id":{"repo_id":"ucf","oai_identifier":"oai:stars.library.ucf.edu:etd-7232"},"canonical_url":"https://search.ndltd.org/etd/ucf/oai:stars.library.ucf.edu:etd-7232","repository":{"repo_id":"ucf","name":"Central Florida","base_url":"https://stars.library.ucf.edu/do/oai/"},"display":{"title":"Approximate Binary Decision Diagrams for High-Performance Computing","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Sivakumar, Anagha"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Jha, Sumit Kumar"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T09:33:02Z","subjects":["Computer Sciences"],"languages":["English"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["CFE0007414"],"render_values":[{"text":"CFE0007414","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://stars.library.ucf.edu/etd/6232","outbound_label":"Repository record","outbound_source":"dc:identifier.uri","record_url":"https://stars.library.ucf.edu/etd/6232","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://stars.library.ucf.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Astars.library.ucf.edu%3Aetd-7232","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Jha, Sumit Kumar"]},{"key":"dc:creator","label":"Author","values":["Sivakumar, Anagha"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["2018-01-01T08:00:00Z","Spring","2021-11-15T08:00:00Z"]},{"key":"dc:type","label":"Dc Type","values":["Dissertation/Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Sciences"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["CFE0007414"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://stars.library.ucf.edu/etd/6232"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Master of Science (M.S.)","Computer Science","<p>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 <a href=\"mailto:STARS@ucf.edu\">STARS@ucf.edu</a></p>","College of Engineering and Computer Science"]},{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Approximate Binary Decision Diagrams for High-Performance Computing"]}]}],"canonical_facts":{"dc:contributor":["Jha, Sumit Kumar"],"dc:creator":["Sivakumar, Anagha"],"dc:date.created":["2018-01-01T08:00:00Z","Spring","2021-11-15T08:00:00Z"],"dc:description":["Master of Science (M.S.)","Computer Science","<p>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 <a href=\"mailto:STARS@ucf.edu\">STARS@ucf.edu</a></p>","College of Engineering and Computer Science"],"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."],"dc:format":["application/pdf"],"dc:identifier":["CFE0007414"],"dc:identifier.uri":["https://stars.library.ucf.edu/etd/6232"],"dc:language":["English"],"dc:subject":["Computer Sciences"],"dc:title":["Approximate Binary Decision Diagrams for High-Performance Computing"],"dc:type":["Dissertation/Thesis"]},"updated_at":"2026-11-19T09:33:02Z"}