Parallel processing of recursive functions
Loading...
Authors
Burkhead, Franklin
Subjects
parallel processing
recursive functions
LISP
data flow graphs
recursive functions
LISP
data flow graphs
Advisors
Kildall, G.A.
Date of Issue
1977-06
Date
June 1977
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
Algorithms define} 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.
Type
Thesis
Description
Series/Report No
Department
Computer Science
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Distribution Statement
Approved for public release; distribution is unlimited.