A min-cut placement algorithm for general cell assemblies based on a graph representation
U. Lauther. DAC '79: Proceedings of the 16th Conference on Design automation, page 1--10. Piscataway, NJ, USA, IEEE Press, (1979)
Abstract
A new placement algorithm for general cell assemblies is presented which combines the ideas of polar graph representation and min-cut placement. First a detailed description of the initial placement procedure is given, then the various methods for placement improvement (rotation, squeezing, reflecting) and global routing are discussed. A sample circuit is used to demonstrate the performance of the algorithms. Results are shown to compare favorably with manually achieved solutions.
Description
A min-cut placement algorithm for general cell assemblies based on a graph representation
%0 Conference Paper
%1 Lauther79MinCut
%A Lauther, Ulrich
%B DAC '79: Proceedings of the 16th Conference on Design automation
%C Piscataway, NJ, USA
%D 1979
%I IEEE Press
%K Lauther79MinCut clustering figures graph min-cut old
%P 1--10
%T A min-cut placement algorithm for general cell assemblies based on a graph representation
%U http://portal.acm.org/citation.cfm?id=800292.811683
%X A new placement algorithm for general cell assemblies is presented which combines the ideas of polar graph representation and min-cut placement. First a detailed description of the initial placement procedure is given, then the various methods for placement improvement (rotation, squeezing, reflecting) and global routing are discussed. A sample circuit is used to demonstrate the performance of the algorithms. Results are shown to compare favorably with manually achieved solutions.
@inproceedings{Lauther79MinCut,
abstract = {A new placement algorithm for general cell assemblies is presented which combines the ideas of polar graph representation and min-cut placement. First a detailed description of the initial placement procedure is given, then the various methods for placement improvement (rotation, squeezing, reflecting) and global routing are discussed. A sample circuit is used to demonstrate the performance of the algorithms. Results are shown to compare favorably with manually achieved solutions.},
added-at = {2008-10-18T19:22:26.000+0200},
address = {Piscataway, NJ, USA},
author = {Lauther, Ulrich},
biburl = {https://www.bibsonomy.org/bibtex/235ff835fd8453551e283f8b9cb6dca04/lee_peck},
booktitle = {DAC '79: Proceedings of the 16th Conference on Design automation},
description = {A min-cut placement algorithm for general cell assemblies based on a graph representation},
interhash = {47b787e37122f6179b9772a0d326222e},
intrahash = {35ff835fd8453551e283f8b9cb6dca04},
keywords = {Lauther79MinCut clustering figures graph min-cut old},
location = {San Diego, CA, United States},
pages = {1--10},
publisher = {IEEE Press},
timestamp = {2008-10-18T19:22:43.000+0200},
title = {A min-cut placement algorithm for general cell assemblies based on a graph representation},
url = {http://portal.acm.org/citation.cfm?id=800292.811683},
year = 1979
}