Model-based Performance Evaluation of Dynamic Partial Reconfigurable Datapaths for FPGA-based Systems

Dynamic partial-reconfigurable (DPR) FPGAs have the property that all or part of their functionality can be time-multiplexed at run-time. This is achieved by dynamically transferring partial configuration bitstreams from off-chip memory to FPGA configuration memory via a specialized datapath. The performance of this datapath can have a significant impact on overall system performance and should be considered early in the design cycle. Unfortunately, performance measures for such systems can typically be determined only after development. Such measures are heavily dependent upon the detailed characteristics of the datapath and on the particular workload imposed on the system during measurement and thus can only be used to make predictions for systems similar to that used for initial measurements. In this chapter, we outline an approach to model the DPR datapath early in the design cycle using queueing networks. This modeling approach is essential for experimenting with system parameters and for providing statistical insight into the effectiveness of candidate architectures. A case study is provided to demonstrate the usefulness and flexibility of the modeling scheme.

[1]  Bin Zhang,et al.  A multi-platform controller allowing for maximum Dynamic Partial Reconfiguration throughput , 2008, 2008 International Conference on Field Programmable Logic and Applications.

[2]  Ulrich Rückert,et al.  Hardware Support for Dynamic Reconfiguration in Reconfigurable SoC Architectures , 2004, FPL.

[3]  J. R. Jackson Networks of Waiting Lines , 1957 .

[4]  Eric Peskin,et al.  Leveraging Firmware in Multichip Systems to Maximize FPGA Resources: An Application of Self-Partial Reconfiguration , 2008, 2008 International Conference on Reconfigurable Computing and FPGAs.

[5]  Giuseppe Serazzi,et al.  JMT: performance engineering tools for system modeling , 2009, PERV.

[6]  Krishna R. Pattipati,et al.  Approximate mean value analysis algorithms for queuing networks: existence, uniqueness, and convergence results , 1990, JACM.

[7]  Scott Hauck,et al.  Performance of partial reconfiguration in FPGA systems: A survey and a cost model , 2011, TRETS.

[8]  Walter Stechele,et al.  Towards Rapid Dynamic Partial Reconfiguration in Video-Based Driver Assistance Systems , 2010, ARC.

[9]  Pao-Ann Hsiung,et al.  Perfecto: A systemc-based design-space exploration framework for dynamically reconfigurable architectures , 2008, TRETS.

[10]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[11]  Carl M. Harris,et al.  Fundamentals of queueing theory , 1975 .

[12]  Carl M. Harris,et al.  Fundamentals of queueing theory (2nd ed.). , 1985 .