A new channel routing problem

Authors:
H. W. Leong;C. L. Liu
Affiliations:
Department of Computer Science, University of Illinois at Urbana-Champaign, 1304 W. Springfield, Urbana, IL;Department of Computer Science, University of Illinois at Urbana-Champaign, 1304 W. Springfield, Urbana, IL
Venue:
DAC '83 Proceedings of the 20th Design Automation Conference
Year:
1983

Citing 3
Cited 3

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
A “greedy” channel router

DAC '82 Proceedings of the 19th Design Automation Conference

Crosstalk minimization using wire perturbations

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Algorithms for permutation channel routing

Integration, the VLSI Journal
On pioneering nanometer-era routing problems

Proceedings of the 2012 ACM international symposium on International Symposium on Physical Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a new model for channel routing. This model generalizes of the model previously studied in the literature. Informally, our model allow the possibility of connecting, for any given net, only some but not all of the pins that belongs to that net. An algorithm for this model was designed and implemented. Experimental results showed that our algorithm is quite effective.