Accession Number : ADA323728

Title :   Minimizing Overhead in Parallel Algorithms Through Overlapping Communication/Computation.

Descriptive Note : Contractor rept.,

Corporate Author : INSTITUTE FOR COMPUTER APPLICATIONS IN SCIENCE AND ENGINEERING HAMPTON VA

Personal Author(s) : Somani, Arun K. ; Sansano, Allen M.

PDF Url : ADA323728

Report Date : FEB 1997

Pagination or Media Count : 29

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.

Descriptors :   *ALGORITHMS, *COMPUTER COMMUNICATIONS, *PARALLEL PROCESSING, SOFTWARE ENGINEERING, COMPUTATIONS, DATA MANAGEMENT, INFORMATION EXCHANGE, DISTRIBUTED DATA PROCESSING, COMPUTER ARCHITECTURE, INPUT OUTPUT PROCESSING, MULTIPROCESSORS, COMPILERS, FAULT TOLERANCE, MULTIPROGRAMMING.

Subject Categories : Computer Programming and Software
      Computer Systems

Distribution Statement : APPROVED FOR PUBLIC RELEASE