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

1990 ◽  
Vol 1 (4) ◽  
pp. 500-507 ◽  
Author(s):  
B.-F. Wang ◽  
G.-H. Chen
Keyword(s):  
Transitive Closure ◽  
Constant Time ◽  
Graph Problems ◽  
Processor Arrays ◽  
Related Graph ◽  
Constant Time Algorithms

A PARALLEL ALGORITHM TO GENERATE N-ARY REFLECTED GRAY CODES IN A LINEAR ARRAY WITH RECONFIGURABLE BUS SYSTEM

1993 ◽  
Vol 03 (02) ◽  
pp. 157-164 ◽  
Author(s):  
P. THANGAVEL ◽  
V.P. MUTHUSWAMY
Keyword(s):  
Parallel Algorithm ◽  
Linear Array ◽  
Constant Time ◽  
Processor Array ◽  
Gray Codes ◽  
System A ◽  
Processor Arrays ◽  
Bus System

A simple parallel algorithm for generating N-ary reflected Gray codes is presented. The algorithm is derived from the pattern of N-ary reflected Gray codes. The algorithm runs on a linear processor array with a reconfigurable bus system. A reconfigurable bus system is a bus system whose configuration can be dynamically changed. Recently processor arrays with reconfigurable bus systems were used to solve many problems in constant time. There already exists experimental reconfigurable chips.

A CONSTANT TIME ALGORITHM FOR REDUNDANCY ELIMINATION IN TASK GRAPHS ON PROCESSOR ARRAYS WITH RECONFIGURABLE BUS SYSTEMS

1993 ◽  
Vol 03 (02) ◽  
pp. 171-177 ◽  
Author(s):  
B. PRADEEP ◽  
C. SIVA RAM MURTHY
Keyword(s):  
Parallel Algorithm ◽  
Time Algorithm ◽  
Constant Time ◽  
Redundancy Elimination ◽  
Task Graphs ◽  
Processor Arrays ◽  
Precedence Graph ◽  
Practical Tool ◽  
Algorithm Parallelization

The task or precedence graph formalism is a practical tool to study algorithm parallelization. Redundancy in such task graphs gives rise to numerous avoidable inter-task dependencies which invariably complicates the process of parallelization. In this paper we present an O(1) time algorithm for the elimination of redundancy in such graphs on Processor Arrays with Reconfigurable Bus Systemusing O(n4) processors, The previous parallel algorithm available in the literature for redundancy elimination in task graphs takes O(n2) time using O(n) processors.

scholarly journals Multiplication of Matrices With Different Sparseness Properties on Dynamically Reconfigurable Meshes

VLSI Design ◽  
1999 ◽  
Vol 9 (1) ◽  
pp. 69-81 ◽  
Author(s):  
Martin Middendorf ◽  
Hartmut Schmeck ◽  
Heiko Schröder ◽  
Gavin Turner
Keyword(s):  
Lower Bound ◽  
Sparse Matrix ◽  
Sparse Matrices ◽  
The Other ◽  
Constant Time ◽  
Dynamically Reconfigurable ◽  
Reconfigurable Meshes ◽  
Constant Time Algorithms

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.

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

1998 ◽  
Vol 08 (03) ◽  
pp. 351-361 ◽  
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).

Sign in / Sign up

Export Citation Format

Share Document