Par: An approach to architecture-independent parallel programming.

Persistent Link:
http://hdl.handle.net/10150/185150
Title:
Par: An approach to architecture-independent parallel programming.
Author:
Coffin, Michael Howard
Issue Date:
1990
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Abstract:
This dissertation addresses the problem of writing portable programs for parallel computers, including shared memory, distributed, and non-uniform memory access architectures. The basis of our approach is to separate the expression of the algorithm from the machine-dependent details that are necessary to achieve good performance. The method begins with a statement of the algorithm in a classic, explicitly parallel, manner. This basic program is then annotated to specify architecture-dependent details such as scheduling and mapping. These ideas have been cast in terms of a programming language, Par, which provides flexible facilities for a range of programming styles, from shared memory to message passing. Par is used to specify both the algorithm and the implementation of the annotations.
Type:
text; Dissertation-Reproduction (electronic)
Keywords:
Parallel programming (Computer science)
Degree Name:
Ph.D.
Degree Level:
doctoral
Degree Program:
Computer Sciences; Graduate College
Degree Grantor:
University of Arizona
Advisor:
Andrews, Gregory R.

Full metadata record

DC FieldValue Language
dc.language.isoenen_US
dc.titlePar: An approach to architecture-independent parallel programming.en_US
dc.creatorCoffin, Michael Howarden_US
dc.contributor.authorCoffin, Michael Howarden_US
dc.date.issued1990en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.description.abstractThis dissertation addresses the problem of writing portable programs for parallel computers, including shared memory, distributed, and non-uniform memory access architectures. The basis of our approach is to separate the expression of the algorithm from the machine-dependent details that are necessary to achieve good performance. The method begins with a statement of the algorithm in a classic, explicitly parallel, manner. This basic program is then annotated to specify architecture-dependent details such as scheduling and mapping. These ideas have been cast in terms of a programming language, Par, which provides flexible facilities for a range of programming styles, from shared memory to message passing. Par is used to specify both the algorithm and the implementation of the annotations.en_US
dc.typetexten_US
dc.typeDissertation-Reproduction (electronic)en_US
dc.subjectParallel programming (Computer science)en_US
thesis.degree.namePh.D.en_US
thesis.degree.leveldoctoralen_US
thesis.degree.disciplineComputer Sciencesen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.advisorAndrews, Gregory R.en_US
dc.contributor.committeememberDowney, Peteren_US
dc.contributor.committeememberHutchinson, Normen_US
dc.identifier.proquest9103014en_US
dc.identifier.oclc704941473en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.