It is described a channel router, which is based on a heuristic treatment of conflict cycles, in the Manhattan model. We obtain an upper bound to the channel width, which is close to optimal for some dense channel routing prob1ems.
Efficient treatment of conflict cycles in manhattan routing
Codenotti B;Favati P
1988
Abstract
It is described a channel router, which is based on a heuristic treatment of conflict cycles, in the Manhattan model. We obtain an upper bound to the channel width, which is close to optimal for some dense channel routing prob1ems.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_419413-doc_148212.pdf
solo utenti autorizzati
Descrizione: Efficient treatment of conflict cycles in manhattan routing
Tipologia:
Versione Editoriale (PDF)
Dimensione
384.37 kB
Formato
Adobe PDF
|
384.37 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.
