Programming Solutions to the Algorithm Contraction Problem.

reportActive / Technical Report | Accession Number: ADA193295 | Open PDF

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.

Author(s):
Nelson, Philip A. ; Snyder, Lawrence
Author Organization(s):
WASHINGTON UNIV SEATTLE DEPT OF COMPUTER SCIENCE
Descriptive Note:
Technical rept.,
Pagination:
0005

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Contract/Grant Number(s):
N00014-85-K-0328, $NSF-DCR84-16878
 Subject Terms
Joint Capability Areas:
JCA_6.1.2_Wireless Transmission; JCA_6.1_Information Transport; JCA_6_Net Centric; JCA_1_Force Support; JCA_1.2_Force Preparation; JCA_1.2.3_Educating; JCA_1.3_Human Capital Management; JCA_5_Command and Control
Communities of Interest:
Materials and Manufacturing Processes
Descriptor(s):
*ALGORITHMS, *COMPUTER PROGRAMMING, COMMUNICATION AND RADIO SYSTEMS, CONTRACTION, MACHINES, PARALLEL ORIENTATION, PARALLEL PROCESSING, PATHS, PROBLEM SOLVING, SOLUTIONS(GENERAL)
Field(s)/Group(s):
Computer Programming and Software
Keyword(s):
*Parallel programming
Report Date:
1986 Apr 01