On Theoretical Upper Bound for Routing Estimation
| dc.creator | He,Fei | |
| dc.creator | Cheng,Lerong | |
| dc.creator | Yang,Guowu | |
| dc.creator | Song,Xiaoyu | |
| dc.creator | Gu,Ming | |
| dc.creator | Sun,Jiaguang | |
| dc.date | 2005 | |
| dc.date.accessioned | 2024-02-06T12:53:36Z | |
| dc.date.available | 2024-02-06T12:53:36Z | |
| dc.description | Routing space estimation plays a crucial role in design automation of digital systems. We investigate the problem of estimating upper bounds for global routing of two-terminal nets in two-dimensional arrays. We show the soundness of the bounds for both wiring space and total wire-length estimation. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-011-06-0916 | |
| dc.identifier | https://lib.jucs.org/article/28418/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/8776 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 11(6): 916-925 | |
| dc.subject | global routing | |
| dc.subject | algorithms | |
| dc.subject | CAD | |
| dc.subject | integrated circuits | |
| dc.title | On Theoretical Upper Bound for Routing Estimation | |
| dc.type | Research Article |