Type Architectures, Shared Memory and the Corollary of Modest Potential.

Abstract

The influence of the programming language model to specifying parallelism is explained: the SOR algorithm is used as an illustration; the concept of type of computer architecture--an idealized machine specifying the language/architecture interface-- is introduced; it is observed that the paracomputer (=CRCW -PRAM) has frequently been used as a type architecture, but it is inadequate; Valiant's maximum finding algorithm, though optimal for the CRCW-PRAM is proved to be suboptimal in practice; this is interpreted as evidence for the inadequacy of the paracomputer as a type architecture; alternate type architecture that avoid this problem are discussed. Keywords: Parallel programming languages. (KR)

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1986
Accession Number
ADA196416

Entities

People

  • Lawrence H Snyder

Organizations

  • University of Washington

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Architecture
  • Computer Languages
  • Computer Programming
  • Computers
  • Computing System Architectures
  • Language
  • Programming Languages

Fields of Study

  • Computer science

Readers

  • Graph Algorithms and Convex Optimization.
  • Parallel and Distributed Computing.
  • Systems Analysis and Design