Matrix Multiplication and Data Routing Using a Partitioned Optical Passive Stars Network

  • Authors:
  • Sartaj Sahni

  • Affiliations:
  • Univ. of Florida, Gainesville

  • Venue:
  • IEEE Transactions on Parallel and Distributed Systems
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

We develop optimal or near optimal algorithms to multiply matrices and perform commonly occurring data permutations and BPC permutations on multiprocessor computers interconnected by a partitioned optical passive stars network.