Robust and Accurate Hierarchical Floorplanning with Integrated Global Wiring

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

Volumn 12, Issue 6, 1993, Pages 802-809

  Lengauer, Thomas ^a   Muller, Rolf ^b  

^a German National Research Center for Computer Science ^*  (Germany)

^b DAIMLER AG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ELECTRIC NETWORK TOPOLOGY; ELECTRIC WIRING; HIERARCHICAL SYSTEMS; OPTIMIZATION; PARAMETER ESTIMATION; ROBUSTNESS (CONTROL SYSTEMS); TREES (MATHEMATICS);

CIRCUIT PARTITIONING; FRODO SYSTEM; HIERARCHICAL FLOORPLANNING; INTEGRATED GLOBAL WIRING;

INTEGRATED CIRCUIT LAYOUT;

EID: 0027610398     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.229754     Document Type: Article

References (25)

1. M. Burstein and S. J. Hong, 'Hierarchical VLSI layout: Simultaneous wiring and placement,” in Proc. VLSI’83, pp. 45–60, 1983.
2. W.W.M. Dai, B. Eschermann, E. S. Kuh, and M. Pedram, “Hierarchical placement and floorplanning in BEAR,” IEEE Trans. Computer-Aided Design, vol. 8, pp. 1335–1349, 1989.
3. W.W.M. Dai and E. S. Kuh, “Simultaneous floorplanning and global routing for hierarchical building block layout,” IEEE Trans. Computer-Aided Design, vol. CAD-6, pp. 828–827, 1987.
4. C. M. Fiduccia and R. M. Mattheyses, “A linear time heuristic for improving network partitions, “in IEEE/ACM Proc. 19th Design Automation Conf., pp. 175–181, 1982.
5. J. Heistermann and T. Lengauer, “Context-sensitive tile compaction of finite two-dimensional cell arrays,” in Dep. Math. Computer Sci. Univ. of Paderborn, Paderborn, Germany, in preparation.
6. M. A. B. Jackson and E. S. Kuh, “Performance-driven placement of cell based IC’s,” in IEEE/ACM Proc. 26th Design Automation Conf., pp. 370–375, 1989.
7. M. Khellaf, “On the partitioning of graphs and hypergraphs,” Ph.D. dissertation, Dep. IEOR, Univ. of California, Berkeley, 1987.
8. D. Kludzeweit, “Bercksichtigung von vorplazierten Blcken beim Floorplanning basierend auf rekursiven Schaltkreispartitionen,” Master’s thesis, Univ. Paderborn, Paderborn, Germany, 1990.
9. D. P. La Potin and S. W. Director, “Mason: A global floorplanning approach for VLSI design,” IEEE Trans. Computer-Aided Design, vol. CAD-5, pp. 477–489, 1986.
10. U. Lauther, “Top down hierarchical global routing for channelless gate arrays based on linear assignment,” in Proc. VLSI’87, pp. 141 – 151, 1987.
11. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout (Teubner-Wiley Series of Applicable Computer Science). New York: Wiley, 1990.
12. T. Lengauer and R. Mller, “The complexity of floorplanning based on binary circuit partitions,” Tech. Rep. 46, Univ. Paderborn, Dep. Math. Inform., 1988.
13. W. K. Luk, P. Sipila, M. Tamminen, D. Tang, L. S. Woo, and C. K. Wong, “A hierarchical global wiring algorithm for custom chip design,” IEEE Trans. Computer-Aided Design, vol. CAD-6, pp. 518–533, 1987.
14. M. Marek-Sadowska, “Route planner for custom chip design,” in Proc. IEEE Int. Conf on Computer-Aided Design, pp. 246–249, 1986.
15. M. Marek-Sadowska and P. S. Lin, “Timing driven placement,” in Proc. Int. Conf. on Computer-Aided Design, pp. 94–97, 1989.
16. S. Mayrhofer and U. Lauther, “Congestion-driven placement using a new multipartitioning heuristic,” in Proc. Int. Conf. on Computer-Aided Design, pp. 332–335, 1990.
17. R. Mller, “Hierarchisches Floorplanning mit integrierter globaler Verdrahtung,” Ph.D. dissertation thesis, Dep. Math. Computer Sci. Univ. of Paderborn, Paderborn, Germany, 1990.
18. R. H. J. M. Otten, “Efficient floorplan optimization.” in IEEE Proc. Int. Conf. on Computer Design: VLSI in Computers, pp. 499–502, 1983.
19. B. T. Preas and M. J. Lorenzetti, Eds., Physical Design Automation of VLSI Systems. Menlo Park, CA: Benjamin-Cummings, 1988.
20. L. Stockmeyer, “Optimal orientations of cells in slicing floorplan design,” Inform. Cont., vol. 57, 91–101, 1983.
21. W. Swartz and C. Sechen, “New algorithms for the placement and routing of macro cells,” in IEEE Int. Conf. on Computer-Aided Design, pp. 336–339, 1990.
22. T. Wang and D. Wong, “An optimal algorithm for floorplan area optimization,” in IEEE/ACM Proc. 27th Design Automation Conf., pp. 180–186, 1990.
23. E. Wanke, “PLEXUS: A system for implementing hierarchical graph algorithms,” in Proc. Fifth Ann. Symp. on Theoretical Aspects of Computer Science, pp. 403-404; also. Springer Lecture Notes in Computer Science, no. 294, Springer Verlag, New York, 1988.
24. G. Zimmermann, “Top-down design of digital systems,” in Advances in CAD for VLSI, Volume 2: Logic Design and Simulation, E. Hrbst, Ed. New York: North-Holland, pp. 185–206, 1986.
25. —, “A new area and shape function estimation technique for VLSI layouts,” IEEE/ACM Proc. 25th Design Automation Conf., pp. 60–65, 1988.