Automating the Coordination of Interprocessor Communication

Abstract

This paper presents methods for ensuring correct synchronization and scheduling of message-passing in the context of compiling shared-memory programs onto distributed-memory machines. We show that from a given source loop nest, there corresponds a maximum granularity where the computation can go on without the need for any communication, and a communication window within which a communication command must occur and can occur anywhere legally. Better overall efficiency can then be achieved by playing with the granularity parameter using more frequent communication than that for the maximum granularity case.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1990
Accession Number
ADA249324

Entities

People

  • Jingke Li
  • Marina Chen

Organizations

  • Yale University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Communication Systems
  • Compilers
  • Computations
  • Computer Programming
  • Computer Science
  • Computers
  • Data Transmission
  • Intervals
  • Iterations
  • Language
  • Networks
  • Notation
  • Operating Systems
  • Scheduling (Production)
  • Standards
  • Two Dimensional

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Parallel and Distributed Computing.
  • Systems Analysis and Design