A Global Routing Heuristic for FPGAs Based on Mean Field Annealing

In this paper, we propose an order-independent global routing algorithm for SRAM type FPGAs based on Mean Field Annealing. The performance of the proposed global routing algorithm is evaluated in comparison with LocusRoute global router on ACM/SIGDA Design Automation benchmarks. Experimental results indicate that the proposed MFA heuristic performs better than the LocusRoute in terms of the distribution of the channel densities.

[1]  Sinan Kaptanoglu,et al.  Segmented channel routing , 1991, DAC '90.

[2]  Cevdet Aykanat,et al.  An Effective Model to Decompose Linear Programs for Parallel Solution , 1996, PARA.

[3]  Bülent Özgüç,et al.  Active Pixel Merging on Hypercube Multicomputers , 1996, HPCN Europe.

[4]  Cevdet Aykanat,et al.  Efficient Fast Hartley Transform Algorithms for Hypercube-Connected Multicomputers , 1995, IEEE Trans. Parallel Distributed Syst..

[5]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[6]  Bülent Özgüç,et al.  Efficient parallel spatial subdivision algorithm for object-based parallel ray tracing , 1994, Comput. Aided Des..

[7]  Cevdet Aykanat,et al.  A Reconfiguration Algorithm for Fault Tolerance in a Hypercube Multiprocessor , 1988, Information Processing Letters.

[8]  Cevdet Aykanat,et al.  Efficient Overlapped Fft Algorithms for Hypercube-connected Multicomputers , 1994, Parallel Algorithms Appl..

[9]  Cevdet Aykanat,et al.  An Efficient Mean Field Annealing Formulation for Mapping Unstructured Domains to Hypercubes , 1995, IRREGULAR.

[10]  Tahsin M. Kurç,et al.  Parallelization of Lee's Routing Algorithm on a Hypercube Multicomputer , 1991, EDMCC.

[11]  A. El Gamal,et al.  Architecture of field-programmable gate arrays , 1993, Proc. IEEE.

[12]  Jonathan Rose.  Parallel global routing for standard cells , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Ümit V. Çatalyürek,et al.  Decomposing Irregularly Sparse Matrices for Parallel Matrix-Vector Multiplication , 1996, IRREGULAR.

[14]  Jonathan Rose,et al.  A detailed router for field-programmable gate arrays , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[15]  Cevdet Aykanat,et al.  Vectorization and parallelization of the conjugate gradient algorithm on hypercube-connected vector processors , 1990 .

[16]  Tevfik Bultan,et al.  Circuit partitioning using mean field annealing , 1995, Neurocomputing.

[17]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[18]  Ümit V. Çatalyürek,et al.  Decomposing Linear Programs for Parallel Solution , 1995, PARA.

[19]  Bülent Özgüç,et al.  Comparison of Two Image-Space Subdivision Algorithms for Direct Volume Rendering on Distributed-Memory Multicomputers , 1995, PARA.

[20]  N. Guven,et al.  Algorithms for efficient vectorization of repeated sparse power system network computations , 1995 .

[21]  Cevdet Aykanat,et al.  Routing Algorithms for IBM SP1 , 1994, PCRCW.

[22]  Cevdet Aykanat,et al.  A Fault-Tolerant Hexagonal Systolic Array , 1992, Inf. Process. Lett..

[23]  San Francisco,et al.  28th ACM/IEEE DESIGN AUTOMATION CONFERENCE@ , 1991 .

[24]  Bülent Özgüç,et al.  A parallel progressive radiosity algorithm based on patch data circulation , 1996, Comput. Graph..

[25]  Naveed A. Sherwani,et al.  New channel segmentation model and associated routing algorithm for high performance FPGAs , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

[26]  Carl Sechen,et al.  VLSI Placement and Global Routing Using Simulated Annealing , 1988 .

[27]  P. Sadayappan,et al.  Iterative Algorithms for Solution of Large Sparse Systems of Linear Equations on Hypercubes , 1988, IEEE Trans. Computers.

[28]  Tevfik Bultan,et al.  A New Mapping Heuristic Based on Mean Field Annealing , 1992, J. Parallel Distributed Comput..