ACM Home Page
Please provide us with feedback. Feedback
Modeling layout tools to derive forward estimates of area and delay at the RTL level
Full text PdfPdf (278 KB)
Source ACM Transactions on Design Automation of Electronic Systems (TODAES) archive
Volume 5 ,  Issue 3  (July 2000) table of contents
Pages: 451 - 491  
Year of Publication: 2000
ISSN:1084-4309
Authors
Donald S. Gelosh  Air Force Institute of Technology, Dayton, OH
Dorothy E. Steliff  Univ. of Pittsburgh, Pittsburgh, PA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 25,   Citation Count: 0
Additional Information:

abstract   references   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/348019.348148
What is a DOI?

ABSTRACT

Forward estimates of area and delay facilitate effective decision-making when searching the solution space of digital designs. Current estimation techniques focus on modeling the layout result and fail to deliver timely or accurate estimates. This paper presents a novel approach to deriving these area and delay estimates at the RTL level by modeling the layout tool, rather than the layout result. This approach uses machine learning techniques to capture the relationships between general design features (i.e., topology, connectivity, common input, and common output) and layout concepts (i.e., relative placement). Experiments illustrate the formulation of the training set for machine learning in this domain, and also show how we can derive different tool models. Finally, they show how we can use the resultant model to derive forward estimates of area and delay in real-world designs.


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
BREUER, M. 1977. Min-cut placement. J. Des. Autom. Fault-Tolerant Comput., 343-362.
 
2
BUCHANAN, B. AND SHORTLIFFE, E. 1984. Rule-Based Expert Systems. Addison-Wesley, Reading, MA.
 
3
HAKIMI, S. 1971. Steiner's problem in graphs and its implications. Networks 1, 113-133.
 
4
HSIEH, Y. -W. 1992. Architectural synthesis via VHDL. Master's Thesis. University of Pittsburgh, Pittsburgh, PA.
5
 
6
JAIN, R., PARKER, A. C., AND PARK, N. 1992. Predicting system-level area and delay for pipelined and non-pipelined designs. IEEE Trans. Comput.-Aided Des. 12, 8 (Aug.).
 
7
 
8
 
9
KNAPP, D.W. 1992. FASOLT: A program for feedback-driven data-path optimization. IEEE Trans. Comput.-Aided Des. 11, 6 (June), 677-695.
 
10
KURDAHI, F. J. AND PARKER, A. C. 1989. Techniques for area estimation of VLSI layouts. IEEE Trans. Comput.-Aided Des. 8, 1 (Jan.), 81-92.
 
11
LANDMAN, B. AND RUSSO, R. 1971. On a pin versus block relationship for partition of logic graphs. IEEE Trans. Comput. C-20 (Apr.).
12
 
13
14
 
15
 
16
RAMACHANDRAN, C. AND KURDAHI, F.g. 1992a. TELE: A timing evaluator using layout estimation for high level applications. In Proceedings of the European Conference on Design Automation (EDAC '92, Brussels, Belgium, Mar. 16 - 19), IEEE Computer Society Press, Los Alamitos, CA, 137-141.
 
17
 
18
 
19
RUTENBAR, R.A. 1989. Simulated annealing algorithms: An overview. IEEE Circ. Dev. 5, 1 (Jan.), 19-26.
 
20
TERMAN, C. 1983. Simulation tools for digital LSI design. Ph.D. Dissertation. MIT Laboratory for Computer Science, Cambridge, MA.
 
21

Collaborative Colleagues:
Donald S. Gelosh: colleagues
Dorothy E. Steliff: colleagues