Fast Parallel Realization of Matrix Multiplication.

Abstract

Fast parallel matrix multiplication algorithms in SIMD (Single-Instruction-Multiple-Data) and MIMD (MUltiple-Instruction-Multiple-data) modes are described for implementation in a parallel-binary matrix processing system with facilities for bit-wise parallel Boolean operation and power-of-two shifts on Boolean matrices. A comparative study of these algorithms is made on the basis of their relative time-complexities, when conventional binary and prime-modulus arithmetic are used for forming the matrix product. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1979
Accession Number
ADA080074

Entities

People

  • E. V. Krishnamurthy
  • Reinhard Klette

Organizations

  • University of Maryland

Tags

Communities of Interest

  • Air Platforms
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Arithmetic
  • Computations
  • Computer Science
  • Computer Vision
  • Computers
  • Construction
  • East Germany
  • Fiber Optics
  • Maryland
  • Numbers
  • Parallel Computing
  • Parallel Processors
  • Scientific Research
  • Sequences
  • Universities

Readers

  • Computer Programming and Software Development.
  • Parallel and Distributed Computing.