Name
Abstract | ||
|---|---|---|
Approximate computing, a technique that forgoes quantifiable output accuracy in favor of performance gains, is useful for improving the energy efficiency of error-resilient software, especially in the embedded setting. The identification of program components that can tolerate error plays a crucial role in balancing the energy vs. accuracy trade off in approximate computing. Manual analysis for approximability is not scalable and therefore automated tools which employ static or dynamic analysis have been proposed. However, static techniques are often coarse in their approximations while dynamic efforts incur high overhead. In this work we present ApproxSymate, a framework for automatically identifying program approximations using symbolic execution. ApproxSymate first statically computes symbolic error expressions for program components and then uses a dynamic sensitivity analysis to compute their approximability. A unique feature of this tool is that it explores the previously not considered dimension of program path for approximation which enables safer transformations. Our evaluation shows that ApproxSymate averages about 96% accuracy in identifying the same approximations found in manually annotated benchmarks, outperforming existing automated techniques.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3316482.3326341 | Proceedings of the 20th ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, and Tools for Embedded Systems |
Keywords | Field | DocType |
Approximate Computing, Symbolic Execution | Computer science,Parallel computing,Symbolic execution | Conference |
ISBN | Citations | PageRank |
978-1-4503-6724-0 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Himeshi De Silva | 1 | 0 | 0.34 |
| Andrew Santosa | 2 | 146 | 13.36 |
| Nhut-Minh Ho | 3 | 16 | 3.90 |
| Weng-fai Wong | 4 | 1019 | 83.39 |