How to obtain more compactable channel routing solutions

Authors:
Jingsheng Cong;D. F. Wong
Affiliations:
Department of Computer Science, Universitv of Illinois at Urbana-Champaign, Urbana, Illinois;Department of Computer Scince, University of Texas at Austin, Austin, Texas
Venue:
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Year:
1988

Citing 5
Cited 3

On some variants of the bandwidth minimization problem

SIAM Journal on Computing
Geometrical compaction in one dimension for channel routing

DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Nutcracker: an efficient and intelligent channel spacer

DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
A “Dogleg” channel router

DAC '76 Proceedings of the 13th Design Automation Conference
A “greedy” channel router

DAC '82 Proceedings of the 19th Design Automation Conference

Compaction of a routed channel on the connection machine

DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Optimal via-shifting in channel compaction

EURO-DAC '90 Proceedings of the conference on European design automation
On the k-layer planar subset and via minimization problems

EURO-DAC '90 Proceedings of the conference on European design automation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present several powerful techniques which allow us to generate efficiently channel routing solutions which are beneficial to further compaction. Our techniques can be applied to straight track compaction as well as to contour routing compaction, and produce very encouraging results. In particular, for Deutsch's Difficult Example, we obtained a straight track routing solution whose area is 7% less than the best known result after straight track compaction. Also, our router generated a routing solution using less area than reported results of all well known routers after contour routing compaction.