ACM Home Page
Please provide us with feedback. Feedback
A new simultaneous circuit partitioning and chip placement approach based on simulated annealing
Full text PdfPdf (566 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 27th ACM/IEEE Design Automation Conference table of contents
Orlando, Florida, United States
Pages: 36 - 39  
Year of Publication: 1991
ISBN:0-89791-363-9
Authors
Abhijit Chatterjee  General Electric Research and Development Center, Schenectady, NY
Richard Hartley  General Electric Research and Development Center, Schenectady, NY
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS : Computer Society
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 8,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/123186.123221
What is a DOI?

ABSTRACT

The problems of circuit partitioning and chip placement have been studied in the past. Given a circuit partitioned into chips, one can optimize the placement of the chips on a printed circuit board with regard to a given cost function. Conversely, given a placement of the chips on the board, one can optimize the partitioning of the circuit into the chips with regard to the same cost function. However, given neither the circuit partitioning nor the chip placement, we are faced with a difficult optimization problem. Our target technology is one in which the chips are unpackaged chips placed on a substrate, analogous to the printed circuit board and interconnected together with high density interconnect to realize a complex system. We propose a new approach in which the circuit is both partitioned and placed simultaneously by a simulated annealing based algorithm. Our approach is seen to yield excellent results in reasonable run times.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by Simulated Annealing," Science 220 pp. 67t-680 (1983).
 
2
B. Kernighan and S. Lin, "An Efficient Heuristic for Partitioning Graphs," Bell System Technical Journal, pp. 291-307 (1970).
 
3
 
4
B. Krishnamurthy, "An improved Min-Cut Algorithm for Partitioning VLSI Networks," 1EEE Transactions on Computers, pp. 438-446 (1984).
 
5
C. Sechen, "VLSI Placement and Global Routing Using Simulated Annealing," Kluwer Academic Publishers, (1988).
 
6
 
7
R. Hartley and J. R. Jasica, "Behavioral to Structural Translation in a Bit-Serial Silicon Compiler," IEEE Transactions on Computer-Aided Design 7, No 8pp. 877-886 (August 1988).
 
8


Collaborative Colleagues:
Abhijit Chatterjee: colleagues
Richard Hartley: colleagues