Open AccessA High Performance Global Routing Algorithm on Julia Parallel Computing Platform
Author(s) -
Yi Zhang,
Hongjian Qu,
Yuan Qi,
Xu Qifan
Publication year - 2021
Publication title -
wseas transactions on computer research
Language(s) - English
Resource type - Journals
eISSN - 2415-1521
pISSN - 1991-8755
DOI - 10.37394/232018.2021.9.12
Subject(s) - computer science , speedup , routing (electronic design automation) , parallel computing , pace , multi core processor , path (computing) , routing algorithm , performance improvement , load balancing (electrical power) , distributed computing , algorithm , embedded system , routing protocol , computer network , grid , operations management , geometry , mathematics , geodesy , economics , geography
o keep pace with the design requirements of Integrated Circuits (ICs), parallel processing is adopted. The path to be routed between two nodes may or may not be dependent on the previously routed paths. The solution requires careful attention in distributing the nets to be routed to different processors. Previous work on allocating the tasks to processors has been quite successful, reporting upto 3x improvement on 4 cores and 5x improvement on 8 core machine. The advantage of increasing the number of cores diminishes with each added processor and the challenge lies in being able to maintain the improvement per added core. The existing techniques of distributing the nets cannot provide additional advantage of using more than 8 cores. This paper improves the work on parallelizing global routing using a technique of balancing the load on the processors for better utilization of the resources. A relatively new budding platform Julia has been used which provides the ease of programming while maintaining the performance of the C language. Technique used in this paper has enabled to use 16 cores with routing solutions obtained in 0.8 minutes achieving 12.5 times speedup compared to sequential processing on a single core