From ALPHA to imperative code : a transformational compiler for an array based functional language Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/w3763c07c

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Practical parallel programming demands that the details of distributing data to processors and inter- processor communication be managed by the compiler. These tasks quickly become too di cult for a programmer to do by hand for all but the simplest parallel programs. Yet, many parallel languages still require the programmer to manage much of the the parallelism. I discuss the synthesis of parallel imperative code from algorithms written in a functional language called Alpha. Alpha is based on systems of a ne recurrence equations and was designed to specify algorithms for regular array architectures. Being a functional language, Alpha implicitly supports the expression of both concurrency and communication. Thus, the programmer is freed from having to explicitly manage the parallelism. Using the information derived from static analysis, Alpha can be transformed into a form suitable for generating imperative parallel code through a series of provably correct program transformations. The kinds of analysis needed to generate e cient code for array-based functional programs are a generalization of dependency analysis, usage analysis, and scheduling techniques used in systolic array synthesis.
Resource Type
Date Available
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Linda Kathman(linda.kathman@oregonstate.edu) on 2009-02-02T18:48:00Z (GMT) No. of bitstreams: 1 Doran_K_Wilde.pdf: 880580 bytes, checksum: 008cecf92b8fd86249f9fd6dfdc58b5e (MD5)
  • description.provenance : Approved for entry into archive by Linda Kathman(linda.kathman@oregonstate.edu) on 2009-02-02T18:46:30Z (GMT) No. of bitstreams: 1 Doran_K_Wilde.pdf: 880580 bytes, checksum: 008cecf92b8fd86249f9fd6dfdc58b5e (MD5)
  • description.provenance : Submitted by Philip Vue (vuep@onid.orst.edu) on 2009-01-29T22:44:41Z No. of bitstreams: 1 Doran_K_Wilde.pdf: 880580 bytes, checksum: 008cecf92b8fd86249f9fd6dfdc58b5e (MD5)
  • description.provenance : Made available in DSpace on 2009-02-02T18:48:00Z (GMT). No. of bitstreams: 1 Doran_K_Wilde.pdf: 880580 bytes, checksum: 008cecf92b8fd86249f9fd6dfdc58b5e (MD5)

Relationships

In Administrative Set:
Last modified: 10/24/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items