Crash Skipping: A Minimal-Cost Framework for Efficient Error Recovery in Approximate Computing Environments

Proceedings of the 2019 on Great Lakes Symposium on VLSI(2019)

引用 6|浏览324
暂无评分
摘要
We present a lightweight technique to minimize error recovery costs in approximate computing environments. We take advantage of the key observation that if an application crashes in a "non-critical" region of its execution, then skipping the crash and allowing the execution to continue oftentimes results in "acceptable" output, due to the inherent fault-tolerance of approximate applications. By skipping application crashes, the program is given a chance to recover from an error on its own, without expending computing power towards error recovery. The system-level support required to implement our Crash Skipping technique imposes negligible overhead. Experimental results from representative approximate applications demonstrate that our technique is effective, resulting in successful error recovery for 56% of application crash cases on average, with a maximum recovery rate of 81%. By combining our technique with application restart, we obtain ~33% improvement in performance/energy consumption compared to recovering from crashes by restarting alone. This benefit is comparable to what can be achieved using aggressive checkpointing techniques, but without the significant costs in system design and complexity that such techniques impose.
更多
查看译文
关键词
approximate computing, reliability, robust systems
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要