Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption

Vygen, Jens

doi:10.1007/978-3-540-25960-2_24

Cited by 21 publications

(22 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The application of randomized rounding to the global routing problem was then considered by Albrecht [2], whose router is based on the use of a combinatorial fully polynomial approximation scheme to increase the speed of the fractional relaxation solution search on large scale instances. More recently, the randomized rounding approach to global routing was further studied by Vygen [29] and Müller [24]. From the literature in this field, it turns out that randomized rounding performs very well in general, except at some edges.…”

Section: A Competing Approachmentioning

confidence: 98%

A fast heuristic algorithm for the maximum concurrent k-splittable flow problem

Caramia

Sgalambro

2009

Optim Lett

View full text Add to dashboard Cite

In this paper, we propose a fast heuristic algorithm for the maximum concurrent k-splittable flow problem. In such an optimization problem, one is concerned with maximizing the routable demand fraction across a capacitated network, given a set of commodities and a constant k expressing the number of paths that can be used at most to route flows for each commodity. Starting from known results on the k-splittable flow problem, we design an algorithm based on a multistart randomized scheme which exploits an adapted extension of the augmenting path algorithm to produce starting solutions for our problem, which are then enhanced by means of an iterative improvement routine. The proposed algorithm has been tested on several sets of instances, and the results of an extensive experimental analysis are provided in association with a comparison to the results obtained by a different heuristic approach and an exact algorithm based on branch and bound rules. © Springer-Verlag 2009

show abstract

Section: A Competing Approachmentioning

confidence: 98%

A fast heuristic algorithm for the maximum concurrent k-splittable flow problem

Caramia

Sgalambro

2009

Optim Lett

View full text Add to dashboard Cite

show abstract

“…A major difference compared to most other global routers is that we allow the allocation of extra space s(n,e) > 0. This reduces the sensitivity to extra material defects and hence can improve yield, but also leads to reduced coupling capacitance and hence less delay and power consumption [13].…”

Section: Global Routing Yield Optimizationmentioning

confidence: 99%

Optimizing product yield using manufacturing defect weights

Bickford

Hibbeler

Peyer³

et al. 2012

2012 SEMI Advanced Semiconductor Manufacturing Conference

View full text Add to dashboard Cite

show abstract

“…In [44] we developed a fully polynomial approximation scheme for this LP and its dual. The algorithm always gives a fractional dual solution and therefore a certificate of infeasibility if a given placement is not routable.…”

Section: B Global Routingmentioning

confidence: 99%

“…The algorithm always gives a fractional dual solution and therefore a certificate of infeasibility if a given placement is not routable. We also showed how to make randomized rounding work [44].…”

Section: B Global Routingmentioning

confidence: 99%

BonnTools: Mathematical Innovation for Layout and Timing Closure of Systems on a Chip

2007

Self Cite

View full text Add to dashboard Cite

Abstract-The BonnTools provide innvovative solutions for layout and timing closure that are used for many of the most complex integrated circuits. During 20 years of cooperation between the University of Bonn and IBM, new mathematical foundations and algorithms have been developed for the need of new technologies and leading-edge designs. In this paper we present the main ideas for placement, routing, timing optimization, and clock tree synthesis, which are the foundation of a continuing success story.

show abstract

Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption

Cited by 21 publications

References 19 publications

A fast heuristic algorithm for the maximum concurrent k-splittable flow problem

A fast heuristic algorithm for the maximum concurrent k-splittable flow problem

Optimizing product yield using manufacturing defect weights

BonnTools: Mathematical Innovation for Layout and Timing Closure of Systems on a Chip

Contact Info

Product

Resources

About