A Test Bed for a Massively Parallel Computer Architecture

Abstract

Mr. Partain has carried out research on alternatives to graph reduction as it is commonly understood. His main objective -- which he has reached -- was to develop a way to do graph reduction without actually using pointers. This will permit parallel implementation of functional programming languages without having to rely on a global address space. Given some suitable machine primitives, such an implementation is shown by Partain to be competitive with ordinary graph reduction. From a mathematical point of view, the results provide a way to do lazy normal-order tree reduction for the lambda calculus.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1986
Accession Number
ADA213786

Entities

People

  • Gyula Mago

Organizations

  • University of North Carolina at Chapel Hill

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Availability
  • Calculus
  • Computer Architecture
  • Computer Programming
  • Computer Science
  • Computers
  • Computing System Architectures
  • Language
  • Linear Programming
  • Military Research
  • North Carolina
  • Programming Languages
  • Scientists
  • Security
  • Test Beds
  • Theses

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computational Linguistics
  • Distributed Systems and Data Platform Development

Technology Areas

  • Space