Abstract

In this paper we present a parallel algorithm for the channel routing problem, using the knock-knee mode. The algorithm requires O(log N) time with O( N 2 logN number of nets) processors on a CREW-PRAM. The wire layout constructed by this algorithm is area optimal if the channel routing problem is a permutation channel routing problem. For the general channel routing problem it determines a wire layout, which uses a minimal number of vertical lines and only a small number of additional horizontal lines.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call