• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

计算机工程与科学

• 论文 • 上一篇    下一篇

一种解决访存调度问题的改进蚁群优化算法

田烁,窦强,王勇,张洪广,周朝兵,李石明   

  1. (国防科学技术大学计算机学院,湖南 长沙 410073)
  • 收稿日期:2016-04-12 修回日期:2016-06-07 出版日期:2016-08-25 发布日期:2016-08-25
  • 基金资助:

    国家核高基重大专项(2015ZX01028101)

An improved ant colony optimization algorithm for#br# memory access scheduling         

TIAN Shuo,DOU Qiang,WANG Yong,ZHANG Hong-guang,ZHOU Chao-bing,LI Shi-ming   

  1. (College of Computer,National University of Defense Technology,Changsha 410073,China)
  • Received:2016-04-12 Revised:2016-06-07 Online:2016-08-25 Published:2016-08-25

摘要:

存储器的访问调度策略是复杂的,不仅仅要考虑具体的电路时序参数,还有访存节拍数。在分析DRAM的特点以及访存调度策略的基础上,考虑DDR3时序规范,提出一种改进的蚁群优化访问调度策略。采用不同的trace作为测试,同贪婪式调度算法作比较,该算法可以有效降低平均总延迟、提高带宽利用率。

关键词: 优化算法, 访存调度, DDR3, 带宽利用率

Abstract:

Memory access scheduling approaches are complicated since they not only depend on circuit timing parameters but also on memory access patterns. Based on the analysis of the characteristics of DRAM and memory access scheduling strategies, we propose an improved ant colony optimization algorithm using DDR3 timing for memory access scheduling. We evaluate the algorithm on four different traces.Compared with the greedy scheduling algorithm, the proposal can effectively reduce the overall average delay and improve bandwidth utilization.

Key words: optimization algorithm, memory access scheduling, DDR3, bandwidth utilization