Maze routing with buffer insertion and wiresizing

We propose an elegant formulation of the Maze Routing with Buffer Insertion and Wiresizing pr oblem as a graph-the oretic shortest path problem. This formulation provides time and space performance improvements over previously proposed dynamic-programming based techniques. R outing c onstr aints suc...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	37th Design Automation Conference, 2000 S. 374 - 378
Hauptverfasser:	Lai, Minghorng, Wong, D. F.
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	New York, NY, USA ACM 01.01.2000 IEEE
Schriftenreihe:	ACM Conferences
Schlagworte:	Applied computing > Physical sciences and engineering > Engineering Computer systems organization > Dependable and fault-tolerant systems and networks Delay Dynamic programming General and reference > Cross-computing tools and techniques > Performance Hardware > Electronic design automation > Physical design (EDA) > Placement Hardware > Electronic design automation > Physical design (EDA) > Wire routing Hardware > Robustness Hardware > Very large scale integration design Integrated circuit interconnections Mathematics of computing > Discrete mathematics > Graph theory > Paths and connectivity problems Networks > Network performance evaluation Permission Process design Routing Shortest path problem Software and its engineering > Software organization and properties > Contextual software domains > Operating systems > Communications management > Buffering Table lookup Wires Wiring
ISBN:	9781581131871, 1581131879
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!