Parallel total weight crossing number algorithm for channel routing on a linear array with a reconfigurable pipelined bus system

In the channel routing problem, terminals between cells ave interconnected completely while reducing channel routing area. The crossing number, the number of crossings between two wires in the channel, is related to the channel routing area. In this paper; we present a parallel algorithm finding a weighted total crossing number in the channel by using LARPBS model (Linear Array with a Reconfigurable Pipelined Bus System), which is based on the advanced fiber optic technology. The parallel total weight crossing number algorithm on the LARPBS model runs in O(n*log(root n)) time using O(n) number of processors, where n is the number of nets in a channel.