.png){kind=icon}
返回
Minimizing accumulative memory load cost on multi-core DSPs with multi-level memory
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sysarc.2013.05.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In multi-core Digital Signal Processing (DSP) Systems, the processor-memory gap remains the primary obstacle in improving system performance. This paper addresses this bottleneck by combining task scheduling and memory accesses so that the system architecture and memory modules of a multi-core DSP can be utilized as efficiently as possible. To improve the system and memory utilization, the key is to take advantage of locality as much as possible and integrate it into task scheduling. Two algorithms are proposed to optimize memory accesses while scheduling tasks with timing and resource constraints. The first one uses Integer Linear Programming (ILP) to produce a schedule with the most efficient memory access sequence while satisfying the constraints. The second one is a heuristic algorithm which can produce a near optimal schedule with polynomial running time. The experimental results show that the memory access cost can be reduced up to 60% while the schedule length is also shortened. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Scheduling
Memory access
DSPs
Multi-core
Multi-level memory
期刊
IF:
4.1
论文数:
3.0K
被引数:
4.2K
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容