This thesis studies the associative skew clock routing problem, which seeks a clock
routing tree such that zero skew is preserved only within identified groups of sinks. Although
the number of constraints is reduced, the problem becomes more difficult to solve
due to the enlarged solution space. Perhaps, the only previous study used a very primitive
delay model which could not handle difficult instances when sink groups are intermingled.
We reuse existing techniques to solve this problem including difficult instances based on an
improved delay model. Experimental results show that our algorithm can reduce the total
clock routing wirelength by 9%Â15% compared to greedy-DME, which is one of the best
zero skew routing algorithms.
| Identifer | oai:union.ndltd.org:tamu.edu/oai:repository.tamu.edu:1969.1/3856 |
| Date | 16 August 2006 |
| Creators | Kim, Min-seok |
| Contributors | Hu, Jiang |
| Publisher | Texas A&M University |
| Source Sets | Texas A and M University |
| Language | en_US |
| Detected Language | English |
| Type | Book, Thesis, Electronic Thesis, text |
| Format | 108149 bytes, electronic, application/pdf, born digital |
Page generated in 0.0019 seconds