Advertisement

A Quick Method for Mapping Cores Onto 2D-Mesh Based Networks on Chip

  • Zhenlong Song
  • Yong Dou
  • Mingling Zheng
  • Weixia Xu
Part of the Communications in Computer and Information Science book series (CCIS, volume 337)

Abstract

With the development of NoC, it becomes an urgent task to efficiently map a complex application onto a specified NoC platform. In the paper, an approach which is called constraint-cluster based simulated annealing (CCSA) is proposed to tackle the mapping problem in 2D-mesh NoC in order to optimize communication energy and execution time. Different from other methods, the relationship among cores that are patitioned into several clusters is considered in our method and according to the relationship constraints are set. Experimental results show that the proposed approach gets shorter execution time with lower energy consumption compared with others algorithms. In VOPD application (4x4), the reduction of execution time is about 75.64% combing the normal simulated annealing. In greater application (8x8 vodx4) the CCSA can save 68.89% . The energy consumption is the lowest among all the compared algorithms.

Keywords

network on a chip (NoC) Application mapping Simulated Annealing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    International Technology Roadmap for Semiconductors (ITRS) (2007), http://www.itrs.net/
  2. 2.
    Dally, W.J.: Computer Architecture is all about interconnect (it is now and will be more so in 2010), HPCA Panel (February 4, 2002)Google Scholar
  3. 3.
    Hu, J., Marculescu, R.: Energy aware communication and task scheduling for network on chip architectures under real time constraints. In: Proc. DATE 2004, pp. 234–239. IEEE, Paris (2004)Google Scholar
  4. 4.
    Nickray, M., Dehyadgari, M., Kusha, A.: Power and delay optimization for network on chip. In: ECCTD 2005, pp. 273–276. IEEE, Cork (2005)Google Scholar
  5. 5.
    Lei, T., Kumar, S.: A two-step genetic algorithm for mapping task graphs to a network on chip architecture. In: DSD 2003, pp. 180–187. IEEE, Antalya (2003)Google Scholar
  6. 6.
    Zhou, W.B., Zhang, Y., Mao, Z.G.: An application specific NoC mapping for optimized delay. In: DTIS 2006, pp. 184–188. IEEE, Gammarth (2006)Google Scholar
  7. 7.
    Kiasari, A.E., Hessabi, S., Sarbazi-Azad, H.: PERMAP: A Performance-Aware Mapping for Application-Specific SoCs. In: International Conference on Application-Specific System Architectures and Processors, ASAP 2008, pp. 73–78 (2008)Google Scholar
  8. 8.
    Cluster-based Simulated Annealing for Mapping Cores onto 2D Mesh Networks on Chip. In: 2008 11th IEEE Workshop Design on Design and Diagnostic of Electronic Circuits and Systems, pp. 1–6 (2008)Google Scholar
  9. 9.
    Lin, H., Zhang, L., Tong, D., Li, X., Cheng, X.: A Fast Hierarchical Multi Objective Mapping Approach for Mesh Based Networks on Chip. Acta Scientiarum Naturalium Universitatis Pekinensis 44(5) (September 2008)Google Scholar
  10. 10.
    Catoni, O.: Metropolis, simulated annealing, and iterated energy transformation algorithms: Theory and experiments. Journal of Complexity 12(4), 595–623 (1996)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Murali, S., Micheli, G.D.: Bandwidth-constrained mapping of cores onto NoC architectures. In: Proceedinlg of Design Automnation, and Test in Europe Conference, pp. 896–901 (2004)Google Scholar
  12. 12.
    Koziris, N., Romesis, M., Tsanakas, P., Papakonstantinou, G.: An Efficient Algorithm for the Physical Mapping of Clustered Task Graphs onto Multiprocessor Architectures. In: Proceedings of the 8th International Conference EuroPDP, Rhodos, Greece, pp. 406–413 (January 2000)Google Scholar
  13. 13.
    Marcon, C., Borin, A., Susin, A., et al.: Time and energy efficient mapping of embedded applications onto NoCs. In: Proceedings of Asia and South Pacific Design Automation Conference, Shanghai, pp. 33–38 (2005)Google Scholar
  14. 14.
    Hemani, A., Jantsch, A., Kumar, S., et al.: Network on a chip: An architecture for billion transistor era. In: Proceedings of the IEEE NorChip Conference, Turku, pp. 166–173 (2000)Google Scholar
  15. 15.
    Moein-darbari, F., et al.: Evaluating the Performance of a chaos genetic algorithm for solving the Network on Chip Mapping Problem. In: 2009 International Conference on Computational Science and Engineering, pp. 366–373 (2009)Google Scholar
  16. 16.
    Shen, W.T., Chao, C.H., KLien, Y., Wu, A.Y.: A New Binomial Mapping and Optimization Algorithm forReduced-Complexity Mesh-Based On-Chip Network. In: Proceeding of the 1st IEEE International Symposium on Networks-on-Chip (NOCS 2007), Princeton, New Jersey, pp. 317–322 (May 2007)Google Scholar
  17. 17.
    Rhee, C.E., Jeong, H.Y., Ha, S.: Many-to-Many Core-Switch Mapping in 2-D Mesh NoC Architectures. In: Proceedings of IEEE International Conference on Computer Design, San Jose, CA, USA, pp. 438–443 (October 2004)Google Scholar
  18. 18.
    Tosun, S.: Cluster-based application mapping method for Network-on-Chip. In: Advances in Engineering Software, vol. 42, pp. 868–874 (2011)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Zhenlong Song
    • 1
  • Yong Dou
    • 1
  • Mingling Zheng
    • 1
  • Weixia Xu
    • 1
  1. 1.School of ComputerNational University of Defense TechnologyChangshaChina

Personalised recommendations