Achieving Speedups for a Shared Memory Model Language on an SIMD parallel Computer

Abstract

The potential for speeding up a shared memory model sequential programming language, APL, by using an idealized non-shared memory parallel computer is investigated. The authors simulated the running of APL's dyadic, reduction, and subscript operators on a 4-connected mesh SIMD parallel computer. The simulation results indicate that these operations can be sped up significantly using parallelism. These findings support the thesis that parallelism can speedup a majority of 'typical' APL (A Programming Language) programs and not just those programs that are especially suited to parallelization. The sequential APL language requires no sophisticated compilation techniques like Paraphase and PFC, because the operators in APL are inherently parallel. It is felt that exploiting this property of APL is interesting.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1987
Accession Number
ADA197102

Entities

People

  • Larry Snyder
  • Ray Greenlaw

Organizations

  • University of Washington

Tags

DTIC Thesaurus Topics

  • Algorithms
  • C Programming Language
  • Compilers
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Environment
  • Global Communications
  • Language
  • Parallel Computing
  • Parallel Processing
  • Programming Languages
  • Simulations
  • Universities

Fields of Study

  • Computer science

Readers

  • Computer Engineering
  • Computer Programming and Software Development.
  • Distributed Systems and Data Platform Development