Execution Time Support for Adaptive Scientific Algorithms on Distributed Memory Machines

Abstract

We consider optimizations that are required for efficient execution of code segments that consists of loops over distributed data structures. The PARTI (Parallel Automated Runtime Toolkit at ICASE) execution time primitives are designed to carry out these optimizations and can be used to implement a wide range of scientific algorithms on distributed memory machines. These primitives allow the user to control array mappings in a way that gives an appearance of shared memory. Computations can be based on a global index set. Primitives are used to carry out gather and scatter operations on distributed arrays. Communications patterns are derived at runtime, and the appropriate send and receive messages are automatically generated. (kr)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1990
Accession Number
ADA224407

Entities

People

  • Harry Berryman
  • Jeffrey Scroggs
  • Joel Saltz

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computational Fluid Dynamics
  • Computations
  • Computer Programming
  • Differential Equations
  • Efficiency
  • Engineering
  • Equations
  • Estimators
  • Fluid Dynamics
  • Global Communications
  • Optimization
  • Partial Differential Equations
  • Preprocessing
  • Scheduling (Production)
  • Simulations
  • Two Dimensional

Fields of Study

  • Computer science
  • Engineering

Readers

  • Parallel and Distributed Computing.