An efficient parallel algorithm for channel routing

Sridhar Krishnamurthy, Joseph F. JáJá

Abstract: The channel-routing of a set of multiterminal nets in the standard two-layer model is considered. The sequential algorithms based on the greedy strategy do not seem to be easily parallelizable. Proposed is an efficient parallel algorithm for routing channels with cyclic constraints. The algorithm runs in time O(n/sup 2//p+log/sup 2/p), with p processors, on a shared memory parallel random access machine (PRAM) model where 1<or=p<or=n/sup 2/ square root and n is the size of the input. An efficient adaptation of this algorithm on a Sequent Balance 21000 multiprocessor system is reported.<