Provably good routing in graphs: regular arrays
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Experimental results for a linear program global router
Computers and Artificial Intelligence
A preliminary investigation into parallel routing on a hypercube computer
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
PHIGURE: a parallel hierarchical global router
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Parallel algorithms for VLSI computer-aided design
Parallel algorithms for VLSI computer-aided design
LocusRoute: a parallel global router for standard cells
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Global wiring on a wire routing machine
DAC '82 Proceedings of the 19th Design Automation Conference
Document for a Standard Message-Passing Interface
Document for a Standard Message-Passing Interface
TDR: A Distributed-Memory Parallel Routing Algorithm for FPGAs
FPL '02 Proceedings of the Reconfigurable Computing Is Going Mainstream, 12th International Conference on Field-Programmable Logic and Applications
Hi-index | 0.00 |
In this paper, we propose three different parallel algorithms based on a state-of-the-art global router called TimberWolfSC. The parallel algorithms have been implemented by using the Message Passing Interface (MPI), and have been evaluated on a wide range of parallel platforms such as the Sun SparcCenter~1000 and the Intel Paragon. Our experimental results show good speedups and qualities from two of these parallel algorithms. We have been able to reduce runtimes of some circuits from half an hour to 5 minutes, obtained speedups of about 4.0 to 5.0 on 8 processors, with less than 2-3% degradation of quality of the solutions.