期刊文献+

利用后溯重调度过程优化簇间数据交互

Optimizing inter-cluster data communications through optimized backward rescheduling
原文传递
导出
摘要 在多簇处理器情况下,指令应用所带来的簇间数据交互问题已经成为制约处理器性能的关键问题。针对此问题提出了在一般的调度后进行一次后溯重调度优化过程,减少了簇间的数据交互量,提高了编译器关于处理器的利用率,同时减少了编译生成的指令序列运行时所消耗的功耗。实验结果表明,利用该方法进行调度,比列表调度算法簇间数据交互量减少平均44.36%,调度后的指令执行时间的平均减少量为24.93%,比UAS(unified assign and schedule)调度算法簇间数据交互量减少平均31.25%,调度后的指令执行时间的平均减少量为14.62%。 As clustering becoming more essential for embedded computer systems, compilers for clustered systems must carefully assign instructions in the clusters to minimize the inter-cluster data communications which degrade performance and increase power consumption. This work proposed an optimized backward rescheduling process which runs after the traditional scheduling process. The tests show the rescheduling reduces the inter-cluster communications by 44% on average when compared to list scheduling, and reduces the final execution time by 25%. When compared with UAS (unified assign and schedule) algorithm, the inter-cluster communications are reduced by 31% and the execution time by 15%.
出处 《清华大学学报(自然科学版)》 EI CAS CSCD 北大核心 2009年第10期1688-1691,共4页 Journal of Tsinghua University(Science and Technology)
基金 国家自然科学基金资助项目(60236030) 博士点/博士后项目(20050003083) 清华大学基础研究基金项目
关键词 分簇 簇间数据交互 后溯重调度 clustering inter cluster communication backward rescheduling
  • 相关文献

参考文献8

  • 1Muller S M, Vishkin U. Conflict-free access to multiple single-ported register files [C]//Proceedings of the llth International Symposium on Parallel Processing. Geneva, Switzerland, 1997:672-678.
  • 2Zalamea J, Llosa J, Ayguade E, et al. Two-level hierarchical register file organization for VLIW processors [C]//Proceedings of 33rd Annual IEEE/ACM International Symposium on Microarchitecture. Monterey, California, 2000: 137 - 146.
  • 3Fisher J A, Faraboschi P, Young C. Embedded Computing [M]. Published by Elsevier Inc, 2005.
  • 4Zhang Y J, He H, Zhou Z X, et al. A scalable DSP System for ASIP design [C]//Asia Solid-State Circuit Conference. Taiwan, 2006.
  • 5Rhodes D, Dick R. Task Graph For Free [EB/OL].(2000). http: //ziyang. ece. northwestern, edu/tgff/.
  • 6Ellis J R. A compiler for VLIW architecture [M]. London: the MIT Press, 1986.
  • 7Terechko A S, Corporaal H. Inter-cluster communication in VLIW architectures [C]//ACM Transactions on Architecture and Code Optimization, 2007. April 2.
  • 8Capitanio A, Dutt N, Nicolau A. Partitioned register files for VLIWs: A preliminary analysis of tradeoffs [C]// Proceedings of 25th International Symposia on Mieroarchitecture. Oregon, Portland, 1992:292 - 300.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部