A parallel router based on load-balanced region partition strategy

With the fast increase of the scale of VLSI and the development of multi-core technology, the research on parallel routing algorithm has been brought into focus. In this paper, we introduce a novel parallel routing algorithm, in which we design a region partition strategy with the concerns about load balance. In our approach, the region is divided into well-proportion sub-regions, so that the parallel tasks could be completed approximately simultaneously. Besides, we implement the algorithm by multi-threading technology and the parallel tasks are scheduled with the task farm. Experimental results clearly demonstrate the efficiency and high speedup of our approach, which reaches 1.5 times or more.

[1]  Wei Dong,et al.  WavePipe: Parallel transient simulation of analog and digital circuits on multi-core shared-memory machines , 2008, 2008 45th ACM/IEEE Design Automation Conference.

[2]  Mehdi R. Zargham.  Parallel channel routing , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[3]  Sartaj Sahni,et al.  Maze Routing on a Hypercube Multiprocessor Computer , 1987, International Conference on Parallel Processing.

[4]  Yici Cai,et al.  Congestion-driven W-shape multilevel full-chip routing framework , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[5]  R. E. Massara,et al.  A VLSI routing framework for use on a multiprocessor workstation , 1991, [1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design.

[6]  Hao Sun,et al.  Global routing for VLSI standard cells , 2004, Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No.04CH37513).

[7]  Pinaki Mazumder.  Parallel VLSI-routing models for polymorphic processors array , 1997 .

[8]  Mikael Palczewski.  Plane parallel A* maze router and its application to FPGAs , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.