Title :
A direct combination of the Prim and Dijkstra constructions for improved performance-driven global routing
Author :
Alpert, C.J. ; Hu, T.C. ; Huang, J.H. ; Kahng, A.B.
Author_Institution :
Comput. Sci. Dept., California Univ., Los Angeles, CA, USA
Abstract :
Motivated by analysis of distributed RC delay in routing trees, a new tree construction is proposed for performance-driven global routing which directly trades off between Prim´s minimum spanning tree algorithm and Dijkstra´s shortest path tree algorithm. This direct combination of two objective functions and their corresponding optimal algorithms contrasts with the more indirect `shallow-light´ methods. The authors´ method achieves routing trees which satisfy a given routing tree radius bound while using less wire than previous methods. Detailed simulations show that these wirelength savings translate into significantly improved delay over standard MST routing in both IC and multichip module (MCM) interconnect technologies
Keywords :
delays; integrated circuit interconnections; integrated circuit layout; multichip modules; network routing; network topology; trees (mathematics); wiring; Dijkstra´s shortest path tree algorithm; IC interconnect; Prim´s minimum spanning tree algorithm; distributed RC delay; interconnect technologies; multichip module; objective functions; performance-driven global routing; routing tree radius bound; routing trees; tree construction; Algorithm design and analysis; Capacitance; Circuit simulation; Costs; Delay effects; Integrated circuit modeling; Performance analysis; Routing; Topology; Wire;
Conference_Titel :
Circuits and Systems, 1993., ISCAS '93, 1993 IEEE International Symposium on
Conference_Location :
Chicago, IL
Print_ISBN :
0-7803-1281-3
DOI :
10.1109/ISCAS.1993.394112
