Efficient and Effective Placement for Very Large Circuits

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

Volumn 14, Issue 3, 1995, Pages 349-359

  Sun, Wern Jieh ^a   Sechen, Carl ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; MICROPROCESSOR CHIPS; SIMULATED ANNEALING;

MCNC BENCHMARK CIRCUITS; RECURSIVE PARTITIONING; VERY LARGE CIRCUITS;

INTEGRATED CIRCUIT LAYOUT;

EID: 0029264395     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.365125     Document Type: Article

References (19)

1. J. Cong, L. Hagen, and A. Kahng, “Random walks for circuit clustering,” Proc. IEEE Intl. Conf. on ASIC, June 1991, pp. 14. 2.1–14.2.4.
2. K. Doll, F. M. Johannes, and G. Sigl, “Accurate net models for placement improvement by network flow methods,” Proc. Int. Conf. on Computer-Aided Design, 1992, pp. 594–597.
3. K. Doll, F. M. Johannes, and G. Sigl, “Domino: deterministic placement improvement with hill-climbing capabilities,” Proc. VLSI, 1991, pp. 3b.1.1–3b.1.10.
4. J. Garbers, H. J. Promel, and A. Steger, “Finding clusters in VLSI circuits,” Proc. Int. Conf. on Computer-Aided Design, 1990, pp. 520–523.
5. L. K. Grover, “A new simulated annealing algorithm for standard cell placement,” Proc. Int. Conf. on Computer-Aided Design, 1986, pp. 378–380.
6. L. Hagen and A. B. Kahng, “A new approach to effective circuit clustering,” Proc. Int. Conf. on Computer-Aided Design, 1992, pp. 422–127.
7. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Sci., vol. 220, no. 4598, pp. 671–680, May 13, 1983.
8. J. M. Kleinhans, G. Sigl, F. M. Johannes, and K. J. Antreich, “GORDIAN: VLSI placement by quadratic programming and slicing optimization,” IEEE Trans, on Computer-Aided Design, vol. 10, no. 3, 1991, pp 356–365.
9. K. Kozminski, “Benchmarks for layout synthesis,” Proc. 28th Design Automation Conf., 1991, pp. 265–270.
10. J. Lam and J. M. Delosme, “Performance of a new annealing schedule,” Proc. 25th Design Automation Conf., 1988, pp. 306–311.
11. S. Mallela and L. K. Grover, “Clustering based simulated annealing for standard cell placement,” Proc. 25th Design Automation Conf., 1988, pp. 312–317.
12. G. Sigl, K. Doll and F. M. Johannes, “Analytical placement: a linear or a quadratic objective function?” Proc. Design Automation Conf., 1991, pp. 427–432.
13. C. Sechen, VLSI placement and global routing using simulated annealing. Boston: Kluwer Academic, 1988.
14. C. Sechen and K. W. Lee, “An improved simulated annealing algorithm for row-based placement,” Proc. Int. Conf. on Computer-Aided Design, 1987, pp. 478–481.
15. A. Srinivasan, K. Chaudhary, and E. S. Kuh, “RITUAL: A performance driven placement algorithm for small cell IC's,” Proc. Int. Conf. on Computer-Aided Design, 1991, pp. 48–51.
16. W. Swartz, “Automatic layout of analog and digital mixed macro/standard cell integrated circuits,” Ph.D. dissertation, Yale University, CT, 1993.
17. W. Swartz and C. Sechen, “New algorithms for the placement and routing of macro cells,” Proc. 27th Design Automation Conf., 1988, pp. 336–339.
18. W. Swartz and C. Sechen, “A new generalized row-based global router,” Proc. Intl. Conf. on Computer-Aided Design, 1993, pp. 491–498.
19. C. W. Yeh, C. K. Cheng, and T. T. Lin, “A probabilistic multicommodity-flow solution to circuit clustering problems,” Proc. Int. Conf. on Computer-Aided Design, 1992, pp. 428–431.