High level-application analysis techniques & architectures - to explore design possibilities for reduced reconfiguration area overheads in FPGAs executing compute intensive applications

This paper proposes a novel common subgraph extraction algorithm which aims to minimize the total number of gates (reconfiguration area overhead) involved in implementing compute-intensive scientific and media applications using reconfigurable architectures. Motivation behind the proposed research is illustrated using an example from Biochemical Algorithms Library (BALL). The design of novel context adaptable architectures to implement common subgraphs is also proposed with an example from the video warping functions of the MPEG-4 standard. Three different models of mapping such architectures onto hybrid/ pure FPGA systems are proposed. Estimates obtained by applying these techniques and architectures for various media and scientific functions are shown.

[1]  Stephen F. Smith,et al.  Modeling GA Performance for Control Parameter Optimization , 2000, GECCO.

[2]  Horst Bunke,et al.  A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs , 2002, SSPR/SPR.

[3]  Wayne Wolf,et al.  Modern VLSI Design , 1994 .

[4]  Jason Cong,et al.  Application-specific instruction generation for configurable processor architectures , 2004, FPGA '04.

[5]  William C. Regli,et al.  Machining feature-based comparisons of mechanical parts , 2001, Proceedings International Conference on Shape Modeling and Applications.

[6]  Mario Vento,et al.  An Improved Algorithm for Matching Large Graphs , 2001 .

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  J.M.P. Cardoso,et al.  Compilation for FPGA-based reconfigurable hardware , 2003, IEEE Design & Test of Computers.

[9]  Majid Sarrafzadeh,et al.  Instruction generation for hybrid reconfigurable systems , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[10]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[11]  William C. Regli,et al.  Resolving non-uniqueness in design feature histories , 1999, SMA '99.

[12]  Aravind Dasu,et al.  Design of reconfigurable processors , 2004 .

[13]  Wayne Wolf,et al.  FPGA-Based System Design , 2004 .