The Associative-Skew Clock Routing Problem
| dc.contributor.author | Chen, Yu | |
| dc.contributor.author | Kahng, Andrew B. | |
| dc.contributor.author | Qu, Gang | |
| dc.contributor.author | Zelikovsky, Alexander | |
| dc.date.accessioned | 2009-04-10T18:22:40Z | |
| dc.date.available | 2009-04-10T18:22:40Z | |
| dc.date.issued | 1999-11 | |
| dc.description.abstract | We introduce the associative skew clock routing problem, which seeks a clock routing tree such that zero skew is preserved only within identified groups of sinks. The associative skew problem is easier to address within current EDA frameworks than useful-skew (skew-scheduling) approaches, and defines an interesting tradeoff between the traditional zero-skew clock routing problem (one sink group) and the Steiner minimum tree problem (n sink groups). We present a set of heuristic building blocks, including an efficient and optimal method of merging two zero-skew trees such that zero skew is preserved within the sink sets of each tree. Finally, we list a number of open issues for research and practical application. | en |
| dc.format.extent | 109972 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.citation | Y. Chen, A.B. Kahng, G. Qu, and A. Zelikovsky. "The Associative-Skew Clock Rout ing Problem," IEEE/ACM International Conference on Computer Aided Design, pp. 168-171, November 1999. | en |
| dc.identifier.uri | http://hdl.handle.net/1903/9044 | |
| dc.language.iso | en_US | en |
| dc.publisher | IEEE | en |
| dc.relation.isAvailableAt | A. James Clark School of Engineering | en_us |
| dc.relation.isAvailableAt | Electrical & Computer Engineering | en_us |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_us |
| dc.relation.isAvailableAt | University of Maryland (College Park, MD) | en_us |
| dc.rights.license | Copyright © 1999 IEEE. Reprinted from IEEE/ACM International Conference on Computer Aided Design. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Maryland's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. | |
| dc.subject | routing | en |
| dc.subject | skew | en |
| dc.title | The Associative-Skew Clock Routing Problem | en |
| dc.type | Article | en |