0
TECHNICAL PAPERS

Automated Layout Generation and Wiring Area Estimation for 3D Electronic Modules

[+] Author and Article Information
Mike Schäfer

University of Bonn, Department of Computer Science, Römerstraße 164, 53117 Bonn

Thomas Lengauer

GMD National Research Center for Information Technology, Institute for Algorithms and Scientific Computing, Schloß Birlinghoven, 53754 Sankt Augustin University of Bonn, Department of Computer Science, Römerstraße 164, 53117 Bonn

J. Mech. Des 123(3), 330-336 (May 01, 1999) (7 pages) doi:10.1115/1.1371478 History: Received May 01, 1999
Copyright © 2001 by ASME
Your Session has timed out. Please sign back in to continue.

References

Bischoff, E. E., and Wäscher, G., editors, 1995, EJOR; Special Issue on Cutting and Packing, 84 , Elsevier.
Lengauer, T., 1990, Combinatorial Algorithms for Integrated Circuit Layout, Applicable Theory in Computer Science, Wiley-Teubner, Chichester-Stuttgart.
Lengauer,  T. and Müller,  R., 1993, “Robust and Accurate Hierarchical Floorplanning With Integrated Global Wiring,” IEEE Trans. Comput.-Aided Des. Integrated Circuits and Systems,12, No. 6, pp. 802–809.
Kolli, A., Cagan, J., and Rutenbar, R., 1996, “Packing of Generic, Three-Dimensional Components Based on Multi-Resolution Modeling,” Proc. R. Soc. London, Ser. A.
Szykman,  S., and Cagan,  J., 1997, “Constrained Three-Dimensional Component Layout Using Simulated Annealing,” ASME J. Mech. Des., 119, No. 1, pp. 28–35.
Cagan,  J., Degentesh,  D., and Yin,  S., 1998, “A Simulated Annealing-Based Algorithm Using Hierarchical Models for General Three-Dimensional Component Layout,” Comput.-Aided Des., 30, No. 10, pp. 781–790.
Szykman,  S., Cagan,  J., and Weisser,  P., 1998, “An Integrated Approach to Optimal Three Dimensional Layout and Routing,” ASME J. Mech. Des., 120, No. 3, pp. 510–512.
Scheithauer,  G., and Terno,  J., 1993, “Modeling of Packing Problems,” Optimization, 28, pp. 63–84.
Arnov, B., and Sharir, M., 1994, “On Translational Motion Planning in 3-Space,” Proc. R. Soc. London, Ser. A, pp. 21–30.
Flemming, U., and Woodbury, R. F., 1995, “Software Environment to Support Early Phases in Building Design (SEED): Overview,” ASCE Architectural Engineering, 1 No. 4, pp. 147–152, December.
Landon,  M. D., and Balling,  R. J., 1994, “Optimal Packaging of Complex Parametric Solids According to Mass Property Criteria,” ASME J. Mech. Des., 116, pp. 375–381.
Sandgren, E., and Dworak, T., 1988, “Part Layout Optimization Using a Quadtree Representation,” in Advances in Design Automation 1988: Proceedings of the 14th ASME Design Automation Conference, pp. 211–219, Kissimmee.
Szykman,  S., and Cagan,  J., 1996, “Synthesis of Optimal Non-Orthogonal Routes,” ASME J. Mech. Des., 118, No. 3, pp. 419–424.
Mitsuta, T., Kobayashi, Y., Wada, Yu., Kiguchi, T., and Yoshinaga, T., 1986, “A Knowledge-Based Approach to Routing Problems in Industrial Plant Design,” Proc. R. Soc. London, Ser. A, pp. 237–256.
Zhu,  D., and Latombe,  J.-C., 1991, “Mechanization of Spatial Reasoning for Automatic Pipe Layout Design,” Artificial Intelligence for Engineering Design, Analysis and Manufacturing 5, No. 1, pp. 1–20.
Burstein, M., and Hong, S. J., 1983, “Hierarchical VLSI Layout: Simultaneous Wiring and Placement,” Proc. R. Soc. London, Ser. A, pp. 45–60.
Yin,  S., and Cagan,  J., 2000, “An Extended Pattern Search Algorithm for Three-Dimensional Component Layout,” J. Mech. Des., 122, No. 1, pp. 102–108.
Lengauer, T., and Lügering, M., 1993, “Integer Program Formulations of Global Routing and Placement Problems,” in M. Sarrafzadeh and D.T. Lee, editors, Algorithmic Aspects of VLSI Layout, volume 2 of Lecture Notes Series on Computing, pages 167–197. World Scientific, Singapore.
Chvátal, V., 1983, Linear Programming. W. H. Freeman and Company, San Francisco.
Fekete, S., and Schepers, J., 1997, “A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems,” Proc. R. Soc. London, Ser. A, pp. 144–156.
Ghosh,  P. K., 1990, “A Solution of Polygon Containment, Spatial Planning, and Other Related Problems Using Minkowski Operations,” Comput. Vis. Graph. Image Process. 49, pp. 1–35.

Figures

Grahic Jump Location
Values for separation variables sij
Grahic Jump Location
Branching tree and relative arrangements
Grahic Jump Location
Definition of routing cells in 2D. Objects are marked gray, routing cells are labeled with face names.
Grahic Jump Location
Three-dimensional routing graph
Grahic Jump Location
Wiring area estimation for problem instance SG129. This layout was realized in the actual industrial design.
Grahic Jump Location
Space-optimal solution for problem SG129

Tables

Errata

Discussions

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In