Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
T. Bultan and C. Aykanat, “ A new mapping heuristic based on mean field annealing, ” Journal of Parallel and Distributed Computing, 16 (1992) 292–305.
J.J.Hopfield, and D.W.Tank, “Neural Computation of Decisions in Optimization Problems”, Biolog. Cybern., vol. 52, pp. 141–152, 1985.
S.Kirkpatrick, C.D.Gelatt, and M.P.Vecchi. “ Optimization by simulated annealing”, Science, vol. 220, pp. 671–680, 1983.
J.Rose, “Parallel Global Routing for Standart Cells” IEEE Transactions on Computer-Aided Design Vol. 9 No. 10 pp:1085–1095 October 1990.
S.Brown, J.Rose, Z.Vranesic, “A Detailed Router for Field Programmable Gate Arrays” Proc. International Conference on Computer Aided Desing 1990.
J.Rose and B.Fallah, “ Timing-Driven Routing Segment Assignment in FPGAs ” Proc. Canadian Conference on VLSI
J.Rose, A. El Gamal, A. Sangiovanni-vincentalli, “ Architecture of Filed-Programmable Gate Arrays ” Proceedings of the IEEE pp:1013–1029. Vol:81, No:7, July 1993.
C.Sechen, “VLSI Placement and Global Routing Using Simulated Annealing”, Kluwer Academic Publishers. 1988
J.Greene, V.Roychowdhury, S.Kaptanoglu, A.E.Gamal, “Segmented Channel Routing”, 27th ACM/IEEE Design Automation Conference pp:567–572 1990.
S.Burman, C.Kamalanathan, N.Sherwani, “New Channel Segmentation Model and Routing for High Performance FPGAs”, Proc. International Conference on Computer Aided Desing, pp:22–25 1992
N.Sherwani, “Algorithms for VLSI Physical Design Automation”, Kluwer Academic Publishers. 1993
T.Lengauer, “Combinatorial Algorithms for Integrated Circuit Layout” 1990 Wiley-Teubner Series.
“Fundamentals of Placement and Routing”, Xilinx Co. 1990
“The Programmable Gate Array Data Book”, Xilinx Co. 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haritaoğlu, I., Aykanat, C. (1994). A global routing heuristic for FPGAs based on mean field annealing. In: Hartenstein, R.W., Servít, M.Z. (eds) Field-Programmable Logic Architectures, Synthesis and Applications. FPL 1994. Lecture Notes in Computer Science, vol 849. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58419-6_68
Download citation
DOI: https://doi.org/10.1007/3-540-58419-6_68
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58419-3
Online ISBN: 978-3-540-48783-8
eBook Packages: Springer Book Archive