• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of Low Power Electronics >Energy Efficient Array Computations Using Loop Unrolling with Partial Gray Code Sequence
【24h】

Energy Efficient Array Computations Using Loop Unrolling with Partial Gray Code Sequence

机译：使用带有部分格雷码序列的循环展开的节能阵列计算

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper introduces the translation of a loop with array computation to its loop unrolled version with partial Gray code sequence. This software technique reduces switching activity as well as energy consumption on the address bus of on-chip data memory, which is independent of process technology parameters. Loop unrolling with partial Gray code sequence is suitable for array computations where there are sequential access of array elements, which allows to reschedule the access of array elements in a Gray coded sequence of their addresses, in each iteration of the unrolled loop. The proposed scheme is only applicable to the Harvard Architecture. The expressions for energy consumed on the address bus of the on-chip data memory due to switching activity are derived for both unrolled loop with and without partial Gray code sequence. The proposed translation method finds a relocatable base address of the array so that the partial Gray code sequence is maintained, without any energy-performance overhead and achieves a considerable amount of energy reduction without any performance loss. Array unification is introduced for multiple arrays taking part in computation within a loop. An algorithm that performs array unification and translation of the loop with multiple arrays to its loop unrolled version with partial Gray code sequence has been proposed. The efficacy of the proposed approach is evaluated on five sample programs and ten benchmark programs. 10-93% reduction in switching activity and 10-94% reduction in energy dissipated on the address bus of on-chip data memory have been achieved.
机译：本文介绍了使用数组计算的循环到具有部分格雷码序列的循环展开版本的转换。该软件技术可降低开关活动以及片上数据存储器地址总线上的能耗，而这与工艺技术参数无关。具有部分格雷码序列的循环展开适用于需要顺序访问数组元素的数组计算，这允许在展开循环的每次迭代中按其地址的格雷编码顺序重新安排对数组元素的访问。所提出的方案仅适用于哈佛建筑。对于具有和不具有部分格雷码序列的展开循环，导出了由于开关活动而在片上数据存储器的地址总线上消耗的能量的表达式。所提出的转换方法找到了可重定位的阵列基地址，从而在没有任何能量性能开销的情况下保持了部分格雷码序列，并实现了相当数量的能量减少而没有任何性能损失。为参与循环内计算的多个阵列引入了阵列统一。提出了一种执行数组统一并将具有多个数组的循环转换为具有部分格雷码序列的循环展开版本的算法。在五个示例程序和十个基准程序上评估了所建议方法的有效性。开关活动减少了10-93％，片上数据存储器的地址总线上的能量消耗减少了10-94％。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号