A Novel Graph Model for Loop Mapping on Coarse-Grained Reconfigurable Architectures

  • Ziyu Yang
  • Ming Yan
  • Dawei Wang
  • Sikun Li
Part of the Communications in Computer and Information Science book series (CCIS, volume 337)


Coarse-Grained Reconfigurable Architectures (CGRAs) provide more opportunities for accelerating data-intensive applications, such as multi-media programs. However, the optimization of critical loops is still challenging issues, since there is lack of application mapping tool of CGRAs. To address this challenge, we first take program feature analysis on the kernel loops of applications. And then we propose a novel graph model called PIA-CDTG containing these features. We implement an efficient task mapping method with a genetic algorithm based on the graph model. Experimental results show that the mapping method with PIA-CDTG is more effective than other features-unaware methods, and make the execution attains high efficiency and availability.


PIA-CDTG Program Feature Analysis Loop Mapping Coarsegrained Reconfigurable Architecture 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Cardoso, J.M.P., Diniz, P.C., Weinhardt, M.: Compiling for reconfigurable computing: A Survey. ACM Computing Surveys 42(4), 1–65 (2010)CrossRefGoogle Scholar
  2. 2.
    Najjar, W., Bohm, W., Draper, B., Hammes, J., Rinker, R., Beveridge, J., Chawathe, M., Ross, C.: High-level language abstraction for reconfigurable computing. Computer 36(8), 63–69 (2003)CrossRefGoogle Scholar
  3. 3.
    Dou, Y., Wu, G., Xu, J., Zhou, X.: A coarse-grained reconfigurable computing architecture with loop self-pipelining. Science in China 38(4), 579–591 (2008)Google Scholar
  4. 4.
    Rinker, R., Carter, M., Patel, A., Chawathe, M., Ross, C., Hammes, J., Najjar, W., Bohm, W.: An automated process for compiling dataflow graphs into reconfigurable hardware. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 9(1), 130–139 (2001)CrossRefGoogle Scholar
  5. 5.
    Gupta, S., Dutt, N., Gupta, R., Nicolau, A.: Loop shifting and compaction for the high-level synthesis of designs with complex control flow. In: Proceedings of Design, Automation and Test in Europe Conference and Exhibition (DATE 2004), vol. 1, pp. 114–119. IEEE Computer Society (2004)Google Scholar
  6. 6.
    Weinhardt, M., Luk, W.: Pipeline vectorization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 20(2), 234–248 (2002)CrossRefGoogle Scholar
  7. 7.
    Park, H., Fan, K., Kudlur, M., Mahlke, S.: Modulo graph embedding: mapping applications onto coarse-grained reconfigurable architectures. In: Proceedings of the 2006 International Conference on Compilers, Architecture and Synthesis for Embedded Systems (CASES 2006), pp. 1–11. ACM (2006)Google Scholar
  8. 8.
    Gong, W.: Synthesizing sequential programs onto reconfigurable computing systems. PhD Thesis, University of California, Santa Barbara (2007)Google Scholar
  9. 9.
    LooPo, Loop parallelization in the polytope model,
  10. 10.
    Stanford University Intermediate Format Group. SUIF Compiler System Version 2,
  11. 11.
    Zhao, P., Yan, M., Li, S.: Performance Optimization of Application Algorithms for Heterogeneous Multi-Processor System-on-Chips. Journal of Software 22(7), 1475–1487 (2011)CrossRefGoogle Scholar
  12. 12.
    Yan, M., Shen, J., Zhao, P., Liu, L., Li, S.: Design and Implementation of an Embedded Visual Media Process SoC. Journal of Electronics 39(2), 249–254 (2011)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Ziyu Yang
    • 1
  • Ming Yan
    • 1
  • Dawei Wang
    • 1
  • Sikun Li
    • 1
  1. 1.School of ComputerNational University of Defense TechnologyChangshaChina

Personalised recommendations