Computing list ranking on a RAP with wider bus networks
Tzong‐Wann Kao, Shi-Jinn Horng · 2002
This paper makes an improvement of computing the list ranking and some related problems on a reconfigurable array of processors (abbreviated to RAP) with wider bus networks by increasing the bus width between processors. Based on such an architecture and a base-n system technique, a constant time basic operation is first introduced for computing the prefix modular n and prefix division n computations of an N-bit binary sequence on a linear RAP using N processors. Then, several fundamental problems can be solved in a constant time on a RAP using N/sup 1+1/c/ processors with N/spl times/N/sup 1+1/c/ bus networks and each bus network with N/sup 1/c/-bit, where c is a constant and e/spl ges/1. These algorithms include the prefix sum of N integers problem, the weight list ranking problem, the Euler tour problem and the tree recursions problem, respectively. Another contribution of this paper is that the execution time of the proposed algorithms is tunable by the bus width.