Optimized channel routing algorithms for dynamically adjusting channel with the program size

Abstract

To solve the routing confusion of the conventional hierarchical layout algorithm in the large-scale program,based on the Sugiyama hierarchical layout algorithm,this paper proposed an optimized algorithm for channel routing,which dynamically adjusted the number of channel according to the program size.In order to solve the low efficiency and lines overlap,the algorithm built functional relationships between channel number and program size.And by using the generalized tensor balance algorithm to reduce the crossings and realize the artistic layout.The algorithm also gave the corresponding line distribution and application strategy in accordance with the relative positional relationship between the calling nodes to achieve the ordered routing.The experimental results show that the algorithm has greater layout efficiency.It can reduce the crossings effectively,realize clear layout and is easy to implement.