ACM Home Page
Please provide us with feedback. Feedback
The genealogical approach to the layout problem
Full text PdfPdf (847 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 17th Design Automation Conference table of contents
Minneapolis, Minnesota, United States
Pages: 535 - 542  
Year of Publication: 1980
ISBN:0-89791-020-6
Authors
Sponsors
IEEE-CS\DATC : IEEE Computer Society
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 6,   Citation Count: 12
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/800139.804582
What is a DOI?

ABSTRACT

The concept of the genealogical approach to the layout problem is presented. The system pursues the idea of flexible modules and is capable of dealing with arbitrarily complex tasks. The genealogical tree of the system provides a mainframe for organizing the information flow. Results of the system routines are described in terms of transitions between flexibility classes of modules.


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
 
2
 
3
K. Kani et al., "ROBIN, a building block LSI routing program", Proc. ISCAS, pp. 658-661, 1976.
 
4
H. Kawanishi et al., "A routing method of building block LSI", Proc. 7-th Asilomar Conf. on Circ. Syst. and Comp., pp.119-123, 1973.
 
5
K. Sato and T. Nagai, "A method of specifying the relative locations between blocks in a routing program for building block LSI", Proc. ISCAS, pp.673-676, 1979.
 
6
B.T. Preas and W.M. van Cleemput, "Routing algorithms for arbitrary shaped blocks", Proc. ISCAS, pp.482-485, 1979.
 
7
R. Keyes, "The evolution of digital electronics towards VLSI", IEEE Journal of Solid State Circuits, vol. SC-14, no.2, pp.193-201, April 1979.
 
8
W.R. Heller et al., "Prediction of wiring space requirements for LSI", Journal of Design Automation and Fault Tolerant Computing, vol.2, no.2, pp. 117-144, May 1978.
 
9
R.H.J.M. Otten and A.A. Szepieniec, "Graph oriented approach to the layout problem", Proc. ISCAS, 1980.
10

CITED BY  12

Collaborative Colleagues:
Antoni A. Szepieniec: colleagues
Ralph H.J.M. Otten: colleagues