首页> 外文会议>International Symposium on Static Analysis(SAS 2005); 20050907-09; London(GB) >Memory Space Conscious Loop Iteration Duplication for Reliable Execution
【24h】

Memory Space Conscious Loop Iteration Duplication for Reliable Execution

机译:可靠执行的内存空间自觉循环迭代复制

获取原文
获取原文并翻译 | 示例

摘要

Soft errors, a form of transient errors that cause bit flips in memory and other hardware components, are a growing concern for embedded systems as technology scales down. While hardware-based approaches to detect/correct soft errors are important, software-based techniques can be much more flexible. One simple software-based strategy would be full duplication of computations and data, and comparing the results of the corresponding original and duplicate computations. However, while the performance overhead of this strategy can be hidden during execution if there are idle hardware resources, the memory demand increase due to data duplication can be dramatic, particularly for array-based applications that process large amounts of data. Focusing on array-based embedded computing, this paper presents a memory space conscious loop iteration duplication approach that can reduce memory requirements of full duplication (of array data), without decreasing the level of reliability the latter provides. Our "in-place duplication" approach reuses the memory locations from the same array to store the duplicates of the elements of a given array. Consequently, the memory overhead brought by the duplicates can be reduced. Further, we extend this approach to incorporate "global duplication", which reuses memory locations from other arrays to store duplicates of the elements of a given array. This paper also discusses how our approach operates under a memory size constraint. The experimental results from our implementation show that the proposed approach is successful in reducing memory requirements of the full duplication scheme for twelve array-based applications.
机译:软错误是一种瞬态错误,会导致内存和其他硬件组件发生位翻转,这是嵌入式系统随着技术规模的缩小而日益引起关注的问题。尽管基于硬件的方法可以检测/纠正软错误很重要,但是基于软件的技术可以更加灵活。一种简单的基于软件的策略是完全复制计算和数据,并比较相应原始计算和重复计算的结果。但是,如果存在空闲的硬件资源,虽然可以在执行期间隐藏该策略的性能开销,但由于数据重复而导致的内存需求增加可能会非常大,尤其是对于处理大量数据的基于阵列的应用程序而言。着眼于基于阵列的嵌入式计算,本文提出了一种内存空间感知型循环迭代复制方法,该方法可以减少(阵列数据的)完全复制的内存需求,而不会降低后者提供的可靠性。我们的“就地复制”方法可重复使用同一阵列中的内存位置,以存储给定阵列中元素的重复项。因此,可以减少重复项带来的内存开销。此外,我们将这种方法扩展为合并“全局复制”,该方法可重复使用其他数组中的内存位置来存储给定数组元素的重复项。本文还讨论了我们的方法如何在内存大小约束下运行。从我们的实现中获得的实验结果表明,所提出的方法成功地降低了针对十二个基于数组的应用程序的完全复制方案的内存需求。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号