Retiming with non-zero clock skew, variable register, and interconnect delay

Authors:
Tolga Soyata;Eby G. Friedman
Affiliations:
Department of Electrical Engeenering, University of Rochester, Rochester, NY;Department of Electrical Engeenering, University of Rochester, Rochester, NY
Venue:
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Year:
1994

Citing 2
Cited 8

Clock Skew Optimization

IEEE Transactions on Computers
The practical application of retiming to the design of high-performance systems

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design

DELAY: an efficient tool for retiming with realistic delay modeling

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Layout aware retiming

GLSVLSI '01 Proceedings of the 11th Great Lakes symposium on VLSI
Placement driven retiming with a coupled edge timing model

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Efficient retiming under a general delay model

ARVLSI '95 Proceedings of the 16th Conference on Advanced Research in VLSI (ARVLSI'95)
Retiming with Interconnect and Gate Delay

Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Performance-Directed Retiming for FPGAs Using Post-Placement Delay Information

DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Scheduling and optimal register placement for synchronous circuits derived using software pipelining techniques

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Retiming: Theory and practice

Integration, the VLSI Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A retiming algorithm is presented which includes the effects of variable register, clock distribution, and interconnect delay. These delay components are incorporated into retiming by assigning Register Electrical Characteristics (RECs) to each edge in the graph representation of the synchronous circuit. A matrix (called the Sequential Adjacency Matrix or SAM) is presented that contains all path delays. Timing constraints for each data path are derived from this matrix. Vertex lags are assigned ranges rather than single values as in standard retiming algorithms. The approach used in the proposed algorithm is to initialize these ranges with unbounded values and continuously tighten these ranges using localized timing constraints until an optimal solution is obtained. The algorithm is demonstrated on modified MCNC benchmark circuits and both increased clock frequencies and elimination of all race conditions are observed.