A Cost Analysis for a Higher-order Parallel Programming Model

A Cost Analysis for a Higher-order Parallel Programming Model (1996)

by Roopa Rangaswami , Sister Kripa

Citations:

17 - 1 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	A Cost Analysis for a Higher-order Parallel Programming Model	user correction - Legacy Corrections
AUTHOR NAME	Roopa Rangaswami	SVM HeaderParse 0.1
AUTHOR AFFIL	University of Edinburgh	SVM HeaderParse 0.2
AUTHOR NAME	Sister Kripa	SVM HeaderParse 0.1
AUTHOR AFFIL	Acknowledgements	SVM HeaderParse 0.2
ABSTRACT	Programming parallel computers remains a difficult task. An ideal programming environment should enable the user to concentrate on the problem solving activity at a convenient level of abstraction, while managing the intricate low-level details without sacrificing performance. This thesis investigates a model of parallel programming based on the BirdMeertens Formalism (BMF). This is a set of higher-order functions, many of which are implicitly parallel. Programs are expressed in terms of functions borrowed from BMF. A parallel implementation is defined for each of these functions for a particular topology, and the associated execution costs are derived. The topologies which have been considered include the hypercube, 2-D torus, tree and the linear array. An analyser estimates the costs associated with different implementations of a given program and selects a cost-effective one for a given topology. All the analysis is performed at compile-time which has the advantage of reducing run-...	user correction - Legacy Corrections
YEAR	1996	SVM HeaderParse 0.1
CITATIONS	84 found	ParsCit 1.0