Constant Time Boolean Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System

  • Authors:
  • Keqin Li

  • Affiliations:
  • Dept. of Mathematics and Computer Science, State Univ. of New York, New Paltz, NY 12561 li@mcs.newpaltz.edu

  • Venue:
  • The Journal of Supercomputing - Special issue: high performance computing systems
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

We show that the product of two N × N boolean matrices can becalculated in constant time on an LARPBS with O(N3 / log N)processors. All data communications and computations are performed on thebit level. To the best of the author‘s knowledge, this is the first parallelboolean matrix multiplication algorithm that has constant execution time,and is executed on a distributed memory system with (N3)processors. By using our boolean matrix multiplication algorithm, it isshown that the transitive closure of a directed graph can be obtained inO(log N) time ( measured by bit level operations) on anLARPBS with O (N3 / log N) processors. To the best of ourknowledge, this is the first parallel algorithm for tansitive closure ofdirected graphs with time complexity O(log N) (comparable tothat of CRCW PRAM) and cost O (N3) on a realistic parallelcomputing model, which has no shared memory, and interprocessorcommunications are dealt with explicitly and efficiently.