Efficient list-approximation techniques for floorplan area minimization

ACM Transactions on Design Automation of Electronic Systems

Volumn 6, Issue 3, 2001, Pages 372-400

  Hu, X ^a   Chen, D Z ^a   Sambandam, R ^b  

^a University of Notre Dame   (United States)

^b INTEL TECHNOLOGY INDIA PVT LTD   (India)

Author keywords

Area minimization; Floorplanning; K link shortest paths; List approximation

Indexed keywords

EID: 23044526553     PISSN: 10844309     EISSN: None     Source Type: Journal    
DOI: 10.1145/383251.383257     Document Type: Article

References (17)

1. AGGARWAL, A., KLAWE, M. M., MORAN, S., SHOR, P., AND WILBER, R. 1987. Geometric applications of a matrix-searching algorithm. Algorithmica 2, 195-208.
2. AGGARWAL, A., SCHIEBER, B., AND TOKUYAMA, T. 1993. Finding a minimum weight k-link path in graphs with Monge property and applications. In Proceedings of the 9th Annual ACM Symposium on Computational Geometry. ACM, New York, pp. 189-197.
3. COLE, R. 1987. Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34, 200-208.
4. GALIL, Z., AND PARK, K. 1992. Dynamic programming with convexity, concavity and sparsity. Theoret. Comput. Sci. 92, 49-76.
5. LAWLER, E. L. 1979. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston.
6. LENGAUER, T., AND MULLER, R. 1990. A robust framework for hierarchical floorplanning with integrated global wiring. In Proceedings of the IEEE International Conference on Computer-Aided Design. IEEE Computer Society Press, Los Alamitos, Calif., pp. 148-151.
7. MEGIDDO, N. 1983. Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30, 852-865.
8. NARAYANANAN, V., LAPOTIN, D., GUPTA, R., AND VIJAYAN, G. 1995. PEPPER - A timing driven early floorplanner. In Proceedings of the IEEE International Conference on Computer Design (ICCD'95). IEEE Computer Society Press, Los Alamitos, Calif., pp. 230-235.
9. OTTEN, R. H. J. M. 1982. Automatic floorplan design. In Proceedings of the 19th ACM/IEEE Design Automation Conference. ACM, New York, pp. 261-267.
10. PAN, P., AND LIU, C. L. 1995. Area minimization for floorplans. IEEE Trans. Comput.-Aided Des. Integ. Circ. Syst. 14, 1, 123-132.
11. PAN, P., SHI, W., AND LIU, C. L. 1996. Area minimization for hierarchical floorplans. Algorithmica 15, 6, 550-571.
12. PEDRAM, M., AND PREAS, B. 1990. A hierarchical floorplanning approach. In Proceedings of the IEEE International Conference on Computer Design. IEEE Computer Society Press, Los Alamitos, Calif., pp. 332-338.
13. SCHIEBER, B. 1995. Computing a minimum-weight k-link path in graphs with the concave Monge property. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 405-411.
14. STOCKMEYER, L. 1983. Optimal orientations of cells in slicing floorplan designs. Inf. Contr. 59, 91-101.
15. WANG, T.-C., AND WONG, D. F. 1992. Optimal floorplan area optimization. IEEE Trans. Computer-Aided Design 11, 8, 992-1002.
16. WANG T.-C., AND WONG, D. F. 1993. Graph-based techniques to speedup floorplan area optimization. Integration, the VLSI J. 15, 179-199.
17. ZIMMERMANN, G. 1988. A new area and shape function estimation technique for VLSI layouts. In Proceedings of the 25th ACM/IEEE Design Automation Conference. ACM, New York, pp. 60-65.