Optimal Algorithms for the Channel-Assignment Problem on a Reconfigurable Array of Processors with Wider Bus Networks

• Authors: Shi-Jinn Horng;Horng-Ren Tsai;Yi Pan;Jennifer Seitzer
• Venue: IEEE Transactions on Parallel and Distributed Systems
• Year: 2002

The computation model on which the algorithms are developed is the reconfigurable array of processors with wider bus networks (abbreviated to RAPWBN). The main difference between the RAPWBN model and other existing reconfigurable parallel processing systems is that the bus width of each network is bounded within the range \big. [2, \lceil \sqrt{N} \rceil]\bigr.. Such a strategy not only saves the silicon area of the chip as well as increases the computational power enormously, but the strategy also allows the execution speed of the proposed algorithms to be tuned by the bus bandwidth. To demonstrate the computational power of the RAPWBN, the channel-assignment problem is derived in this paper. For the channel-assignment problem with \big. N\bigr. pairs of components, we first design an \big. O(T + \lceil {N\over w} \rceil)\bigr. time parallel algorithm using \big. 2N\bigr. processors with a \big. 2N{\hbox{-}}\rm row\bigr. by \big. 2N{\hbox{-}}\rm column\bigr. bus network, where the bus width of each bus network is \big. w{\hbox{-}}\rm bit\bigr. for \big. 2 \leq w \leq \lceil \sqrt{N} \ \rceil\bigr. and \big. T={\lfloor \log _{w} N \rfloor}+1\bigr.. By tuning the bus bandwidth to the natural \big. \log N{\hbox{-}}\rm bit\bigr. and the extended \big. N^{1/c}{\hbox{-}}\rm bit\bigr. (\big. N^{1/c} \log N\bigr.) for any constant \big. c\bigr. and \big. c \geq 1\bigr., two more results which run in \big. O(\log N /\log \log N)\bigr. and \big. O(1)\bigr. time, respectively, are also derived. When compared to the algorithms proposed by Olariu et al. [17] and Lin [14], it is shown that our algorithm runs in the equivalent time complexity while significantly reducing the number of processors to \big. O(N)\bigr..