MCM ROUTING ALGORITHM-BASED ON A COMPATIBILITY GRAPH APPROACH

A new algorithm for general area multichip module routing using a mult i-candidate and compatibility graph approach, which maximises routing density while minimising vias and total wire length, is presented. Exp erimental results using standard industrial benchmarks show improved r esults relative to a commercial router and other previously proposed r outers while offering flexibility for future incorporation of noise an d delay constraints.