Skip to main content
Log in

On Using Tabu Search for Design Automation of VLSI Systems

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

Tabu search is a meta-heuristic problem solving technique that, when applied carefully, provides near optimal solutions in a very short time. In this paper, we have described the use of tabu search for solving problems related to very large scale integrated (VLSI) circuit design automation. Specifically, we have demonstrated the use for VLSI circuit partitioning and placement. We present a tabu search based circuit bi-partitioning technique that partitions circuits with the goal of minimizing the size of the cutset between the partitions. Then, we use tabu search techniques along with force directed placement techniques to accomplish the physical placement of VLSI circuits on regular two-dimensional arrays with the goal of minimizing the placement time. We use empirical data from partitioning and placement of benchmark circuits to test our techniques. Our methods show improvement when compared to partitioning techniques from the literature and commercially available placement tools. Relative to the literature, our tabu search bi-partitioning technique improves on the best known minimum cuts for several benchmark circuits. Relative to commercially available computer aided design tools, our tabu search based placement approach shows dramatic (20×) speedup in execution time without negative impact on the quality of the solution.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Alpert, C.J., L. Hagen, and A. Kahng. (1996). “A Hybrid Multilevel/Genetic Approach for Circuit Partitioning.” In Physical Design Workshop, pp. 100–105.

  • Alpert, C.J., J. Huang, and A. Kahng. (1997). “Multilevel Circuit Partitioning.” In Proceedings ACM/IEEE Design Automation Conference, pp. 530–533.

  • Alpert, C.J. and S. Yao. (1995). “Spectral Partitioning: The More Eigenvectors, The Better.” In Proceedings of the 32nd ACM/IEEE Design Automation Conference, pp. 195–200.

  • Altera Inc. http://www.altera.com.

  • Andreatta, A.A. and C.C. Ribeiro. (1996). “A Graph Partitioning Heuristic for the Parallel Pseudo-Exhaustive Logical Test of VLSI Combinational Circuits.” Annals of Operation Research 50, 1–36.

    Google Scholar 

  • Betz, V. and J. Rose. (1997). “VPR: A New Packing, Placement, and Routing Tool for FPGA Research.” In Lecture Notes in Computer Science, vol. 1304, Berlin: Springer-Verlag, pp. 213–222.

    Google Scholar 

  • Breuer, M.A. (1977). “Min-Cut Placement.” Journal of Design Automation and Fault Tolerant Computing 1, 343–362.

    Google Scholar 

  • Callahan, T.J., P. Chong, A. DeHon, and J. Wawrzynek. (1998). “Fast Module Mapping and Placement for Datapaths in FPGAs.” In ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, pp. 123–132.

  • Dutt, S. and W. Deng. (1996). “VLSI Circuit Partitioning by Cluster-Removal Using Iterative Improvement Techniques.” Proceedings of the IEEE/ACMInternational Conference on Computer Aided Design, pp. 194–200.

  • Emmert, J.M. and D.K. Bhatia. (1999a). “A Methodology for Fast FPGA Floorplanning.” In ACM Seventh International Symposium on Field-Programmable Gate Arrays, pp. 47–56.

  • Emmert, J.M. and D.K. Bhatia. (1999b). “Fast Timing Driven Placement Using TABU Search.” In IEEE International Symposium on Circuits and Systems.

  • Emmert, J.M. and D.K. Bhatia. (1999c). “Tabu Search: Ultra-Fast Placement for FPGAs.” In Lecture Notes in Computer Science, 9th International Workshop on Field Programmable Logic (FPL99). Berlin: Springer-Verlag, pp. 81–90.

    Google Scholar 

  • Glover, F. and M. Laguna. (1997). Tabu Search, Dordrecht: Kluwer Academic Publishers.

    Google Scholar 

  • Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning, Reading, MA: Addison-Wesley.

    Google Scholar 

  • Hagen, L.W. and A.B. Kahng. (1991). “Fast Spectral Methods for Ratio Cut Partitioning and Clustering.” In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, pp. 10–13.

  • Hanan, M., P.K. Wolff, and B.J. Agule. (1976). “A Study of Placement Techniques.” Design Automation and Fault-Tolerant Computing, pp. 28–61.

  • Kernighan, B.W. and S. Lin. (1970). “An Efficient Heuristic Procedure for Partitioning Graphs.” Bell Sys. Tech. Journal 49, 291–308.

    Google Scholar 

  • Kirkpatrick, S., D.D. Gelatt, and M.P. Vecchi. (1983). “Optimization by Simulated Annealing.” Science 220, 671–680.

    Google Scholar 

  • Krupnova, H., C. Rabedaoro, and G. Saucier. (1997). “Synthesis and Floorplanning for Large Hierarchical FPGAs.” In ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, pp. 105–111.

  • Lim, A. (1996). “Performance Driven Placement Using Tabu Search.” Informatica 7(1).

  • Lim, A., Y.M. Chee, and C.T. Wu. (1991). “Performance Driven Placement with Global Routing for Macro Cells.” In Proceedings of Second Great Lakes Symposium on VLSI, pp. 35–41.

  • Lodha, S.K. and D.K. Bhatia. (1998). “Bipartitioning Circuits Using Tabu Search.” In 11th Annual IEEE International ASIC Conference.

  • Mathur, A., K.C. Chen, and C.L. Liu. (1995). “Re-engineering of Timing Constrained Placements for Regular Architectures.” In IEEE/ACM International Conference on Computer Aided Design, pp. 485–490.

  • Osman, I.H. and J.P. Kelly. (1996). Meta-Heuristics: Theory and Applications, Dordrecht: Kluwer Academic Publishers.

    Google Scholar 

  • Reiss, B.M., K. Doll, and F.M. Johannes. (1994). “Partitioning Very Large Circuits Using Analytical Placement Techniques.” ACM/IEEE Design Automation Conference, pp. 646–651.

  • Sait, S.M. and H. Youssef. (1995). VLSI Physical Design Automation, IEEE Press.

  • Shi, J. and D. Bhatia. (1997). “Performance Driven Floorplanning for FPGA Based Designs.” In ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, pp. 112–118.

  • Song, L. and A. Vannelli. (1992). “A VLSI Placement Method Using Tabu Search.” In Microelectronics Journal 23, pp. 167–172.

    Google Scholar 

  • Togawa, N., M. Yanagisawa, and T. Ohtsuki. (1998). “Maple-Opt: A Performance-Oriented Simultaneous Technology Mapping, Placement, and Global Routing Algorithm for FPGA's.” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 17, 803–823.

    Google Scholar 

  • Xilinx Inc. http://www.xilinx.com.

  • Yamanouchi, T., K. Tamakashi, and T. Kambe. (1996). “Hybrid Floorplanning Based on Partial Clustering and Module Restructuring.” In Proceedings of the IEEE International Conference on Computer-Aided Design, pp. 478–483.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to John M. Emmert.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Emmert, J.M., Lodha, S. & Bhatia, D.K. On Using Tabu Search for Design Automation of VLSI Systems. Journal of Heuristics 9, 75–90 (2003). https://doi.org/10.1023/A:1021893712145

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021893712145

Navigation