The Complexity of Reshaping Arrays on Boolean Cubes.

Abstract

Reshaping of arrays is a convenient programming primitive. For arrays encoded in a binary reflected gray code reshaping implies code change. We show that an axis splitting, or combining of two axes, requires communication in exactly one dimension, and that for multiple axis splittings the exchanges in the different dimensions can be ordered arbitrarily. We present two algorithms that vary incomplexity.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1990
Accession Number
ADA324830

Entities

People

  • C. Ho
  • S. L. Johnsson

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Access Time
  • Algorithms
  • Coding
  • Commerce
  • Communication Systems
  • Computations
  • Computer Science
  • Computers
  • Contracts
  • Conversion
  • Corporations
  • Data Sets
  • Data Transmission
  • Differential Equations
  • Language
  • Partial Differential Equations

Fields of Study

  • Computer science

Readers

  • Graph Algorithms and Convex Optimization.
  • Phased Array Antenna Design.