Hexagonal models for channel routing

DOI10.1007/PL00009174zbMATH Open0895.68072OpenAlexW2034879025MaRDI QIDQ1386360FDOQ1386360

Authors: K. D. Powers, Martin L. Brady, Donna J. Brown 

Publication date: 8 September 1998

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009174

Recommendations

• Hexagonal three-layer channel routing
• Routing multiterminal nets on a hexagonal grid
• A preliminary study of a diagonal channel-routing model
• Diagonal channel routing with vias at unit distance

zbMATH Keywords

VLSI layouthexagonal gridmultilayer routingchannel routing problem

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Computer system organization (68M99)

Cited In (7)

• HEX: scaling honeycombs is easier than scaling clock trees
• The maximum voltage drop in an on-chip power distribution network: analysis of square, triangular and hexagonal power pad arrangements
• Higher dimensional hexagonal networks
• Routing in the triangular grid with evolved agents
• Channel routing in a diagonal overlap model
• Hexagonal three-layer channel routing
• Congestion estimation for hexagonal routing

This page was built for publication: Hexagonal models for channel routing

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