A preliminary study of a diagonal channel-routing model

Lodi, Elena; Luccio, Fabrizio; Pagli, Linda

doi:10.1007/bf01553910

Cited by 33 publications

(11 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the diagonal routing model, the rectilinear grid is simply rotated 45 ı -hence there are still only two orientations [263,264,266] (Fig. 2.30).…”

Section: Printed Circuit Boards and Channel Routingmentioning

confidence: 99%

Optimal Interconnection Trees in the Plane

Brazil

Zachariasen

2015

Algorithms and Combinatorics

View full text Add to dashboard Cite

“…In the diagonal routing model, the rectilinear grid is simply rotated 45 ı -hence there are still only two orientations [263,264,266] (Fig. 2.30).…”

Section: Printed Circuit Boards and Channel Routingmentioning

confidence: 99%

Optimal Interconnection Trees in the Plane

Brazil

Zachariasen

2015

Algorithms and Combinatorics

View full text Add to dashboard Cite

“…If two layers are available in a bubble-sorting-based non-Manhattan routing model, a physical routing result will be yielded by mapping each left-swap or right-swap pass in on one routing track from bottom to top track by track. For the vector (5,6,10,11,8,4,9,7,1,3,2), an optimal BSS is obtained by running the algorithm OBSS. Furthermore, a physical routing result will be obtained by mapping seven left-swap passes in on seven tracks from bottom to top track by track.…”

Section: A Optimal Bubble-sorting Solutionmentioning

confidence: 99%

“…In fact, a non-Manhattan channel router always uses fewer routing tracks than a Manhattan router in a channel. Hence, new non-Manhattan CR problems have been formulated [6], [8], and nonoptimum and optimal non-Manhattan algorithms [6]- [9] have been proposed.…”

Section: Introductionmentioning

confidence: 99%

An improved optimal algorithm for bubble-sorting-based non-Manhattan channel routing

Yan

1999

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

View full text Add to dashboard Cite

It is well known that a non-Manhattan channel router always uses fewer routing tracks than a Manhattan router in a channel. To our knowledge, for a bubble-sorting-based non-Manhattan channel routing (BSNMCR) problem, Chaudhary's O(kn 2) heuristic algorithm [8] and Chen's O(k 2 n) optimal algorithm [9] have been, respectively, proposed, where n is the number of terminals and k is the number of routing tracks in a channel. However, the time complexity of the two algorithms is in O(n 3) time in the worst case. In this paper, based on optimalityoriented swap-direction selection in an optimal bubble-sorting solution, an improved optimal algorithm for a BSNMCR problem is proposed, and the time complexity of the proposed algorithm is proven to be in O(kn) time and in O(n 2) time in the worst case.

show abstract

“…As VLSI technology advances, the fabrication process does not preclude a nonManhattan layout style. A nonManhattan channel router can use fewer routing tracks and is never worse than a Manhattan router in a channel [Lodi et al 1989;Wang 1991;Chaudhary et al 1991]. Hence, a new bubble-sorting-based nonManhattan channel routing problem has been formulated [Chaudhary et al 1991], and nonoptimum and optimal bubblesorting-based nonManhattan channel routers [Chaudhary et al 1991;Chen et al 1994;Yan 1999] have been proposed.…”

Section: Introductionmentioning

confidence: 99%

Three-layer bubble-sorting-based nonManhattan channel routing

Yan

2000

ACM Trans. Des. Autom. Electron. Syst.

View full text Add to dashboard Cite

It is well known that a nonManhattan channel router can use fewer routing tracks, and is never worse than a Manhattan router in a channel. To my knowledge, a three-layer bubblesorting-based nonManhattan channel routing problem is always solved by the solution in a two-layer bubble-sorting-based nonManhattan channel routing problem. Recently, an O͑kn 2 ͒ heuristic algorithm [Chaudhary et al. 1991] and an O͑k 2 n͒ optimal algorithm [Chen et al. 1994] have been proposed, where k is the number of two-layer routing tracks and n is the number of terminals in a bubble-sorting-based nonManhattan channel. In this paper we propose an optimal three-layer bubble-sorting-based nonManhattan routing algorithm to minimize the number of three-layer routing tracks. Furthermore, the time complexity of this optimal algorithm is proven to be in O͑hn͒ time, where h is the number of three-layer routing tracks and n is the number of terminals in a bubble-sorting-based nonManhattan channel.

show abstract

A preliminary study of a diagonal channel-routing model

Cited by 33 publications

References 3 publications

Optimal Interconnection Trees in the Plane

Optimal Interconnection Trees in the Plane

An improved optimal algorithm for bubble-sorting-based non-Manhattan channel routing

Three-layer bubble-sorting-based nonManhattan channel routing

Contact Info

Product

Resources

About