On Simplifying Placement and Routing by Extending Coarse-Grained Reconfigurable Arrays with Omega Networks

  • Ricardo Ferreira
  • Alex Damiany
  • Julio Vendramini
  • Tiago Teixeira
  • João M. P. Cardoso
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5453)


Most reconfigurable computing architectures suffer from computationally demanding Placement and Routing (P&R) steps which might hamper their use in contexts requiring dynamic compilation (e.g., to guarantee application portability in embedded systems). Bearing in mind the simplification of P&R steps, this paper presents and analyzes a coarse-grained reconfigurable array extended with global Omega Networks. We show that integrating one or two Omega Networks in a coarse-grained array simplifies the P&R stage with both low hardware resource overhead and low performance degradation (18% for an 8×8 array). The experimental results included permit to compare the coarse-grained array with one or two Omega Networks with a coarse-grained array based on a grid of processing elements with neighbor connections. When comparing the execution time to perform the P&R stage needed for the two arrays, we show that the array using two Omega Networks needs a far simple P&R which for the benchmarks used completed on average in about 20× less time.


Execution Time IEEE Computer Society Neighbor Connection Area Cost Extra Level 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hauck, S., DeHon, A.: Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation. Morgan Kaufmann, San Francisco (2007)zbMATHGoogle Scholar
  2. 2.
    Mei, B., Lambrechts, A., Verkest, D., Mignolet, J.Y., Lauwereins, R.: Architecture exploration for a reconfigurable architecture template. IEEE Des. Test 22(2), 90–101 (2005)CrossRefGoogle Scholar
  3. 3.
    Volker Baumgarten, E.: PACT XPP - A Self-Reconfigurable Data Processing Architecture. The Journal of Supercomputing (TJS) 26(2), 167–184 (2003)CrossRefzbMATHGoogle Scholar
  4. 4.
    Lawrie, D.H.: Access and alignment of data in an array processor. IEEE Trans. Comput. 24(12) (1975)Google Scholar
  5. 5.
    Hartenstein, R.: A decade of reconfigurable computing: a visionary retrospective. In: DATE 2001: Proceedings of the conference on Design, automation and test in Europe, pp. 642–649. IEEE Press, Piscataway (2001)CrossRefGoogle Scholar
  6. 6.
    Bansal, N., Gupta, S., Dutt, N., Nicolau, A., Gupta, R.: Network topology exploration of mesh-based coarse-grain reconfigurable architectures. In: DATE 2004: Proceedings of the conference on Design, automation and test in Europe, p. 10474. IEEE Computer Society, Washington (2004)Google Scholar
  7. 7.
    Yeh, Y.M., yun Feng, T.: On a class of rearrangeable networks. IEEE Trans. Comput. 41(11), 1361–1379 (1992)CrossRefGoogle Scholar
  8. 8.
    Andresen, S.: The looping algorithm extended to base 2t rearrangeable switching networks. IEEE Trans. Commun. 25(10), 1057–1063 (1977)CrossRefGoogle Scholar
  9. 9.
    Hu, Q., Shen, X., Liang, W.: Optimally routing lc permutations on k-extra-stage cube-type networks. IEEE Trans. Comput. 45(1), 97–103 (1996)CrossRefzbMATHGoogle Scholar
  10. 10.
    Zied, M., Hayder, M., Emna, A., Habib, M.: Efficient tree topology for fpga interconnect network. In: GLSVLSI 2008: Proceedings of the 18th ACM Great Lakes symposium on VLSI, pp. 321–326. ACM, New York (2008)CrossRefGoogle Scholar
  11. 11.
    Kim, J., Dally, W.J., Abts, D.: Flattened butterfly: a cost-efficient topology for high-radix networks. SIGARCH Comput. Archit. News 35(2), 126–137 (2007)CrossRefGoogle Scholar
  12. 12.
    DeHon, A., Huang, R., Wawrzynek, J.: Hardware-assisted fast routing. In: FCCM 2002: Proceedings of the 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, p. 205. IEEE Computer Society, Washington (2002)Google Scholar
  13. 13.
    Benes, V.E.: Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, New York (1965)zbMATHGoogle Scholar
  14. 14.
    Lee, K.Y.: A new benes network control algorithm. IEEE Trans. Comput. 36(6), 768–772 (1987)Google Scholar
  15. 15.
    Goldstein, S.C., Schmit, H., Moe, M., Budiu, M., Cadambi, S., Taylor, R.R., Laufer, R.: Piperench: a co/processor for streaming multimedia acceleration. In: ISCA 1999: Proceedings of the 26th annual international symposium on Computer architecture, pp. 28–39. IEEE Computer Society, Washington (1999)Google Scholar
  16. 16.
    Tessier, R.G.: Fast Place and Route Approaches for FPGAs. Phd thesis, MIT, Massachusetts Institute of Technology (1999)Google Scholar
  17. 17.
    Mei, B., Vernalde, S., Verkest, D., Man, H.D., Lauwereins, R.: Exploiting loop-level parallelism on coarse-grained reconfigurable architectures using modulo scheduling. In: DATE 2003: Proceedings of the conference on Design, Automation and Test in Europe, p. 10296. IEEE Computer Society, Washington (2003)Google Scholar
  18. 18.
    Ferreira, R., Garcia, A., Teixeira, T., Cardoso, J.M.P.: A polynomial placement algorithm for data driven coarse-grained reconfigurable architectures. In: ISVLSI, pp. 61–66. IEEE Computer Society, Los Alamitos (2007)Google Scholar
  19. 19.
    ExPRESS Benchmarks: Electrical & Computer Engineering Department at the UCSB, USA (last access on November 3rd 2008),
  20. 20.
    Mehta, G., Stander, J., Baz, M., Hunsaker, B., Jones, A.K.: Interconnect customization for a coarse-grained reconfigurable fabric. In: Parallel and Distributed Processing Symposium, International, pp. 1–8. IEEE Computer Society, Los Alamitos (2007)Google Scholar
  21. 21.
    Lysecky, R., Vahid, F., Tan, S.X.D.: Dynamic fpga routing for just-in-time fpga compilation. In: DAC 2004: Proceedings of the 41st annual conference on Design automation, pp. 954–959. ACM, New York (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Ricardo Ferreira
    • 1
  • Alex Damiany
    • 1
  • Julio Vendramini
    • 1
  • Tiago Teixeira
    • 1
  • João M. P. Cardoso
    • 2
  1. 1.Dep. de InformáticaUniversidade Federal VicosaVicosaBrazil
  2. 2.Dep. de Engenharia Informática, Faculdade de EngenhariaUniversidade do PortoPortoPortugal

Personalised recommendations