Estimating Parallel Performance, A Skeleton-Based Approach

Estimating Parallel Performance, A Skeleton-Based Approach,10.1145/1863482.1863489,Oleg Lobachev,Rita Loogen

Estimating Parallel Performance, A Skeleton-Based Approach   (Citations: 1)
BibTex | RIS | RefWorks Download
In this paper we estimate parallel execution times, based on identi- fying separate "parts" of the work done by parallel programs. We assume that programs are described using algorithmic skeletons. Therefore our runtime analysis works without any source code in- spection. The time of parallel program execution is expressed in terms of the sequential work and the parallel penalty. We measure these values for different problem sizes and numbers of processors and estimate them for unknown values in both dimensions. This al- lows us to predict parallel execution time for unknown inputs and non-available processor numbers. Another useful application of our formalism is a measure of par- allel program quality. We analyse the values for parallel penalty both for growing input size and for increasing numbers of process- ing elements. From these data, conclusions on parallel performance and scalability are drawn.
Published in 2010.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: