Âü°í ¹®Çå [1] G. De Micheli, `Synthesis and Optimization of Digital Circuits,` McGraw-Hill, Inc., 1994. [2] ½ÅÇöö, ±è¿øÁ¾, ÀÌÁÖÇÐ, ÀÌÁ¾¹è, À¯¹®Çö, ¡°´Ü¼øÈµÈ ·¹À̾ƿô ¸ðµ¨À» ÀÌ¿ëÇÑ »õ·Î¿î °èÃþÀû ·¹À̾ƿô ÄÄÆÑÅÍ¡±, Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö, Á¦20±Ç, Á¦3È£, pp. 422-429, 1993. [3] S. M. Sait and H. Youssef, `VLSI Physical Design Automation,` McGraw-Hill Book Co., 1995. [4] M. Garey and D. Johnson, Computers and Intractability, W. H. Freeman and Company, 1979. [5] J. B. Kruskal, `On the shortest spanning subtree of a graph and the traveling salesman problem,` Proc. of American Mathematical Society, pp. 48-50, 1956. [6] Naveed A. Sherwani, `Algorithms for VLSI physical Design Automation,` Kluwer Academic Publishers, 1993. [7] W.-J. Sun and C. Sechen, `Efficient and Effective Placement for Very Large Circuits,` Proc. Intern. Conf. on Computer-Aided Design, pp. 170-177, 1993. [8] A. Iosupovici, C. King, and M. A. Breuer, `A module interchange placement machine,` Proc. 20th Design Automation Conf., pp. 171-174, 1983. [9] M. A. Breuer, `A class of min-cut placement algorithms,` Proc. 14th ACM/IEEE DAC, pp. 284-290, 1977. [10] A. E. Dunlop and B. W. Kernighan, `A procedure for placement of standard-cell VLSI circuits,` IEEE Trans. Computer-Aided Design, vol. CAD-4, pp. 92-98, 1985. [11] P. R. Suaris and G. Kedem, `Quadrisection: A new approach to standard cell layout,` Proc. IEEE ICCAD, pp. 474-477, 1987. [12] S. Mayrhofer and U. Lauther, `Congestion-driven placement using a new multi-partitioning heuristic,` in Proc. IEEE ICCAD, pp. 332-335, 1990. [13] S. Kirkpatrick, C. D. Gelatt Jr. and M. P. Vecchi, `Optimization by simulated annealing,` Science, vol.220, pp. 671-680, 1983. [14] C. Sechen and A. Sangiovanni-Vincentelli, `TimberWolf3.2: A new standard cell placement and global routing package,` Proc. 23rd ACM/IEEE DAC, pp. 432-439, 1986. [15] L. K. Grover, `Standard cell placement using simulated sintering,` in Proc. 24th ACM/IEEE DAC, pp. 56-59, 1987. [16] J. Lam and J. Delosme, `Performance of a new annealing schedule,` Proc. 25th ACM/IEEE DAC, pp. 306-311, 1988. [17] M. L. Yu, `A study of the applicability of Hopfield Decision Neural nets to VLSI CAD,` Proc. of 26th ACM/IEEE DAC, pp. 412-417., 1989 [18] J. P. Cohoon and W. D. Paris, `Genetic placement,` IEEE Trans. CAD, vol. CAD-6, pp. 956-964, Nov. 1987. [19] S. Sahni and A. Bhatt, `The complexity of design automation problems,` in Proc. 17th ACM/IEEE DAC, pp. 402-411, 1980. [20] R. Kling and P. Banerjee, `Empirical and theoretical studies of the simulated evolution method applied to standard cell placement,` IEEE Trans. CAD, vol.10, no.10, pp. 1303-1315, Oct. 1991. [21] H. Shin and C. Kim, `A simple yet effective technique for partitioning,` IEEE Trans. VLSI Systems, Vol.1, No.3, pp.380-386, Sep. 1993. [22] K. Chong and S. Sahni, `Minimizing Total Wire Length by Flipping Modules,` IEEE Trans. CAD, vol. 12, no. 1, pp. 167-175, 1993. [23] M. Igusa, M. Beardslee and A. Sangiovanni-Vincentelli, `ORCA A Sea-of-gates Place and Route System,` Proc. DAC, pp. 122-127, 1989. [24] R.-M. Kling and P. Banerjee, `Optimization by Simulated Evolution with Applications to Standard Cell Placement,` Proc. DAC, pp. 20-25, 1990. [25] C. Sechen, and A. Sangiovanni-Vincentelli, `The Timber Wolf placement and routing package,` IEEE JSSC, Sc-20, pp.510-522, 1985. [26] S. Sutantavabul, E. Shragowitz, and R.-B. Lin, `An Adaptive Timing-Driven Placement for High Performance VLSI`s,` IEEE Trans. CAD, vol. 12, no. 10, pp. 1488-1498, Oct. 1993. [27] M. A. Jackson and E. S. Kuh, `Performance-driven placement of cell based ICs,` Proc. 26th ACM/IEEE DAC, pp. 370-375, 1989. [28] W. E. Donath, et. al., `Timing driven placement using complete path delays,` Proc. 27th ACM/IEEE DAC, pp. 84-89, 1990. [29] A. Srinvasan, K. Chaudhary, and E. S. Kuh, `RITUAL: A performance driven placement algorithm for small-cell ICs,` Proc. IEEE ICCAD, pp. 48-51, 1991. [30] B. M. Riess and G. G. Ettelt, `SPEED: Fast and Efficient Timing Driven Placement,` IEEE Int. Symposium on Circuits And Systems, pp. 377-380, 1995. [31] A. E. Dunlop and V. D. Agrawal et. al., `Chip layout optimization using critical path weighting,` Proc. 21st ACM/IEEE DAC, pp. 133-136, 1984. [32] M. Marek-Sadowska and S. P. Lin, `Timing driven placement,` ICCAD, pp. 94-97, 1989. [33] S. Y. Ohm, F. J. Kurdahi, and N. D. Dutt, `A Unified Lower Bound Estimation Technique for High-Level Synthesis,` IEEE Trans. CAD, vol.16, no.5, pp. 458-472, 1997. [34] S. Chaudhuri and R. A. Walker, `Computing Lower Bounds on Functional Units Before Scheduling,` IEEE Trans. VLSI Systems, vol.4, no.2, pp. 273-279, 1996. [35] I. Ahmad and C. Y. R. Chen, `Post-Processor For Data Path Synthesis Using Multiport Memories,` Proc. IEEE ICCAD, pp. 276-279, 1991. [36] R. Jain, A. C. Parker, and N. Park, `Predicting System-Level Area and Delay for Pipelined and Nonpipelined Designs,` IEEE Trans. CAD, vol.11, no.8, pp. 955-965, 1992. [37] K. Kozminski, `Benchmarks for layout synthesis- evolution and current status,` in Proc. 28th ACM/IEEE DAC, pp. 265-270, 1991. [38] TanGate Manual, TANGENT Corporation, 1989. [39] Performance Driven Layout with GARDS 7, Silvar-Lisco Corporation, Aug. 1991. [40] S. Kim and C. Kyung, `Circuit placement on arbitrarily shaped regions using the self-organization principle,` IEEE Trans. CAD, vol. 11, no. 7, pp. 844-854, July 1992. [41] W. Swartz and C. Sechen, `A New Generalized Row- Based Global Router,` Proc. ICCAD, pp.491-498, 1993. [42] Asic Utility Program User`s Guide (SADAS2.2.1, SATEST 5.4.1), SAMSUNG Electronics, Dec. 1993. [43] C. Kim, W. Kim, H. Shin, K. Rhee, H. Chung, and J. Kim, `Combined Hierarchical Placement Algorithm for Row-Based Layouts,` IEE Electronics Letters, vol. 29, no. 17, pp. 1508-1510, 1993. [44] ±è¿øÁ¾, ½ÅÇöö, ¡°¿µ¿ªÁ¤Á¦¸¦ ÀÌ¿ëÇÑ °èÃþÀû ¹èÄ¡ ±â¹ý¡±, Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö, Á¦21±Ç Á¦6È£, pp. 1018-1025, 1994. [45] ±è¿øÁ¾, ½ÅÇöö, ¡°¹è¼± Àü¿ë ¿µ¿ªÀ» °í·ÁÇÑ °èÃþÀû ¹èÄ¡¡±, ÀüÀÚ°øÇÐȸ ³í¹®Áö, Á¦32±Ç AÆí Á¦2È£, pp. 130-139, 1995. [46] ±è¿øÁ¾, ½ÅÇöö, ¡°·¹À̾ƿô °ËÁõÀ» À§ÇÑ »õ·Î¿î °èÃþÀû ȸ·Î ºñ±³ ±â¹ý¡±, Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö, CÆí Á¦4±Ç Á¦5È£, pp. 785-754, 1998. [47] N. R. Quinn, `The Placement Problem as Viewed from the Physics of Classical Mechanics,` Proc. DAC, pp. 173-178, 1985. [48] K. J. Antreich, F. M. Johannes, and F. H. Kirsch, `A New Approach for Solving the Placement Problem Using Force Models,` Proc. IEEE International Symposium on Circuits and Systems,` pp. 481-486, 1982.
|