Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/9861
Title: Architecture-Aware Approximate Computing [Article]
Authors: Karaköy, M.
Kislal, O.
Tang, X.
Kandemir, M.T.
Arunachalam, M.
Keywords: approximate computing
compiler
manycore system
Application programs
Drops
Economic and social effects
Energy conservation
Errors
Critical questions
Different domains
Error bound
Multithreaded
Number of datum
Output accuracy
Output quality
Program slicing
Computer architecture
Issue Date: 2019
Publisher: Association for Computing Machinery
Abstract: Observing that many application programs from different domains can live with less-Than-perfect accuracy, existing techniques try to trade off program output accuracy with performance-energy savings. While these works provide point solutions, they leave three critical questions regarding approximate computing unanswered: (i) what is the maximum potential of skipping (i.e., not performing) data accesses under a given inaccuracy bound?; (ii) can we identify the data accesses to drop randomly, or is being architecture aware critical?; and (iii) do two executions that skip the same number of data accesses always result in the same output quality (error)? This paper first provides answers to these questions using ten multithreaded workloads, and then presents a program slicing-based approach that identifies the set of data accesses to drop. Results indicate 8.8% performance improvement and 13.7% energy saving are possible when we set the error bound to 2%, and the corresponding improvements jump to 15% and 25%, respectively, when the error bound is raised to 4%. © 2019 Copyright is held by the owner/author(s).
URI: https://doi.org/10.1145/3309697.3331508
https://hdl.handle.net/20.500.11851/9861
ISSN: 0163-5999
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection

Show full item record

CORE Recommender

Google ScholarTM

Check

Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.