A Cost-Optimal Algorithm for the Channel-Assignment Problem on a Reconfigurable Parallel Processing System

Abstract

channel-assignment problem , minimum The computation model on which the algorithms are developed is the reconfigurable array of processors with wider bus networks (abbreviated to RAPWBN). The minor deference between the RAPWBN model with the other reconfigurable parallel processing system is that the bus width of each bus network is extended to N1/c –bit. Where c is any constant and c>1. Such a strategy is not only to make lots of improvement for saving the silicon area but also increase the system power enormously. In this paper, based on the wider bus network architecture, the channel-assignment problem for N pairs of components can be solved in O(1) time using 2N processors with a 2N-row by 2N-column bus networks, where the bus width is N1/c-bit (N1/c>lo N) for any constant c and c>=1.Compared to the algorithms as proposed by Olariu et al. [13] and [10], our algorithm runs in the same time complexity but reduces the number of processors to O(N). Not that our algorithm is cost-optimal but other are not.