Two novel multiway circuit partitioning algorithms using relaxed locking

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 16, Issue 2, 1997, Pages 169-178

  Dasdan, Ali ^a   Aykanat, Cevdet ^a  

^a BILKENT UNIVERSITY   (Turkey)

Author keywords

Iterative improvement; Kernighan lin based algorithms; Move based partitioning; Multiway circuit partitioning; Relaxed locking; Very large scale integration (vlsi)

Indexed keywords

COMPUTER AIDED NETWORK ANALYSIS; GENETIC ALGORITHMS; ITERATIVE METHODS; SIMULATED ANNEALING;

KERNIGHAN-LIN BASED ALGORITHMS; MULTIWAY CIRCUIT PARTITIONING; RELAXED LOCKING;

VLSI CIRCUITS;

EID: 0031074192     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.573831     Document Type: Article

References (21)

1. D. G. Schweikert and B. W. Kernighan, A proper model for the partitioning of electrical circuitsProc. 9th ACM/IEEE Design Automation Conf., 1972, pp. 57-62.
2. A. E. Dunlop and B. W. Kernighan, A procedure for placement of standard-cell VLSI circuits,IEEE Trans. Computer-Aided Design, vol. 4, no. 1, pp. 92-98, Jan. 1985.
3. M. R. Garey and D. S. Johnson, Computers and Intractability. New York: Freeman, 1979.
4. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout. Chichester, U.K.: Wiley, 1990.
5. B. W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs,Bell Syst. Tech. J., vol. 49, no. 2, pp. 291-307, Feb. 1970.
6. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon, Optimization by simulated annealing: An experimental evaluation; Part I, graph partitioning,Oper. Res., vol. 37, no. 6, pp. 865-892, Nov. 1989.
7. C. M. Fiduccia and R. M. Mattheyses, A linear-time heuristic for improving network partitionsProc. 19th ACM/IEEE Design Automation Conf., 1982, pp. 175-181.
8. B. Krishnamurthy, An improved min-cut algorithm for partitioning VLSI networks,IEEE Trans. Comput., vol. 33, no. 5, pp. 438-446, May 1984.
9. L. A. Sanchis, Multiple-way network partitioning,IEEE Trans. Comput., vol. 38, no. 1, pp. 62-81, Jan. 1989.
10. C. J. Alpert and A. B. Kahng, Recent directions in netlist partitioning: A survey,Integr. VLSI J., vol. 19, pp. 1-80, Dec. 1995.
11. S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi, Optimization by simulated annealing,Science, vol. 220, no. 4598, pp. 671-680, May 1983.
12. A. G. Hoffmann, The dynamic locking heuristic - a new graph partitioning algorithmProc. IEEE Int. Symp. Circuits Systems, 1994, pp. 173-176.
13. C. Park and Y. Park, An efficient algorithm for VLSI network partitioning problem using a cost function with balancing factor,IEEE Trans. Computer-Aided Design, vol. 12, no. 11, pp. 1686-1694, Nov. 1993.
14. L. W. Hagen, D. J.-H. Huang, and A. B. Kahng, On implementation choices for iterative improvement partitioning algorithmsProc. European Design Automation Conf., pp. 144-149, 1995.
15. R. L. Graham, Bounds for certain multiprocessing anomalies,Bell Syst. Tech. J., vol. 45, pp. 1563-1581, 1966.
16. A. Dasdan and C. Aykanat, Two novel multiway circuit partitioning algorithms, [WWW], Tech. Rep. BU-CEIS-9609, Bilkent Univ., Ankara, Turkey, May 1996, Available http://www.cs.bilkent.edu.tr/
17. H. Shin and C. Kim, A simple yet effective technique for partitioning,IEEE Trans. VLSI Syst., vol. 1, no. 3, pp. 380-386, Sept. 1993.
18. C.-W. Yeh, C.-K. Cheng, and T.-T. Y. Lin, Optimization by iterative improvement: An experimental evaluation on two-way partitioning,IEEE Trans. Computer-Aided Design, vol. 14, no. 2, pp. 145-153, Feb. 1995.
19. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon, Optimization by simulated annealing: An experimental evaluation; Part II, graph coloring and number partitioning,Oper. Res., vol. 39, no. 3, pp. 378-406, May 1991.
20. T. N. Bui, S. Chaudhuri, F. T. Leighton, and M. Sipser, Graph bisection algorithms with good average case behavior.Combinatorica, vol. 7, no. 2, pp. 171-191, 1987.
21. Y.-C. Wei and C.-K. Cheng, Ratio cut partitioning for hierarchical designs,IEEE Trans. Computer-Aided Design, vol. 10, no. 7, pp. 911-921, July 1991.