ACM Home Page
Please provide us with feedback. Feedback
Performance analysis and optimization of latency insensitive systems
Full text PdfPdf (235 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 37th Annual Design Automation Conference table of contents
Los Angeles, California, United States
Pages: 361 - 367  
Year of Publication: 2000
ISBN:1-58113-187-9
Authors
Luca P. Carloni  University of California at Berkeley, Berkeley, CA
Alberto L. Sangiovanni-Vincentelli  University of California at Berkeley, Berkeley, CA
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 24,   Citation Count: 20
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/337292.337441
What is a DOI?

ABSTRACT

Latency insensitive design has been recently proposed in literature as a way to design complex digital systems, whose functional behavior is robust with respect to arbitrary variations in interconnect latency. However, this approach does not guarantee the same robustness for the performance of the design, which indeed can experience big losses. This paper presents a simple, yet rigorous, method to (1) model the key properties of a latency insensitive system, (2) analyze the impact of interconnect latency on the overall throughput, and (3) optimize the performance of the final implementation.


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
A. Agarwal. Raw Computation. Scientific American, 281(2):60-63, August 1999.
 
2
F. Bacelli, G. Cohen, G.J. Olsder, and J.P. Quadrat. Synchronization and Linearity. Wiley, New York, 1992.
 
3
4
 
5
 
6
 
7
L. P. Carloni and Alberto L. Sangiovanni-Vincentelli. Recycle, Reuse, Reduce. Technical Report UCB/ERL M99/53, Electronics Research Lab, University of California, Berkeley, CA 94720, October 1999.
 
8
J. Cong. Challenges and Opportunities for Design Innovations in Nanometer Technologies. In SRC Design Sciences Concept Paper, December 1997.
 
9
 
10
 
11
A. Dasdan and Rajesh K. Gupta. Faster Maximum and Minimum Mean Cycle Algorithms for System-Perofrmance Analysis. IEEE Transactions on Computer-Aided Design, 17(10):889-899, October 1998.
 
12
 
13
 
14
 
15
 
16
R. M. Karp. A Characterization of the Minimum Cycle Mean in a Digraph. Discrete Math., 23:309-311, 1978.
 
17
M. Horowitz and R. Ho and K. Mai. The Future of Wires. In Invited Workshop Paper for SRC Conference. Available at "http://velox.stanford.edu/", May 1999.
 
18
M. T. Bohr. Interconnect Scaling - The Real Limiter to High Performance ULSI. IEEE International Electron Devices Meeting, pages 241-244, December 1995.
19
 
20
21
 
22
 
23
C. V. Ramamoorthy and G. S. Ho. Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets. IEEE Transactions on Software Engineering, 6(5):440-449, September 1980.
 
24
 
25
T. McHale. Electronic Design Automation: Time to Grow Up. Electronic Business, June 1999.
 
26
R. E. Tarjan. Depth-First Search and Linear Graph Algorithms. In SIAM J. Comput., volume 1, pages 146-160. Society for Industrial and Applied Mathematics, 1972.

CITED BY  21

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