ETRI Journal

Electronics and Telecommunications Research Institute (한국전자통신연구원)
권호 표지
DOI QR코드

DOI QR Code

Optimized Local Relocation for VLSI Circuit Modification Using Mean-Field Annealing

  • Received : 2009.09.09
  • Accepted : 2010.08.17
  • Published : 2010.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, a fast migration method is proposed. Our method executes local relocation on a model placement where an additional module is added to it for modification with a minimum number of displacements. This method is based on mean-field annealing (MFA), which produces a solution as reliable as a previously used method called simulated annealing. The proposed method requires substantially less time and hardware, and it is less sensitive to the initial and final temperatures. In addition, the solution runtime is mostly independent of the size and complexity of the input model placement. Our proposed MFA algorithm is optimized by enabling module rotation inside an energy function called permissible distances preservation energy. This, in turn, allows more options in moving the engaged modules. Finally, a three-phase cooling process governs the convergence of problem variables called neurons or spins.

Keywords

References

  1. K. Yanagibashi, Y. Takashima, and Y. Nakamura, "A Relocation Method for Circuit Modifications," IEICE Trans. Fundamentals Elect. Commun. Comput. Sci., vol. E90-A, no.12, Dec. 2007, pp. 2743-2751. https://doi.org/10.1093/ietfec/e90-a.12.2743
  2. D.E. Vanden Bout and T.K. Miller, "Improving the Performance of the Hopfield-Tank Neural Network through Normalization and Annealing," Biologica Cybern., vol. 62, 1989, pp.129-139. https://doi.org/10.1007/BF00203001
  3. C. Peterson and B. Soderberg, "A New Method for Mapping Optimization Problems onto Neural Networks," Int. J. Neural Syst., vol. 1, no. 1, 1989, pp. 3-22. https://doi.org/10.1142/S0129065789000414
  4. L. Gislen, C. Peterson, and B. Soderberg, "Complex Scheduling with Potts Neural Networks," Neural Computation, vol. 4, no. 6, 1992, pp. 805-831. https://doi.org/10.1162/neco.1992.4.6.805
  5. T. Bultan and C. Aykanat, "A New Mapping Heuristic Based on Mean Field Annealing," J. Parallel Distributed Computing, vol. 16, no. 4, 1992, pp. 292-305.
  6. M. Ohlsson, C. Peterson, and B. Soderberg, "Neural Networks for Optimization Problems with Inequality Constraints: The Knapsack Problem," Neural Computation, vol. 5, no. 2, 1993, pp. 331-339. https://doi.org/10.1162/neco.1993.5.2.331
  7. M. Ohlsson and H. Pi, "A Study of the Mean Field Approach to Knapsack Problems," Neural Networks, vol. 10, no. 2, 1997, pp. 263-271. https://doi.org/10.1016/S0893-6080(97)89067-3
  8. J. Hokkinen et al., "A Potts Neuron Approach to Communication Routing," Neural Computation, vol. 10, no. 6, 1998, pp. 1587- 1599. https://doi.org/10.1162/089976698300017322
  9. L. Herault and J. Niez, "Neural Networks and Graph k- Partitioning," Complex Syst., vol. 3, 1989, pp. 531-575.
  10. D.E. Vanden Bout and T.K. Miller, "Graph Partitioning Using Annealing Neural Networks," IEEE Trans. Neural Netw., vol. 1, no. 2, 1990, pp. 192-203. https://doi.org/10.1109/72.80231
  11. R. Cimikowski and P. Shope, "A Neural-Network Algorithm for a Graph Layout Problem," IEEE Trans. Neural Netw., vol. 7, no. 2, 1996, pp. 341-345. https://doi.org/10.1109/72.485670
  12. J.S. Yih and P. Mazumder, "A Neural Network Design for Circuit Partitioning," IEEE Trans. Computer-Aided Design, vol. 9, 1990, pp. 1265-1271. https://doi.org/10.1109/43.62771
  13. T. Bultan and C. Aykanat, "Circuit Partitioning Using Mean Field Annealing," Neurocomputing, vol. 8, 1995, pp. 171-194. https://doi.org/10.1016/0925-2312(94)00016-L
  14. C. Aykanat, T. Bultan, and I. Haritaoglu, "A Fast Neural-Network Algorithm for VLSI Cell Placement," Neural Netw., vol. 11, 1998, pp. 1671-1684. https://doi.org/10.1016/S0893-6080(98)00089-6
  15. J.J. Hopfield and D.W. Tank, "Neural Computation of Decisions in Optimization Problems," Biologica Cybern., vol. 52, 1985, pp. 141-152.
  16. S. Kirkpatrick, C.D. Gellat, and M.P. Vecchi, "Optimization by Simulated Annealing," Science, vol. 220, 1983, pp. 671-680. https://doi.org/10.1126/science.220.4598.671
  17. GSRC Benchmark Suits. Available: http://vlsicad.eecs.umich.edu/ BK/CompaSS