Approximate computing is an emerging methodology that allows to increase efficiency in a range of resilient applications for an affordable loss of precision or quality. In this paper, we exploit approximation in a mul...
详细信息
ISBN:
(纸本)9781450349208
Approximate computing is an emerging methodology that allows to increase efficiency in a range of resilient applications for an affordable loss of precision or quality. In this paper, we exploit approximation in a multi-criteria optimization approach for the widely used data structure Binary Decision Diagram (BDD) to achieve higher efficiency besides lowering the inaccuracy. For this purpose, we utilize an epsilon-preferred evolutionaryalgorithm giving a higher priority to minimize BDD sizes as well as maintaining certain error constraints. In particular, we propose an adaptive epsilon-setting method which adds an automated factor to the algorithm based on the behavior of the function under approximation. This improves the performances of the algorithm by correcting the effect of the user set error constraints which can restrict the dimensions of the search and can lead to immature convergence. In comparison with the non-optimized BDDs, the proposed algorithm achieves a high gain of 68.02% at a low cost of 2.12% inaccuracy for the whole benchmark set. The experimental results also reveal a considerable improvement of 25.19% in the average value of error rate besides reduction in BDD sizes compared to the manual s-setting approach.
暂无评论