The coming of age of (academic) global routing

Moffitt, Michael D.; Roy, Jarrod A.; Markov, Igor L.

doi:10.1145/1353629.1353662

Cited by 30 publications

(13 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Hu and Sapatnekar [2001] gave a survey of global routing algorithms published until 2001. The ISPD global routing contests [ISPD 2007[ISPD , 2008] stimulated development of new global routing approaches recently; see Moffitt et al [2008] for a survey. The methods employed range from pattern routing over iterative edge shifting and monotonic routing (restricted to stair-case-like paths), to computationally more expensive ripup-and-reroute with history-based congestion costs, often called negotiation-based routing [Chang et al 2008;Moffitt 2008;Xu et al 2009;Roy and Markov 2008;Ozdal and Wong 2009;Chen et al 2009].…”

Section: Related Workmentioning

confidence: 99%

BonnRoute

Gester

Müller

Nieberg

et al. 2013

ACM Trans. Des. Autom. Electron. Syst.

View full text Add to dashboard Cite

We present the core elements of BonnRoute: advanced data structures and algorithms for fast and highquality routing in modern technologies. Global routing is based on a combinatorial approximation scheme for min-max resource sharing. Detailed routing uses exact shortest path algorithms, based on a shape-based data structure for pin access and a two-level track-based data structure for long-distance connections. All algorithms are very fast. Compared to an industrial router (on 32 nm and 22 nm chips), BonnRoute is over two times faster, has 5 % less netlength, 20 % less vias, and reduces detours by more than 90 %.

show abstract

Section: Related Workmentioning

confidence: 99%

BonnRoute

Gester

Müller

Nieberg

et al. 2013

ACM Trans. Des. Autom. Electron. Syst.

View full text Add to dashboard Cite

show abstract

“…The survey on multi-net global routing [4] discusses the recent global routing methods with emphasis on performance-driven multi-net routing. A recent report on academic global routing [14] provides a brief review of some of the best high-performance routing techniques of recent times.…”

Section: Literature Surveymentioning

confidence: 99%

A Method for the Multi-Net Multi-Pin Routing Problem with Layer Assignment

Samantam¹,

Rahaman²,

Ghosal³

et al. 2009

2009 22nd International Conference on VLSI Design

View full text Add to dashboard Cite

Interconnects are vital in deep sub-micron VLSI design, as they impose constraints, such as delay, congestion, crosstalk, power dissipation and others, and consume resources. These parameters affect the efforts for obtaining a feasible solution for the global routing of multiple nets. In addition, efforts are on for exploration and use of non-Manhattan routing architectures. In this work, we focus on the specific problem of multi-net multi-pin global Y -routing for custombuilt design styles with several available routing layers. The problem is formulated as a minimum crossing Y -Steiner Minimal tree problem with multi-layer assignment. Experimental results are quite encouraging.

show abstract

“…For example, [16] points out that for benchmark circuit adaptec1, compared to the tools FGR and BoxRouter, the tool MaizeRouter [15] tends to route the nets above the blockages and close to the edges of the chip. However, despite distinct routing solutions, the measured qualities such as wirelength are not very different among the majority of recent global routing tools.…”

Section: Introductionmentioning

confidence: 99%

Collaborative Multiobjective Global Routing

Shojaei

Davoodi

Basten

2013

IEEE Trans. VLSI Syst.

View full text Add to dashboard Cite

Abstract-This work presents a collaborative procedure for multi-objective global routing. Our procedure takes as input multiple global routing solutions, which are generated independently (e.g., by one router that runs in different modes concurrently, or by different routers running in parallel). It then performs multi-objective optimization based on Pareto algebra and quickly generates multiple global routing solutions with a tradeoff between the considered objectives. The user can control the number of generated solutions and the degree of exploring the tradeoff between them by constraining the maximum allowable degradation in each objective. This work then considers the following three multi-objective case studies: minimization of interconnect power and wirelength, minimization of routing congestion and wirelength, and minimization of wirelength with respect to the (finite-capacity) routing resources. The maximum allowable degradation in wirelength is specified in all cases. Our multi-objective procedure runs in only a few minutes for each of the ISPD 2008 benchmarks, even for the unroutable ones, which imposes a tolerable overhead in the design flow. In our simulations, we demonstrate the effectiveness of our procedure using five modern academic global routers.

show abstract

The coming of age of (academic) global routing

Cited by 30 publications

References 41 publications

BonnRoute

BonnRoute

A Method for the Multi-Net Multi-Pin Routing Problem with Layer Assignment

Collaborative Multiobjective Global Routing

Contact Info

Product

Resources

About