A 2d channel router for the diagonal model

Lodi, Elena; Luccio, Fabrizio; Song, Xiaoyu

doi:10.1016/0167-9260(91)90014-c

Cited by 19 publications

(7 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Manhattan and the knock-knee models [Sarrafzadeh 1987] have been studied extensively in the past two decades. Some effort has been made to develop algorithms in nonisothetic geometries such as times square mode using ±60 • directions [Lodi et al 1990] and the diagonal model using ±45 • wires [Chen 1987;Lodi et al 1991]. Song [1992] presented an optimal knock-knee diagonal routing for Lchannel with two-terminal nets only.…”

Section: Introductionmentioning

confidence: 99%

Manhattan-diagonal routing in channels and switchboxes

Das

Sur-Kolay

Bhattacharya

2004

ACM Trans. Des. Autom. Electron. Syst.

View full text Add to dashboard Cite

New techniques are presented for routing straight channels, L-channels, switchboxes, and staircase channels in a two-layer Manhattan-diagonal (MD) model with tracks in horizontal, vertical, and ±45 • directions. First, an O(l.d) time algorithm is presented for routing a straight channel of length l and density d with no cyclic vertical constraints. It is shown that the number of tracks h used by the algorithm for routing multiterminal nets satisfies d ≤ h ≤ (d + 1). Second, an outputsensitive algorithm is reported that can route a channel with cyclic vertical constraints in O(l.h) time using h tracks, allowing overlapping of wire segments in two layers. Next, the routing problem for a multiterminal L-channel of length l and height h is solved by an O(l.h) time algorithm. If no cyclic vertical constraints exist, its time complexity reduces to O(l.d) where d is the density of the L-channel. Finally, the switchbox routing problem in the MD model is solved elegantly. These techniques, easily extendible to the routing of staircase channels, yield efficient solutions to detailed routing in general floorplans. Experimental results on benchmarks show significantly low via count and reduced wire length, thus establishing the superiority of MD routing to classical strategies. The proposed algorithms are also potentially useful for general non-Manhattan area routing and multichip modules (MCMs).

show abstract

Section: Introductionmentioning

confidence: 99%

Manhattan-diagonal routing in channels and switchboxes

Das

Sur-Kolay

Bhattacharya

2004

ACM Trans. Des. Autom. Electron. Syst.

View full text Add to dashboard Cite

show abstract

“…As a variation of MM, the routing model: Diagonal Model (DM), has been proposed in [3]. There have been some interesting results on CRPs in DM [3,4,5,6,7,8] In the theoretical investigation of two-terminal CRPs in MM, the best algorithm for MM [1,9] obtains w d + O(f) where f is the flux and f -< /-n, n is the number of nets. In particular, the worst case of f usually holds for dense problems [10].…”

Section: Introductionmentioning

confidence: 99%

“…The target point of a net (p, q) with p < q is the minimum integer -> q such that the set of nets still to be inserted in the chains does not contain either a net (t, r) with r -< or a net (r, t) with r < t; and the set of nets already inserted in the chains does not contain a net (r, t) (see Figure 2). (2,6), (3,8), (5,9), (6,3), (7,2), (8,15), (10,10), (11,14), (12,19), (13,11), (14,12), (16,16), (17,20), (18,21), (19,13)}. The extended, compensation nets and their chains are indicated with dashed and dotted arrows, respectively, in Figure 3.…”

Section: Introductionmentioning

confidence: 99%

“…The extended, compensation nets and their chains are indicated with dashed and dotted arrows, respectively, in Figure 3. For example, the extended and compensation nets of net (2,6) are nets (2,11) and (11,6), respectively. Note that the target point 11 because of the existence of nets (7,2), (3,8), (5,9) and (10,10 For an oddi, 1-<i_<d, let (d) (q is a 1-point) A (:IB (r, q + 1) Uw).…”

Section: Introductionmentioning

confidence: 99%

“…In particular, the worst case of f usually holds for dense problems [10]. The best DM router [8] Definition 3. The target point of a net (p, q) with p < q is the minimum integer -> q such that the set of nets still to be inserted in the chains does not contain either a net (t, r) with r -< or a net (r, t) with r < t; and the set of nets already inserted in the chains does not contain a net (r, t) (see Figure 2).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An Optimum Channel Routing Algorithm in theKnock‐knee Diagonal Model

Song

1992

VLSI Design

Self Cite

View full text Add to dashboard Cite

A new HVHD model four‐layer channel router using a channel‐graph

Rhee

Sugai

Hirata

1994

Electron Comm Jpn Pt III

View full text Add to dashboard Cite

This paper proposes a new HVHD four‐channel routing technique using the channel‐graph. The diagonal routing model, which differs from the conventional four‐layer channel routing, is introduced in the proposed method; and the nets for the diagonal routing are selected by the algorithm based on the weighted channel‐graph. The rest net, left after the diagonal routing, is routed in HVH three‐layers. The proposed method is applied experimentally to several benchmark data, including Deutsch's difficult example. It is shown that tracks are reduced by approximately 20 percent compared to the conventional four‐channel routing method, and the result by the proposed method is closer to the result of the conventional five‐layer routing. Thus, the effectiveness of the proposed method based on the channel‐graph is demonstrated.

show abstract

A 2d channel router for the diagonal model

Cited by 19 publications

References 3 publications

Manhattan-diagonal routing in channels and switchboxes

Manhattan-diagonal routing in channels and switchboxes

An Optimum Channel Routing Algorithm in theKnock‐knee Diagonal Model

A new HVHD model four‐layer channel router using a channel‐graph

Contact Info

Product

Resources

About