A general graph theoretic framework for multi-layer channel routing

Authors:
R. K. Pal;A. K. Datta;S. P. Pal;M. M. Das;A. Pal
Affiliations:
-;-;-;-;-
Venue:
VLSID '95 Proceedings of the 8th International Conference on VLSI Design
Year:
1995

Citing 5
Cited 4

A new efficient approach to multilayer channel routing problem

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Near-optimal n-layer channel routing

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
A “Dogleg” channel router

DAC '76 Proceedings of the 13th Design Automation Conference
Wire routing by optimizing channel assignment within large apertures

DAC '71 Proceedings of the 8th Design Automation Workshop
Multilayer channel routing

Multilayer channel routing

Performance Driven Routing in Distributed Environment

IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
Computing area and wire length efficient routes for channels

VLSID '95 Proceedings of the 8th International Conference on VLSI Design
Channel routing in Manhattan-diagonal model

VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
Priority-based routing resource assignment considering crosstalk

Journal of Computer Science and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a general framework for viewing a class of heuristics for track assignment in channel routing from a purely graph theoretic angle. Within this framework we propose algorithms for computing routing solutions using optimal or near optimal number of tracks for several well-known benchmark channels in the two-layer VH. Three-layer HVH, and multi-layer V/sub i/H/sub i/ and V/sub i/H/sub i+1/ routing models. Within the same framework we also design an algorithm for minimizing the total wire length in the two-layer VH and three-layer HVH routing models.