Constant Time Algorithms for the 3-D All Nearest Neighbor Problem on the LARPBS

Algorithms for multiplying several types of sparse n x n-matrices on dynamically reconfigurable n x n-arrays are presented. For some classes of sparse matrices constant time algorithms are given, e.g., when the first matrix has at most kn elements in each column or in each row and the second matrix has at most kn nonzero elements in each row, where k is a constant. Moreover, O(kn ) algorithms are obtained for the case that one matrix is a general sparse matrix with at most kn nonzero elements and the other matrix has at most k nonzero elements in every row or in every column. Also a lower bound of Ω(Kn ) is proved for this and other cases which shows that the algorithms are close to the optimum.

Download Full-text

Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconfigurable bus systems

IEEE Transactions on Parallel and Distributed Systems ◽

10.1109/71.80177 ◽

1990 ◽

Vol 1 (4) ◽

pp. 500-507 ◽

Cited By ~ 129

Author(s):

B.-F. Wang ◽

G.-H. Chen

Keyword(s):

Transitive Closure ◽

Constant Time ◽

Graph Problems ◽

Processor Arrays ◽

Related Graph ◽

Constant Time Algorithms

Download Full-text

Constant time algorithms for computational geometry on the reconfigurable mesh

IEEE Transactions on Parallel and Distributed Systems ◽

10.1109/71.569648 ◽

1997 ◽

Vol 8 (1) ◽

pp. 1-12 ◽

Cited By ~ 29

Author(s):

Jin-Wook Jang ◽

M. Nigam ◽

V.K. Prasanna ◽

S. Sahni

Keyword(s):

Computational Geometry ◽

Constant Time ◽

Reconfigurable Mesh ◽

Constant Time Algorithms

Download Full-text

Constant Time Algorithms for Computing the Contour of Maximal Elements on a Reconfigurable Mesh

Parallel Processing Letters ◽

10.1142/s0129626498000365 ◽

1998 ◽

Vol 08 (03) ◽

pp. 351-361 ◽

Cited By ~ 1

Author(s):

M. Manzur Murshed ◽

Richard P. Brent

Keyword(s):

Parallel Architectures ◽

Constant Time ◽

Maximal Elements ◽

Reconfigurable Mesh ◽

Constant Time Algorithms

There has recently been an interest in the introduction of reconfigurable buses to existing parallel architectures. Among them the Reconfigurable Mesh (RM) draws much attention because of its simplicity. This paper presents three constant time algorithms to compute the contour of the maximal elements of N planar points on the RM. The first algorithm employs an RM of size N × N while the second one uses a 3-D RM of size [Formula: see text]. We further extend the result to k-D RM of size N1/(k - 1) × N1/(k - 1) × … × N1/(k - 1).

Download Full-text