The paper presents a "Manhattan" channel router, which is based on an effective treatment of conflict cycles. An upper bound to the channel width, close to optimal for some special rouling problems, is obtained.
Channel routing in the Manhattan model: an efficient algorithm
Codenotti B;Favati P
1990
Abstract
The paper presents a "Manhattan" channel router, which is based on an effective treatment of conflict cycles. An upper bound to the channel width, close to optimal for some special rouling problems, is obtained.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_489207-doc_203657.pdf
solo utenti autorizzati
Descrizione: Channel routing in the Manhattan model: an efficient algorithm
Tipologia:
Versione Editoriale (PDF)
Dimensione
688.19 kB
Formato
Adobe PDF
|
688.19 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
