Algorithms to Harness Massive Parallelism

Abstract

This research project has been a study of many ways to control and to use massive parallelism in distributed computing systems. This research emphasized the use of hierarchies to simplify control and application algorithms intended for parallel computer systems of thousands or millions of processors. Most of the algorithms considered were organized to use interprocessor message paths that formed virtual spanning trees touching every node in a network. Simulators were developed to predict the collective behavior of hundreds or thousands of computers running local copies of the same algorithm; a graphical interface (PARVU) was developed to display moving color images of parallel program behavior in large networks; and fiber optic (MERLIN) hardware interfaces were designed to provide limited sharing of memory in networks of many hundreds computers running scientific application programs.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 16, 1989
Accession Number
ADA236200

Entities

People

  • Larry D. Wittie

Organizations

  • Stony Brook University

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Application Software
  • Computer Programming
  • Computer Science
  • Computers
  • Debugging
  • Distributed Computing
  • Hierarchies
  • Mathematical Analysis
  • Parallel Computing
  • Parallel Processing
  • Security
  • Simulations
  • Simulators
  • Three Dimensional
  • Two Dimensional

Fields of Study

  • Physics

Readers

  • Computer Vision.
  • Parallel and Distributed Computing.