Parallelizing post-placement timing optimization
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
| Hi-index | 0.00 |
In this paper we report experiences on a parallel implementation of a standard cell placement algorithm on a cluster of Myrinet connected PCs. The implementation is based on a recently developed placement tool (Feng Shui) that extends recursive bisection placement to incorporate global aspects of the design using an efficient optimization called iterative deletion. Contrary to previous attempts at paralleling placement algorithms, initial results show significant performance improvement with small reduction in the placement quality. Furthermore, the reduction in quality does not increase with the number of processors.