ACM Home Page
Please provide us with feedback. Feedback
Constraint-driven communication synthesis
Full text PdfPdf (349 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 39th annual Design Automation Conference table of contents
New Orleans, Louisiana, USA
SESSION: Development of processors and communication networks for embedded systems table of contents
Pages: 783 - 788  
Year of Publication: 2002
ISBN ~ ISSN:0738-100X , 1-58113-461-4
Authors
Alessandro Pinto  UC Berkeley, Berkeley, CA
Luca P. Carloni  UC Berkeley, Berkeley, CA
Alberto L. Sangiovanni-Vincentelli  UC Berkeley, Berkeley, CA
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 24,   Citation Count: 23
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/513918.514114
What is a DOI?

ABSTRACT

Constraint-driven Communication Synthesis enables the automatic design of the communication architecture of a complex system from a library of pre-defined Intellectual Property (IP) components. The key communication parameters that govern all the point-to-point interactions among system modules are captured as a set of arc constraints in the communication constraint graph. Similarly, the communication features offered by each of the components available in the IP communication library are captured as a set of feature resources together with its cost figures. Then, every communication architecture that can be built using the available components while satisfying all constraints is implicitly considered (as an implementation graph matching the constraint graph) to derive the optimum design solution with respect to the desired cost figure. The corresponding constrained optimization problem is efficiently solved by a novel algorithm that is presented here together with its rigorous theoretical foundations.


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
C. Chang, P. Kermani, and A. Kershenbaum. Multi-link-speed network topology design. In International Phoenix Conference on Computers and Communications, pages 299--306, 1992.
3
 
4
E. I. Goldberg, L. P. Carloni, T. Villa, R. K. Brayton, and A. L. Sangiovanni-Vincentelli. Negative Thinking in Branch-and-Bound: the Case of Unate Covering. IEEE Transactions on Computer-Aided Design, 19(3):281--294, Mar. 2000.
 
5
K. Keutzer, S. Malik, A. R. Newton, J. Rabaey, and A. Sangiovanni-Vincentelli. System level design: Orthogonolization of concerns and platform based design. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 19(12), December 2000.
 
6
P. V. Knudsen and J. Madsen. Integrating Communication Protocol Selection with Hardware/Software Codesign. IEEE Transactions on Computer-Aided Design, 18(8):1077--1095, Aug. 1999.
 
7
8
 
9
L.-S. Peh and W. J. Dally. Flit reservation flow control. In International Symposium on High-Performance Computer Architecture, pages 74--84, 1999.
 
10
A. Pinto, L. P. Carloni, and A. L. Sangiovanni-Vincentelli. Constraint-Driven Communication Synthesis. Technical Report available at www.cad.eecs.berkeley.edu/~lcarloni, Apr. 2002.
11

CITED BY  23

Collaborative Colleagues:
Alessandro Pinto: colleagues
Luca P. Carloni: colleagues
Alberto L. Sangiovanni-Vincentelli: colleagues