A Compile Time Model for Composing Parallel Programs

Abstract

Many distributed memory machines support connection-based communication instead of or in addition to connection-less message passing. Connection-based communication can be more efficient than message passing because the resources are reserved once for the connection and multiple messages can be sent over the connection. While long-lived connections enable more efficient use of the communication system in some situations, managing connection resources adds another level of complexity to programming such machines. iWarp is an example of a distributed memory machine that supports long-lived connections. To aid the iWarp programmer and program generator tools, we developed a tool chain that enables the programmer to define connections and compose parallel programs. The communication tool chain has been in use for four years in various forms. In that time, we have found many benefits and a few pitfalls in our model. This paper describes the design of the programming model and tools and discusses our experiences with this implementation.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1994
Accession Number
ADA278896

Entities

People

  • Susan Hinrichs

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Bandwidth
  • Communication Systems
  • Computations
  • Computer Programming
  • Computer Science
  • Computer-Aided Design
  • Computers
  • Computing System Architectures
  • Environment
  • Generators
  • Grids
  • Image Processing
  • Language
  • Parallel Computing
  • Parallel Processing
  • Two Dimensional

Fields of Study

  • Computer science
  • Engineering

Readers

  • Computer Networking
  • Parallel and Distributed Computing.
  • Software Engineering.