Sciweavers

Share
LCPC
1999
Springer

A Linear Algebra Formulation for Optimising Replication in Data Parallel Programs

10 years 3 months ago
A Linear Algebra Formulation for Optimising Replication in Data Parallel Programs
In this paper, we present an efficient technique for optimising data replication under the data parallel programming model. We propose a precise mathematical representation for data replication which allows handling replication as an explicit, separate stage in the parallel data placement problem. This representation takes the form of an invertible mapping. We argue that this property is key to making data replication amenable to good mathematical optimisation algorithms. We further outline an algorithm for optimising data replication, based on this representation, which performs interprocedural data placement optimisation over a sequence of loop nests. We have implemented the algorithm and show performance figures.
Olav Beckmann, Paul H. J. Kelly
Added 04 Aug 2010
Updated 04 Aug 2010
Type Conference
Year 1999
Where LCPC
Authors Olav Beckmann, Paul H. J. Kelly
Comments (0)
books