Routing algorithm for gate array macro cells

Authors:
Atreyi Chakraverti;Moon Jung Chung
Affiliations:
Department of ECSE, R.P.I, Troy, NY;Department of Computer Science, Michigan State University, East Lansing, MI
Venue:
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Year:
1988

Citing 6
Cited 2

A method for gridless routing of printed circuit boards

DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
An expert systems approach to completing partially routed printed circuit boards

DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
Hierarchical dynamic router

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
A global routing algorithm for general cells

DAC '84 Proceedings of the 21st Design Automation Conference
A solution to line-routing problems on the continuous plane

DAC '69 Proceedings of the 6th annual Design Automation Conference
Combinatorial Algorithms: Theory and Practice

Combinatorial Algorithms: Theory and Practice

An efficient routing algorithm for SOG cell generation on a dense gate-isolated layout style

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
A negative reinforcement method for PGA routing

DAC '93 Proceedings of the 30th international Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

We will present an efficient dynamic algorithm for routing pre-placed gate array macro-cells. A novel data-structure based on corner stitching is introduced to represent the routing environment in a general gate array, where an uniform grid cannot be superimposed on the basic-cells. The near-optimal routing is accomplished in iterations with an initial shortest-path routing followed by conflict resolution using a coloring procedure and net reordering.