Files in this item
Parallel functional programming for message-passing multiprocessors
Item metadata
dc.contributor.advisor | Davie, Tony | |
dc.contributor.author | Ostheimer, Gerald | |
dc.coverage.spatial | 127 p. | en_US |
dc.date.accessioned | 2018-05-21T14:22:02Z | |
dc.date.available | 2018-05-21T14:22:02Z | |
dc.date.issued | 1993 | |
dc.identifier.uri | https://hdl.handle.net/10023/13426 | |
dc.description.abstract | We propose a framework for the evaluation of implicitly parallel functional programs on message passing multiprocessors with special emphasis on the issue of load bounding. The model is based on a new encoding of the lambda-calculus in Milner's pi-calculus and combines lazy evaluation and eager (parallel) evaluation in the same framework. The pi-calculus encoding serves as the specification of a more concrete compilation scheme mapping a simple functional language into a message passing, parallel program. We show how and under which conditions we can guarantee successful load bounding based on this compilation scheme. Finally we discuss the architectural requirements for a machine to support our model efficiently and we present a simple RISC-style processor architecture which meets those criteria. | en_US |
dc.language.iso | en | en_US |
dc.publisher | University of St Andrews | |
dc.subject.lcc | QA76.6P2O8 | |
dc.subject.lcsh | Computer programming. | en |
dc.title | Parallel functional programming for message-passing multiprocessors | en_US |
dc.type | Thesis | en_US |
dc.type.qualificationlevel | Doctoral | en_US |
dc.type.qualificationname | PhD Doctor of Philosophy | en_US |
dc.publisher.institution | The University of St Andrews | en_US |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.