Skip to main content
Log in

Finding All Minimal Shapes in a Routing Channel

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract.

We present an algorithm to find a set of all optimal solutions for a channel placement problem. A channel consists of two rows of horizontal line segments (representing components). Each line segment contains some terminals with fixed positions. Sets of terminals, called nets, are to be connected. The relative ordering of line segments in each row is fixed. The line segments can be shifted left or right, which will affect the width needed for routing and the length of the channel. We want to find the tradeoff between channel length and routing width. Since the channel routing problem is NP-complete, we use a lower bound on routing width, called density. The density of a placement is the maximum number of nets crossing each vertical cut. We can increase the total length to minimize the channel density, or minimize the total length by increasing the channel density. The pair (density, total length) is called the shape of a placement. A shape is minimal if a decrease in density would cause an increase in total length, and vice versa. Our algorithm computes all the minimal shapes in O (N 4 ) time, where N is the number of nets. This is the first known algorithm for this problem whose running time is polynomial in the number of nets and independent of the length of the channel.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received January 18, 1996; revised December 2, 1996.

Rights and permissions

Reprints and permissions

About this article

Cite this article

-F. Chao, L., LaPaugh, A. Finding All Minimal Shapes in a Routing Channel . Algorithmica 21, 211–244 (1998). https://doi.org/10.1007/PL00009213

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00009213

Navigation