期刊文献+

Performance-driven assignment and mapping for reliable networks-on-chips 被引量:1

Performance-driven assignment and mapping for reliable networks-on-chips
原文传递
导出
摘要 Network-on-chip(NoC) communication architectures present promising solutions for scalable communication requests in large system-on-chip(SoC) designs. Intellectual property(IP) core assignment and mapping are two key steps in NoC design, significantly affecting the quality of NoC systems. Both are NP-hard problems, so it is necessary to apply intelligent algorithms. In this paper, we propose improved intelligent algorithms for NoC assignment and mapping to overcome the drawbacks of traditional intelligent algorithms. The aim of our proposed algorithms is to minimize power consumption, time, area, and load balance. This work involves multiple conflicting objectives, so we combine multiple objective optimization with intelligent algorithms. In addition, we design a fault-tolerant routing algorithm and take account of reliability using comprehensive performance indices. The proposed algorithms were implemented on embedded system synthesis benchmarks suite(E3S). Experimental results show the improved algorithms achieve good performance in NoC designs, with high reliability. Network-on-chip (NoC) communication architectures present promising solutions for scalable communication requests in large system-on-chip (SoC) designs. Intellectual property (IP) core assignment and mapping are two key steps in NoC design, significantly affecting the quality of NoC systems. Both are NP-hard problems, so it is necessary to apply intelligent algorithms. In this paper, we propose improved intelligent algorithms for NoC assignment and mapping to overcome the draw-backs of traditional intelligent algorithms. The aim of our proposed algorithms is to minimize power consumption, time, area, and load balance. This work involves multiple conflicting objectives, so we combine multiple objective optimization with intelligent algorithms. In addition, we design a fault-tolerant routing algorithm and take account of reliability using comprehensive performance indices. The proposed algorithms were implemented on embedded system synthesis benchmarks suite (E3S). Experimental results show the improved algorithms achieve good performance in NoC designs, with high reliability.
出处 《Journal of Zhejiang University-Science C(Computers and Electronics)》 SCIE EI 2014年第11期1009-1020,共12页 浙江大学学报C辑(计算机与电子(英文版)
基金 Project supported by the National Natural Science Foundation of China(Nos.60973016 and 61272175) the National Basic Research Program(973) of China(No.2010CB328004) the Youth Backbone Teacher Foundation of Chengdu University of Technology(No.JXGG201305) the Bagui Scholarship Project,China
  • 相关文献

参考文献2

二级参考文献68

  • 1Asano,T.,Asano,T.,Guibas,L.,Hershberger,J.,Imai,H.,1985.Visibility-Polygon Search and Euclidean Shortest Path.Proc.26th Symp.on Foundations of Computer Science,p.155-164.
  • 2Bhattacharya,P.,Gavrilova,M.,2008.Path planning with the required minimum clearance using the Voronoi diagram methodology.IEEE Rob.Autom.Mag.,15(2):58-66.[doi:10.1109/MRA.2008.921540].
  • 3Canny,J.F.,1985.A Voronoi Method for the Piano-Movers Problem.Proc.IEEE Int.Conf.on Robotics and Automation,2:530-535.
  • 4Canny,J.F.,1987.A New Algebraic Method for Robot Motion Planning and Real Geometry.Proc.28th IEEE Annual Symp.on Foundations of Computer Science,p.39-48.
  • 5Canny,J.F.,1988.The Complexity of Robot Motion Planning.MIT Press,Cambridge,MA,USA.
  • 6Caponetto,R.,Fortuna,L.,Fazzino,S.,Xibilia,M.G.,2003.Chaotic sequences to improve the performance of evolutionary algorithms.IEEE Trans.Evol.Comput.,7(3):289-304.[doi:10.1109/TEVC.2003.810069].
  • 7Cen,Y.,Wang,L.,Zhang,H.,2007.Real-Time Obstacle Avoidance Strategy for Mobile Robot Based on Improved Coordinating Potential Field with Genetic Algorithm.IEEE Int.Conf.on Control Applications,p.415-419.[doi:10.1109/CCA.2007.4389268].
  • 8Chang,H.C.,Liu,J.S.,2009.High-Quality Path Planning for Autonomous Mobile Robots with η3-Splines and Parallel Genetic Algorithms.IEEE Int.Conf.on Robotics and Biomimetics,p.1671-1677.[doi:10.1109/ROBIO.2009.4913252].
  • 9Chen,X.,Li,Y.,2006.Smooth Path Planning of a Mobile Robot Using Stochastic Particle Swarm Optimization.Proc.IEEE Int.Conf.on Mechatronics and Automation,p.1722-1727.
  • 10Choset,H.,Lynch,K.M.,Hutchinson,S.,Kantor,G.,Burgard,W.,Kavraki,L.E.,Thrun,S.,2005.Principles of Robot Motion:Theory,Algorithms,and Implementations.MIT Press,Boston.

共引文献11

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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