ACM Home Page
Please provide us with feedback. Feedback
Behavioral synthesis via engineering change
Full text PdfPdf (304 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 39th conference on Design automation table of contents
New Orleans, Louisiana, USA
SESSION: Web and IP based design table of contents
Pages: 18 - 21  
Year of Publication: 2002
ISBN ~ ISSN:0738-100X , 1-58113-461-4
Authors
Milenko Drini  University of California, Los Angeles, CA
Darko Kirovski  Microsoft Research, Redmond, WA
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 12,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/513918.513925
What is a DOI?

ABSTRACT

Engineering change (EC) is a technique that enables a designer to rapidly perform minor specification alternations while minimally resynthesizing only small portions of the specification throughout several levels of design abstraction. In this paper, we introduce the first EC-based synthesis technique for coordinated design optimization in multiple steps. The technique has four phases: optimization region identification, feedback formulation, resynthesis in first step, and finally resynthesis in the second design step. To demonstrate the technique, we focus on behavioral synthesis and transformation, scheduling, and register assignment steps. We developed a generic EC-based approach for design optimization during multiple consecutive synthesis steps. Next, we show how one can use EC to enhance coordinated application of transformations and scheduling, and scheduling and register assignment.


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
B.W. Kernighan and S. Lin. An Efficient Heuristic Procedure for Partitioning Graphs. Bell System Technical Journal, Vol.49, (no.2), pp.291--308, 1970.
4
 
5
E.A. Lee and D.G. Messerschmitt. Synchronous dataflow. Proceedings of the IEEE, Vol.75, (no.9), pp.1235--45, 1987.
 
6
S. Lin and B.W. Kernighan. An effective heuristic algorithm for the traveling-salesman problem. Operations Research, Vol.21, (no.2), pp.498--516, 1973.
 
7
 
8
 
9

Collaborative Colleagues:
Milenko Drini: colleagues
Darko Kirovski: colleagues

Peer to Peer - Readers of this Article have also read: