| A general model for performance optimization of sequential systems |
| Full text |
Pdf
(268 KB)
|
| Source
|
International Conference on Computer Aided Design
archive
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
table of contents
San Jose, California
SESSION: Sequential synthesis and FPGA mapping
table of contents
Pages 362-369
Year of Publication: 2007
ISBN ~ ISSN:1092-3152 , 1-4244-1382-6
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
IEEE Press
Piscataway, NJ, USA
|
| Bibliometrics |
Downloads (6 Weeks): 4, Downloads (12 Months): 30, Citation Count: 0
|
|
|
ABSTRACT
Retiming, c-slow retiming and recycling are different transformations for the performance optimization of sequential circuits. For retiming and c-slow retiming, different models that provide exact solutions have already been proposed. An exact model for recycling was yet unknown. This paper presents a general formulation that covers the combination of the three schemes for performance optimization. It provides an exact model based on integer linear programming that resorts to the structural theory of marked graphs. A set of experiments has been designed to show the benefits in performance obtained by combining retiming and recycling. The results also show the applicability of the method in large circuits.
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
|
C. E. Leiserson and J. B. Saxe, "Retiming synchronous circuitry." Algorithmica, vol. 6, no. 1, pp. 5--35, 1991.
|
| |
2
|
|
| |
3
|
S. S. Sapatnekar and R. B. Deokar, "Utilizing the timing shew equivalence in a practical algorithm for retiming large circuits," IEEE Transactions on Computer-Aided Design, vol. 15, no. 10, pp. 1237--1248, Oct. 1996.
|
| |
4
|
|
 |
5
|
|
| |
6
|
Luca P. Carloni , Kenneth L. McMillan , Alexander Saldanha , Alberto L. Sangiovanni-Vincentelli, A methodology for correct-by-construction latency insensitive design, Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design, p.309-315, November 07-11, 1999, San Jose, California, United States
|
 |
7
|
|
| |
8
|
|
| |
9
|
|
| |
10
|
|
| |
11
|
|
 |
12
|
|
 |
13
|
|
| |
14
|
|
| |
15
|
H. J. Touati and R. K. Brayton, "Computing the initial states of retimed circuits," IEEE Trans. on CAD of Integrated Circuits and Systems, vol. 12, no. 1, pp. 157--162, 1993.
|
| |
16
|
R. Lu and C.-K. Koh, "Performance analysis of latency-insensitive systems," IEEE Transactions on Computer-Aided Design, vol. 25, no. 3, pp. 469--483, 2006.
|
| |
17
|
T. Murata, "Petri Nets: Properties, analysis and applications," Proceedings of the IEEE, pp. 541--580, Apr. 1989.
|
| |
18
|
F. Commoner, A. W. Holt, S. Even, and A. Pnueli, "Marked directed graphs," Journal of Computer and System Sciences, vol. 5, pp. 511--523, 1971.
|
| |
19
|
T. Murata, "Circuit theoretic analysis and synthesis of marked graphs," IEEE Trans. Circuits and Systems, vol. CAS-24, no. 7, pp. 400--405, July 1977.
|
| |
20
|
|
| |
21
|
|
| |
22
|
|
| |
23
|
C. Papadimitriou, Computational Complexity. Addison-Wesley, 1995.
|
| |
24
|
"CPLEX," http://www.ilog.com/products/cplex.
|
|