By Topic

Computing list ranking on a RAP with wider bus networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tzong-Wann Kao ; Dept. of Electr. Eng., Nat. Taiwan Inst. of Technol., Taipei, Taiwan ; Shi-Jinn Horng

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 1+1c/ processors with N×N1+1c/ bus networks and each bus network with N1c/-bit, where c is a constant and e⩾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

Published in:

Parallel and Distributed Systems, 1994. International Conference on

Date of Conference:

19-22 Dec 1994