Efficient Implementation of Applicative Languages
Name
MIT-LCS-TR-323.pdf
Size
5.35 MB
Format
Adobe PDF
Checksum (MD5)
d57d34c5d161297ed48ed84a93fb0e36
Author(s)
Ackerman, William B.
Advisor(s)
Dennis, Jack B.
Date Issued
April 1984
Series/Report no.
MIT-LCS-TR-323
Abstract
The analysis of parallelism in an applicative program is much easier than in a program written in a conventional statement-oriented style. This makes it possible for an optimizing compiler to prepare such a program for extremely efficient execution on a suitable enormously parallel computer. This thesis explores the transformations that must be made to achieve very high performance for numerical programs when executed on a computer that uses data flow principles in its operation.
Persistent DSpace Link
