首页> 外文会议>NORCHIP Conference >Layered Spiral Algorithm for memory-aware mapping and scheduling on Network-on-Chip
【24h】

Layered Spiral Algorithm for memory-aware mapping and scheduling on Network-on-Chip

机译:用于内存感知映射和网络上的调度分层螺旋算法

获取原文

摘要

In this paper, Layered Spiral Algorithm (LSA) is proposed for memory-aware application mapping and scheduling onto Network-on-Chip (NoC) based Multi-Processor System-on-Chip (MPSoC). The energy consumption is optimized while keeping high task level parallelism. The experimental evaluation indicates that if memory-awareness is not considered during mapping and scheduling, memory overflows may occur. The underlying problem is also modeled as a Mixed Integer Linear Programming (MILP) problem and solved using an efficient branch-and-bound algorithm to compare optimal solutions with results achieved by LSA. Comparing to MILP solutions, the LSA results demonstrate only about 20% and 12% increase of total communication cost in case of a small and middle size synthetic problem, respectively, while it is order of magnitude faster than the MILP solutions. Therefore, the LSA can find acceptable total communication cost with a low runtime complexity, enabling quick exploration of large design spaces, which is infeasible for exhaustive search.
机译:在本文中,提出了分层螺旋算法(LSA),用于存储器感知应用程序映射和调度到基于网络(NOC)的多处理器上片(MPSOC)。在保持高任务水平并行性的同时优化能量消耗。实验评估表明,如果在映射和调度期间不考虑内存感知,则可能发生内存溢出。底层问题也被建模为混合整数线性编程(MILP)问题,并使用高效的分支和绑定算法进行了解决,以比较LSA实现的结果的最佳解决方案。与MILP解决方案相比,LSA结果分别仅展示小于和中等尺寸的合成问题的总通信成本增加了约20%和12%,而其数量级比MILP解决方案更快。因此,LSA可以找到具有低运行时复杂性的可接受的总通信成本,从而快速探索大型设计空间,这对于详尽的搜索来说是不可行的。

著录项

  • 来源
    《NORCHIP Conference》|2010年||共6页
  • 会议地点
  • 作者

    {missing};

  • 作者单位
  • 会议组织
  • 原文格式 PDF
  • 正文语种
  • 中图分类 TN4-53;
  • 关键词

  • 入库时间 2022-08-21 04:19:51

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号