Optimal Three-Layer Channel Routing

DOI10.1109/TC.1984.1676459MaRDI QIDQ3684051zbMATH OpenOpenAlexFDO

Authors Witold jun. Lipski, F. P. Preparata

Publication date 1984

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1984.1676459

zbMATH Keywords

algorithmmultilayer wiringVLSI designVLSI layouts

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Recommendations

• Optimizing area for three-layer knock-knee channel routing
• scientific article; zbMATH DE number 3907789
• OPTIMAL ROUTING THROUGH DENSE CHANNELS
• scientific article; zbMATH DE number 3898776
• Nearly optimal algorithms and bounds for multilayer channel routing

Cited in

(37)

• One-layer routing without component constraints
• Algorithms for routing in planar graphs
• Channel routing in knock-knee mode: Simplified algorithms and proofs
• Minimizing channel density in standard cell layout
• Geometric problems on two-dimensional array processors
• Constrained via minimization for three-layer routing
• Minimum separation for single-layer channel routing
• An efficient parallel logarithmic time algorithm for the channel routing problem
• Parity conditions in homotopic knock-knee routing
• Maximum \(k\)-covering of weighted transitive graphs with applications
• Routings for involutions of a hypercube
• Diagonal channel routing with vias at unit distance
• Hexagonal three-layer channel routing
• A preliminary study of a diagonal channel-routing model
• Optimizing area for three-layer knock-knee channel routing
• Routing through a Dense Channel with Minimum Total Wire Length
• Parallel Algorithms for Channel Routing in the Knock-Knee Model
• Wiring layouts in the tri-hexagonal grid^∗
• scientific article; zbMATH DE number 3898776 (Why is no real title available?)
• Optimal Rotation Problems in Channel Routing
• A unified approach to layout wirability
• Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays
• scientific article; zbMATH DE number 52189 (Why is no real title available?)
• Flexible optimal channel routing for critical nets
• OPTIMAL ROUTING THROUGH DENSE CHANNELS
• Channel routing of multiterminal nets
• A three-layer over-the-cell multi-channel router for a new cell model
• Nearly optimal algorithms and bounds for multilayer channel routing
• Routing in a three-dimensional chip
• scientific article; zbMATH DE number 1737512 (Why is no real title available?)
• scientific article; zbMATH DE number 1786525 (Why is no real title available?)
• MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN
• Transport Channel Selection
• Dynamic computational geometry on meshes and hypercubes
• Optimal algorithms for adjacent side routing
• Optimal multilayer channel routing with overlap
• Routing in times square mode

This page was built for publication: Optimal Three-Layer Channel Routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3684051)