首页> 外文期刊>Computing reviews >Compiler driven data layout optimization for regular/irregular array access patterns
【24h】

Compiler driven data layout optimization for regular/irregular array access patterns

机译:编译器驱动的数据布局优化,用于常规/不规则阵列访问模式

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

摘要

Memory access patterns on multiprocessor systems-on-chip (MPSoC) are complex enough that they often defeat hardwired caching strategies. Instead of hardwired caches, these systems use scratch pad memory (SPM), acting as a software-controlled cache on each individual processor.rnDecisions on data placement in SPMs are more straightforward when access patterns in an application are regular than when they are irregular (regular versus irregular applications). What this paper presents are solutions to two problems in the context of irregular applications: how to use profile (runtime) statistics that identify parts of data arrays for copying into SPMs, such that performance and energy consumption are improved, and how to maximize utilization of the SPM resources.
机译:多处理器片上系统(MPSoC)上的内存访问模式非常复杂,以至于它们常常击败硬连线的缓存策略。这些系统使用暂存存储器(SPM)代替硬连线的高速缓存,在每个单独的处理器上充当软件控制的高速缓存。rn在应用程序中的访问模式是规则的情况下,对SPM中数据放置的决定要比在不规则的情况下更直接(常规与不规则应用)。本文介绍的是在不规则应用程序中解决两个问题的解决方案:如何使用配置文件(运行时)统计信息来识别要复制到SPM中的数据阵列的各个部分,从而提高性能和能耗,以及如何最大程度地利用资源SPM资源。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号