Minimization of the reconfiguration latency for the mapping of applications on FPGA-based systems

ABSTRACT

Field-Programmable Gate Arrays (FPGAs) have become promising mapping fabric for the implementation of System-on-Chip (SoC) platforms, due to their large capacity and their enhanced support for dynamic and partial reconfigurability. Design automation support for partial reconfigurability includes several key challenges. In particular, reconfiguration algorithms need to be developed to effectively exploit the available area and run-time reconfiguration support for instantiating at run-time the hardware components needed to execute multiple applications concurrently. These new algorithms must be able to achieve maximum application execution performance at a minimum reconfiguration overhead.

In this work, we propose a novel design flow that minimizes the amount of core reconfigurations needed to map multiple applications dynamically (i.e., using run-time reconfiguration) on FPGAs. This new mapping flow features a multi-stage design optimization algorithm that makes it possible to reduce the reconfiguration latency up to 43%, by taking into account the reconfiguration costs and SoC block reuse between the different applications that need to be executed dynamically on the FPGA. Moreover, we show that the proposed multi-stage optimization algorithm explores a large set of mapping trade-offs, by taking into account the traffic flows for each application, the run-time reconfiguration costs and the number of reconfigurable regions available on the FPGA.

REFERENCES

• 1: Flamand, E.: Strategic directions towards multicore application specific computing. Design, Automation and Test in Europe Conference and Exhibition, 2009 (2009)
• 2: L. Shang, e.a.: Slopes: HardwareÐsoftware cosynthesis of low-power real-time distributed embedded systems with dynamically reconfigurable fpgas. IEEE TCAD 26 (2007) 508--526
• 3: Hubner, M., Braun, L., Gohringer, D., Becker, J.: Run-time reconfigurable adaptive multilayer network-on-chip for fpga-based systems. Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International Symposium on (April 2008) 1--6
• 4: Chen, W., Wang, Y., Wang, X., Peng, C.: A new placement approach to minimizing fpga reconfiguration data. Embedded Software and Systems, 2008. ICESS '08. International Conference on (July 2008) 169--174
• 5: Becker, J., Hubner, M., Hettich, G., Constapel, R., Eisenmann, J., Luka, J.: Dynamic and partial fpga exploitation. Proceedings of the IEEE 95(2) (Feb. 2007) 438--452
• 6: Singhal, L., Bozorgzadeh, E.: Multi-layer floorplanning on a sequence of reconfigurable designs. Field Programmable Logic and Applications, 2006. FPL '06. International Conference on (Aug. 2006) 1--8
• 7: Murali, S., De Micheli, G.: Bandwidth-constrained mapping of cores onto noc architectures. Design, Automation and Test in Europe Conference and Exhibition, 2004. Proceedings 2 (Feb. 2004) 896--901 Vol.2
• 8: Murali, S., Coenen, M., Radulescu, A., Goossens, K., De Micheli, G.: A methodology for mapping multiple use-cases onto networks on chips. Design, Automation and Test in Europe, 2006. DATE '06. Proceedings 1 (March 2006) 1--6
• 9: Chaubal, A.P.: Design and implementation of an fpga-based partially reconfigurable network controller. Master's thesis, Virginia Polytechnic Institute and State University (2004)
• 10: Castillo, J., Huerta, P., López, V., Martínez, J.I.: A secure self-reconfiguring architecture based on open-source hardware. In: International Conference on Reconfigurable Computing and FPGAs. (2005)
• 11: Ju Hwa Pan Mitra, T.W.F.W.: Configuration bitstream compression for dynamically reconfigurable fpgas. Computer Aided Design, 2004. ICCAD-2004. IEEE/ACM International Conference on (November 2004) 766--773
• 12: Ghiasi, S., Nahapetian, A., Sarrafzadeh, M.: An optimal algorithm for minimizing run-time reconfiguration delay. Trans. on Embedded Computing Sys. 3(2) (2004) 237--256
• 13: Huang, C., Vahid, F.: Dynamic coprocessor management for fpga-enhanced compute platforms. In: CASES '08: Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems, New York, NY, USA, ACM (2008) 71--78
• 14: A. Hansson, e.a.: A unified approach to mapping and routing on a combined guaranteed service and best-effort network-on-chip architectures. Technical Report No: 2005/00340, Philips Research (2005)
• 15: Vazirani, V.: Approximation algorithms. Springer-Verlag (2001)
• 16: Fekete, S., van der Veen, J., Ahmadinia, A., Gohringer, D., Majer, M., Teich, J.: Offline and online aspects of defragmenting the module layout of a partially reconfigurable device. Very Large Scale Integration (VLSI) Systems, IEEE Transactions on 16(9) (Sept. 2008) 1210--1219
• 17: Lu, Y., Marconi, T., Gaydadjiev, G., Bertels, K., Meeuws, R.: A self-adaptive on-line task placement algorithm for partially reconfigurable systems. Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International Symposium on (April 2008) 1--8
• 18: Xilinx: Xapp290 -- two flows for partial reconfiguration: Module based or difference based (September 2004)
• 19: Xilinx: Early access partial reconfiguration user guide. (March 2006)
• 20: Hendrickson, B., Leland, R.W.: A multi-level algorithm for partitioning graphs. In: Supercomputing. (1995)
• 21: Dall'Osso, M., Biccari, G., Giovannini, L., Bertozzi, D., Benini, L.: Xpipes: a latency insensitive parameterized network-on-chip architecture for multiprocessor socs. Computer Design, 2003. Proceedings. 21st International Conference on (Oct. 2003) 536--539
• 22: Bertozzi, D., Benini, L.: Xpipes: a network-on-chip architecture for gigascale systems-on-chip. Circuits and Systems Magazine, IEEE 4(2) (2004) 18--31

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.3 SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS
      Subjects: Real-time and embedded systems

General Terms:
Algorithms, Design, Performance

Keywords:
FPGAs, mapping algorithms, reconfigurable computing