Parallel Processing of Recursive Functions.

Abstract

Algorithms defined as recursive functions, such as in pure LISP, are shown to have structure sufficient to distinguish between processes which must be executed in sequence and processes which may be executed in parallel. An interpreter program is presented for executing LISP programs and simultaneously computing the number of processors needed at each step of program execution in order to achieve optimum parallel processing. Sample program runs are presented to show speed-up ratios between strictly sequential and optimally parallel executions. A possible hardware organization for a parallel processing system derived from the interpreter program is presented. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1977
Accession Number
ADA044473

Entities

People

  • Franklin Burkhead

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computational Processes
  • Computations
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Data Transmission
  • Parallel Computing
  • Parallel Processing
  • Parallel Processors
  • Recursive Functions
  • Schools
  • Sequences
  • Three Dimensional
  • United States
  • United States Naval Academy

Fields of Study

  • Computer science

Readers

  • Computer Science.
  • Parallel and Distributed Computing.