Abstract
This paper presents parallel algorithms for solving the final placement problem of rectangular cells with predefined neighborhood relations. Optimum solutions for small cell subsets are obtained by enumerating all arrangements, i.e. slicing structures. These solutions are combined in a global construction step such that they fit well into the global arrangement.
An increased size of the enumerated local subproblems leads to placements that are closer to a global optimum. However, this requires significantly larger computing resources. Parallel computers provide huge amounts of computing power and memory that can be used to meet these high demands.
In this paper, we present new algorithms to solve this problem on several parallel architectures. By adjusting the granularity of the algorithm to the properties of the specific target architecture, we achieve significant speed-ups.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C. Sechen, VLSI Placement and Routing Using Simulated Annealing. Kluwer Academic, 1988.
U. Lauther, “A min-cut placement algorithm for general cell assemblies based on a graph representation,” 16th DAC, pp. 1–10, 1979.
D. P. LaPotin and S. W. Director, “Mason: A global floorplanning approach for VLSI design,” IEEE Trans. on CAD, vol. 5, no. 4, pp. 477–489, 1986.
W.-M. Dai and E. S. Kuh, “Simultaneous floor planning and global routing for hierarchical building-block layout,” IEEE Trans. on CAD, vol. 6, no. 5, pp. 828836, 1987.
L. Sha and R. W. Dutton, “An analytical algorithm for placement of arbitrarily sized rectangular blocks,” 22nd DAC, pp. 602–608, 1985.
J. M. Kleinhans, G. Sigl, and F. M. Johannes, “GORDIAN: A new global optimization/rectangle dissection method for cell placement,” ICCAD, pp. 506–509, 1988.
A. A. Szepieniec and R. H. J. M. Otten, “The genealogical approach to the layout problem,” 17th DAC, pp. 164–170, 1980.
R. H. J. M. Otten, “Efficient floorplan optimization,” ICCD, pp. 499–501, 1983.
L. Stockmeyer, “Optimal orientations of cells in slicing floorplan designs,” Information and Control, vol. 57, pp. 91–101, 1983.
L. P. P. P. van Ginneken and R. H. J. M. Otten, “Optimal slicing of plane point placements,” EDAC, pp. 322–326, 1990.
H. Spruth and G. Sigl, “Parallel algorithms for slicing based final placement,” Euro-DAC, pp. 40–45, 1992.
G. Zimmermann, “A new area and shape function estimation technique for VLSI layouts,” 25th DAC, pp. 60–65, 1988.
J. M. Kleinhans, G. Sigl, F. M. Johannes, and K. J. Antreich, “GORDIAN: VLSI placement by quadratic programming and slicing optimization,” IEEE Transactions on Computer-Aided Design, vol. 10, no. 3, pp. 356–365, 1991.
G. Sigl and U. Schlichtmann, “Goal oriented slicing enumeration through shape function clipping,” EDAC, pp. 361–365, 1991.
MCNC International Workshop on Layout Synthesis, Microelectronics Center of North Carolina, Research Triangle Park, NC, 1990.
E. L. R. Butler, “User’s guide to the p4 parallel programming system,” 1990.
A. Osterhaug, Guide to Parallel Programming on Sequent Computer Systems. Sequent Computer Systems, 1987.
T. Bemmerl and T. Ludwig, “MMK - a distributed operating system kernel with integrated dynamic loadbalancing,” CONPAR 90 - VAPP IV Conference, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Spruth, H., Johannes, F.M. (1993). Architectures for Parallel Slicing Enumeration in VLSI Layout. In: Bode, A., Dal Cin, M. (eds) Parallel Computer Architectures. Lecture Notes in Computer Science, vol 732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21577-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-662-21577-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57307-4
Online ISBN: 978-3-662-21577-7
eBook Packages: Springer Book Archive