Parallel computing (2nd ed.): theory and practice
Parallel computing (2nd ed.): theory and practice
Minimum crosstalk channel routing
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Wire routing by optimizing channel assignment within large apertures
DAC '71 Proceedings of the 8th Design Automation Workshop
A general graph theoretic framework for multi-layer channel routing
VLSID '95 Proceedings of the 8th International Conference on VLSI Design
Multilayer channel routing
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
| Hi-index | 0.00 |
As fabrication technology advances, devices and interconnection wires are placed in closer proximity and circuits operate at higher frequencies. This results in crosstalk between wire segments. Work on routing channels with reduced crosstalk is a very important area of current research [3, 10]. We know that the crosstalk minimization problem in the reserved two-layer Manhattan routing model is NP-complete, even for the channels without any vertical constraints. Since minimizing crosstalk is NP-complete, several polynomial time heuristic algorithms for reducing crosstalk have been developed [8, 9, 15]. All the ideas that are introduced as heuristics are basically sequential in nature. In this paper we have developed two efficient heuristics to compute reduced crosstalk routing solutions in a distributed computing environment. Our proposed heuristics are much better in computational complexity than the existing sequential versions of the algorithms developed in [9, 15].