A language for describing rectilinear Steiner tree configurations

Authors:
Antony P.-C Ng;Clark D. Thompson;Prabhakar Raghavan
Affiliations:
Computer Science Division, 573 Evans Hall, UC Berkeley, CA;Computer Science Division, 573 Evans Hall, UC Berkeley, CA;Computer Science Division, 573 Evans Hall, UC Berkeley, CA
Venue:
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Year:
1986

Citing 1
Cited 3

Provably good routing in graphs: regular arrays

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing

A negative reinforcement method for PGA routing

DAC '93 Proceedings of the 30th international Design Automation Conference
LocusRoute: a parallel global router for standard cells

DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
A global router for sea-of-gates circuits

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a language that can be used to describe configuration of rectilinear Steiner trees. Given a set of points in a plane indexed by integer coordinates, the execution of a pattern-description in our language will list a number of Steiner trees spanning the points. The Steiner trees that are produced will be used as input to a linear-program type global router for VLSI gate-arrays [10]. Other applications for our language include routing printed circuit boards and generating Steiner tree configurations for simulated-annealing type global routers [11].