Performance-driven global routing based on simulated evolution

In this paper, a performance-driven global routing algorithm is proposed. Different from conventional approaches, which are based upon the manipulation of nets, this algorithm is based upon the manipulation of synchronous paths. This algorithm consists of two phases: first, each critical synchronous path is routed; and then, each partially routed or unrouted net is completed. Each phase consists of an initial routing step and a rip-up and reroute step. We use the simulated evolution technique for the latter step. >