An efficient parallel logarithmic time algorithm for the channel routing problem

DOI10.1016/0166-218X(92)90022-3MaRDI QIDQ1201820zbMATH OpenFDO

Authors S. Singh

Publication date 17 January 1993

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(92)90022-3

zbMATH Keywords

knock-knee modeparallel algorithmstwo-terminal net channel routing

Mathematics Subject Classification ID

Distributed algorithms (68W15) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Parallel Algorithms for Channel Routing in the Knock-Knee Model
• OPTIMAL ROUTING THROUGH DENSE CHANNELS
• scientific article; zbMATH DE number 1737512
• Routing through a Dense Channel with Minimum Total Wire Length
• Optimal Three-Layer Channel Routing

Cites work

• An introduction to parallelism in combinatorial optimization
• Binary Trees and Parallel Scheduling Algorithms
• Disjoint paths in a rectilinear grid
• Optimal Three-Layer Channel Routing
• Parallel Algorithms for Channel Routing in the Knock-Knee Model
• Parallelism in random access machines

Cited in

(6)

• A constant-time channel-assignment algorithm on reconfigurable meshes
• A parallel multi-layer channel router on the HVH model
• Parallel Algorithms for Channel Routing in the Knock-Knee Model
• scientific article; zbMATH DE number 6538149 (Why is no real title available?)
• scientific article; zbMATH DE number 933177 (Why is no real title available?)
• A parallel algorithm for channel routing

This page was built for publication: An efficient parallel logarithmic time algorithm for the channel routing problem

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