{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/72789"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/72789","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"BROAD: bold and reliable online approximate computing framework for diverse applications","abstract":"Approximate computing is an emerging computing paradigm that leverages the inherent resilience of applications while designing energy-efficient computing systems. Approximate computing systems must satisfy user-provided requirements for quality of service (QoS), a quantitative criterion imposed on the output of an application such that the output is qualitatively useful. Previous software frameworks for approximate computing rely on the assumptions that approximation errors do not propagate through applications and that occasional QoS violations are acceptable. In this thesis, we explore the application of software approximations to applications for which these assumptions do not hold. We also observe that to avoid unacceptable QoS degradation (i.e., degradation beyond the QoS requirement), previous frameworks had to include a static approximation level guardband, which reduces the benefits to energy-efficiency. We propose BROAD, a Bold and Reliable Online Approximate Computing Framework for Diverse Applications. BROAD explicitly provides a checkpoint/rollback mechanism to allow applications to recover from QoS violations and error accumulation. The checkpoint/rollback mechanism further obviates BROAD from having a static approximation level guardband by allowing BROAD to operate near the QoS requirement without concern for permanent QoS degradation.","abstract_html":"Approximate computing is an emerging computing paradigm that leverages the inherent resilience of applications while designing energy-efficient computing systems. Approximate computing systems must satisfy user-provided requirements for quality of service (QoS), a quantitative criterion imposed on the output of an application such that the output is qualitatively useful. Previous software frameworks for approximate computing rely on the assumptions that approximation errors do not propagate through applications and that occasional QoS violations are acceptable. In this thesis, we explore the application of software approximations to applications for which these assumptions do not hold. We also observe that to avoid unacceptable QoS degradation (i.e., degradation beyond the QoS requirement), previous frameworks had to include a static approximation level guardband, which reduces the benefits to energy-efficiency. We propose BROAD, a Bold and Reliable Online Approximate Computing Framework for Diverse Applications. BROAD explicitly provides a checkpoint/rollback mechanism to allow applications to recover from QoS violations and error accumulation. The checkpoint/rollback mechanism further obviates BROAD from having a static approximation level guardband by allowing BROAD to operate near the QoS requirement without concern for permanent QoS degradation.","abstract_has_math":false,"creators":["Zhong, Liulin"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Kumar, Rakesh"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-01-21T19:48:13Z","date_published":"2015-01-21T19:48:13Z","updated_at":"2026-07-22T22:26:07Z","subjects":["Approximate Computing","Performance","Reliability","Design"],"languages":["en"],"rights":["Copyright 2014 Liulin Zhong"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/72789","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Kumar, Rakesh"]},{"key":"dc:creator","label":"Author","values":["Zhong, Liulin"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-01-21T19:48:13Z","2014-12","2015-01-21"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Approximate Computing","Performance","Reliability","Design"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2014 Liulin Zhong"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/72789"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Approximate computing is an emerging computing paradigm that leverages the inherent resilience of applications while designing energy-efficient computing systems. Approximate computing systems must satisfy user-provided requirements for quality of service (QoS), a quantitative criterion imposed on the output of an application such that the output is qualitatively useful. Previous software frameworks for approximate computing rely on the assumptions that approximation errors do not propagate through applications and that occasional QoS violations are acceptable. In this thesis, we explore the application of software approximations to applications for which these assumptions do not hold. We also observe that to avoid unacceptable QoS degradation (i.e., degradation beyond the QoS requirement), previous frameworks had to include a static approximation level guardband, which reduces the benefits to energy-efficiency. We propose BROAD, a Bold and Reliable Online Approximate Computing Framework for Diverse Applications. BROAD explicitly provides a checkpoint/rollback mechanism to allow applications to recover from QoS violations and error accumulation. The checkpoint/rollback mechanism further obviates BROAD from having a static approximation level guardband by allowing BROAD to operate near the QoS requirement without concern for permanent QoS degradation.","Item withdrawn by Laura Spradlin (lspradl2@illinois.edu) on 2014-12-04T19:13:20Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Zhong_Liulin.pdf: 1712853 bytes, checksum: 953a7e7fc4e4fcc579626be9a6264d19 (MD5)","Made available in DSpace on 2015-01-21T19:48:13Z (GMT). No. of bitstreams: 1 Liulin_Zhong.pdf: 1712853 bytes, checksum: 953a7e7fc4e4fcc579626be9a6264d19 (MD5)"]},{"key":"dc:title","label":"Title","values":["BROAD: bold and reliable online approximate computing framework for diverse applications"]}]}],"canonical_facts":{"dc:contributor":["Kumar, Rakesh"],"dc:creator":["Zhong, Liulin"],"dc:date":["2015-01-21T19:48:13Z","2014-12","2015-01-21"],"dc:description":["Approximate computing is an emerging computing paradigm that leverages the inherent resilience of applications while designing energy-efficient computing systems. Approximate computing systems must satisfy user-provided requirements for quality of service (QoS), a quantitative criterion imposed on the output of an application such that the output is qualitatively useful. Previous software frameworks for approximate computing rely on the assumptions that approximation errors do not propagate through applications and that occasional QoS violations are acceptable. In this thesis, we explore the application of software approximations to applications for which these assumptions do not hold. We also observe that to avoid unacceptable QoS degradation (i.e., degradation beyond the QoS requirement), previous frameworks had to include a static approximation level guardband, which reduces the benefits to energy-efficiency. We propose BROAD, a Bold and Reliable Online Approximate Computing Framework for Diverse Applications. BROAD explicitly provides a checkpoint/rollback mechanism to allow applications to recover from QoS violations and error accumulation. The checkpoint/rollback mechanism further obviates BROAD from having a static approximation level guardband by allowing BROAD to operate near the QoS requirement without concern for permanent QoS degradation.","Item withdrawn by Laura Spradlin (lspradl2@illinois.edu) on 2014-12-04T19:13:20Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Zhong_Liulin.pdf: 1712853 bytes, checksum: 953a7e7fc4e4fcc579626be9a6264d19 (MD5)","Made available in DSpace on 2015-01-21T19:48:13Z (GMT). No. of bitstreams: 1 Liulin_Zhong.pdf: 1712853 bytes, checksum: 953a7e7fc4e4fcc579626be9a6264d19 (MD5)"],"dc:identifier":["http://hdl.handle.net/2142/72789"],"dc:language":["en"],"dc:rights":["Copyright 2014 Liulin Zhong"],"dc:subject":["Approximate Computing","Performance","Reliability","Design"],"dc:title":["BROAD: bold and reliable online approximate computing framework for diverse applications"],"dc:type":["text"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:07Z"}