Optimizing yield in global routing

Müller, Dirk

doi:10.1145/1233501.1233598

Cited by 17 publications

(11 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Table 3 compares results for minimizing wiring length, critical area (a measure for the manufacturing yield loss; cf. [15]), and power consumption. All runs in this table are made with := 1, and we set the initial bound := 1.1 est for wiring length optimization, := 1.5 est for power optimization and := 2 est for yield optimization.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Faster min–max resource sharing in theory and practice

2011

Self Cite

View full text Add to dashboard Cite

We consider the (block-angular) min-max resource sharing problem, which is defined as follows. Given finite sets R of resources and C of customers, a convex set B c , called block, and a convex function g c :As usual we assume that g c can be computed efficiently and we have a constant σ ≥ 1 and oracle functionsWe describe a simple algorithm which solves this problem with an approximation guarantee σ (1 + ω) for any ω > 0, and whose running time is O(θ (|C|+|R|) log |R|(log log |R|+ω −2 )) for any fixed σ ≥ 1, where θ is the time for an oracle call. This generalizes and improves various previous results. We also prove other bounds and describe several speed-up techniques. In particular, we show how to parallelize the algorithm efficiently. In addition we review another algorithm, variants of which were studied before. We show that this algorithm is almost as fast in theory, but it was not competitive in our experiments. Our work was motivated mainly by global routing in chip design. Here the blocks are mixedinteger sets (whose elements are associated with Steiner trees), and we combine our algorithm with randomized rounding. We present experimental results on instances 123 2 D. Müller et al.resulting from recent industrial chips, with millions of customers and resources. Our algorithm solves these instances nearly optimally in less than two hours.Keywords Min-max resource sharing · Fractional packing · Fully polynomial approximation scheme · Parallelization · Global routing · Chip design Mathematics Subject Classification (2010) 90C27 · 90C90 · 90C59 · 90C48 · 90C06

show abstract

Section: Resultsmentioning

confidence: 99%

“…See [15] and [22] for details. For wiring length minimization, the traditional objective function in global routing, the functions γ n,e are simply constant.…”

Section: Application: Global Routing In Chip Designmentioning

confidence: 99%

Faster min–max resource sharing in theory and practice

2011

Self Cite

View full text Add to dashboard Cite

show abstract

“…1. References [8,9,10] describe how to optimize yield in global routing. In our experiments, we have applied the algorithm by Mueller [10], which we will describe in more detail in the next section.…”

Section: Global Routing and Detail Routing Overviewmentioning

confidence: 99%

“…References [8,9,10] describe how to optimize yield in global routing. In our experiments, we have applied the algorithm by Mueller [10], which we will describe in more detail in the next section. In detail routing, we perform wire spreading to increase wire spacing in order to both reduce the probability of a short and to reduce coupling capacitance which improves timing and power consumption.…”

Section: Global Routing and Detail Routing Overviewmentioning

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

“…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: 99%

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

Optimizing yield in global routing

Cited by 17 publications

References 13 publications

Faster min–max resource sharing in theory and practice

Faster min–max resource sharing in theory and practice

Optimizing product yield using manufacturing defect weights

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

Contact Info

Product

Resources

About