Proceedings of 2010 IEEE International Symposium on Circuits and Systems 2010
DOI: 10.1109/iscas.2010.5537941
|View full text |Cite
|
Sign up to set email alerts
|

Register relocation to optimize clock network for multi-domain clock skew scheduling

Abstract: Multi-domain clock skew scheduling provides performance improvement for circuits in an efficient way. However, the cost of clock network construction could be further reduced when clock scheduling scheme is considered during placement. Here we focus on this and propose an incremental register relocation algorithm to minimize the distance to the nearby ones in the same skew domain, while registers are relocated within their permissible displacement range so as not to violate timing constraints. The experiments … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…There is an obvious distinction of our flow from traditional flows, which is register clustering and clock skew scheduling are combined and widely used in Godson-3B. An in-house tool [10][11] is developed to generate regular H-trees with clustered registers with precise useful clock skew. The latency of most registers can be adjusted within 200 ps with only cell substitutions of the same size.…”
Section: Sub-module Implementationmentioning
confidence: 99%
“…There is an obvious distinction of our flow from traditional flows, which is register clustering and clock skew scheduling are combined and widely used in Godson-3B. An in-house tool [10][11] is developed to generate regular H-trees with clustered registers with precise useful clock skew. The latency of most registers can be adjusted within 200 ps with only cell substitutions of the same size.…”
Section: Sub-module Implementationmentioning
confidence: 99%
“…Asynchronous FIFO is a first in, first out storage circuit used to store and buffer data transmission between two asynchronous clock domains. Because asynchronous FIFO effectively achieves data buffering while transmitting data to each other, this is an ideal method [1,2].…”
Section: Introductionmentioning
confidence: 99%