Programming Solutions to the Algorithm Contraction Problem.

Abstract

Algorithms for the parallel solution of problems are usually designed assuming an unlimited number of processors. Physical parallel machines have a fixed number of processors. The algorithm contraction problem arises when an algorithm requires more processors than are available on the physical machine. This document presents tools for comparing algorithm contractions based on bottle neck communication paths. The authors apply these tools to minimum, matrix product and sorting.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1986
Accession Number
ADA193295

Entities

People

  • Lawrence H Snyder
  • Philip A. Nelson

Organizations

  • University of Washington

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Computer Science
  • Computers
  • Contracts
  • Information Systems
  • Language
  • Mechanical Engineering
  • Military Research
  • Parallel Computing
  • Parallel Processing
  • Traction
  • Trees (Data Structures)
  • Universities

Readers

  • Exercise and Sports Science.
  • Parallel and Distributed Computing.
  • Systems Analysis and Design