Minimizing Overhead in Parallel Algorithms Through Overlapping Communication/Computation.

Abstract

One of the major goals in the design of parallel processing machines and algorithms is to reduce the effects of the overhead introduced when a given problem is parallelized. A key contributor to overhead is communication time. Many architectures try to reduce this overhead by minimizing the actual time for communication, including latency and bandwidth. Another approach is to hide communication by overlapping it with computation. This paper presents the Proteus parallel computer and its effective use of communication hiding through overlapping communication/computation techniques. These techniques are easily extended for use in compiler support of parallel programming. We also address the complexity or rather simplicity, in achieving complete exchange on the Proteus Machine.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1997
Accession Number
ADA323728

Entities

People

  • Allen M. Sansano
  • Arun K. Somani

Tags

Communities of Interest

  • C4I
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Bandwidth
  • Communication Channels
  • Communication Systems
  • Compilers
  • Computations
  • Computer Programming
  • Computers
  • Data Links
  • Data Transmission
  • Engineering
  • Fault Tolerance
  • Image Processing
  • Lepidoptera
  • Parallel Computing
  • Scheduling (Production)
  • Two Dimensional

Fields of Study

  • Computer science

Readers

  • Computational Fluid Dynamics (CFD)
  • Computational Linguistics
  • Computer Networking