Optimal BPC Permutations on a Cube Connected SIMD Computer.

Abstract

In this paper, we develop an algorithm to perform BPC permutations on a cube connected SIMD computer. The class of BPC permutations includes many of the frequently occurring permutations such as matrix transpose, vector reversal, bit shuffle, and perfect shuffle. Our algorithm is shown to be optimal in the sense that it uses the fewest possible number of unit routes to accomplish any BPC permutation. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1981
Accession Number
ADA106802

Entities

People

  • David Nassimi
  • Sartaj Sahni

Organizations

  • University of Minnesota

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Computer Science
  • Computers
  • Continents
  • Electrical Engineering
  • Engineering
  • Geographic Regions
  • Instructions
  • Iterations
  • Mathematics
  • Military Research
  • Minnesota
  • North America
  • Parallel Processors
  • Permutations
  • Two Dimensional
  • Universities

Fields of Study

  • Computer science

Readers

  • Computer Programming and Software Development.
  • Irregular Warfare and Special Operations Cyberspace Operations against Adversarial Threats.
  • Parallel and Distributed Computing.