Creating and exploiting flexibility in steiner trees

Authors:
Elaheh Bozorgzadeh;Ryan Kastner;Majid Sarrafzadeh
Affiliations:
Computer Science Department, University of California, Los Angeles, Los Angeles, CA;Computer Science Department, University of California, Los Angeles, Los Angeles, CA;Computer Science Department, University of California, Los Angeles, Los Angeles, CA
Venue:
Proceedings of the 38th annual Design Automation Conference
Year:
2001

Citing 7
Cited 5

A new approach to the rectilinear Steiner tree problem

DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Benchmarks for layout synthesis—evolution and current status

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
The ISPD98 circuit benchmark suite

ISPD '98 Proceedings of the 1998 international symposium on Physical design
Requirements for models of achievable routing

ISPD '00 Proceedings of the 2000 international symposium on Physical design
An Introduction to VLSI Physical Design

An Introduction to VLSI Physical Design
A timing-constrained algorithm for simultaneous global routing of multiple nets

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Predictable routing

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design

Constructing exact octagonal steiner minimal trees

Proceedings of the 13th ACM Great Lakes symposium on VLSI
Probabilistic Analysis of Rectilinear Steiner Trees

ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
Delay-related secondary objectives for rectilinear Steiner minimum trees

Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Placement Method Targeting Predictability Robustness and Performance

Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
An integrated design flow for a via-configurable gate array

Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the concept of flexibility -- a geometric property associated with Steiner trees. Flexibility is related to the routability of the Steiner tree. We present an optimal algorithm which takes a Steiner tree and outputs a more flexible Steiner tree. Our experiments show that a net with a flexible Steiner tree increases its routability. Experiments with a global router show that congestion is improved by approximately 20\%.