We propose a new model for parallel speedup that is based on two parameters, the average parallelism of a program and its variance in parallelism. We present a way to use the model to estimate these program characteristics using only observed speedup curves (as opposed to the more detailed program knowledge otherwise required). We apply this method to speedup curves from real programs on a variety of architectures and show that the model fits the observed data well. We propose several applications for the model, including the selection of cluster sizes for parallel jobs
This paper presents a framework based on an user driven methodology to obtain analytical models on p...
We propose a massively parallel framework termed a parallel-pipeline model of execution that can be ...
In this paper, we describe a model for determining the optimal data and computation decomposition fo...
Even fully parallel sharedmemory program sections may perform signicantly be low the ideal speedup o...
Abstract — A parallel program should be evaluated to determine its efficiency, accuracy and benefits...
In the above raport the usage of the statistical methods to predict the efficiency of the parallel a...
The effective use of computational resources requires a good understanding of parallel architectures...
Software engineers now face the difficult task of parallelizing serial programs for parallel executi...
This paper studies the speedup for multi-level parallel computing. Two models of parallel speedup ar...
A model of system performance for parallel processing on clustered multiprocessors is developed whic...
Most performance debugging and tuning of parallel programs is based on the "measure-modify"...
Although there are many situations in which a model of application performance is valuable, performa...
A method for estimating the speedup for asynchronous bottom-up parallel parsing has been presented. ...
In high performance computing environments, we observe an ongoing increase in the available numbers ...
The goal of this work was to examine existing shared memory parallel programming models, figure out ...
This paper presents a framework based on an user driven methodology to obtain analytical models on p...
We propose a massively parallel framework termed a parallel-pipeline model of execution that can be ...
In this paper, we describe a model for determining the optimal data and computation decomposition fo...
Even fully parallel sharedmemory program sections may perform signicantly be low the ideal speedup o...
Abstract — A parallel program should be evaluated to determine its efficiency, accuracy and benefits...
In the above raport the usage of the statistical methods to predict the efficiency of the parallel a...
The effective use of computational resources requires a good understanding of parallel architectures...
Software engineers now face the difficult task of parallelizing serial programs for parallel executi...
This paper studies the speedup for multi-level parallel computing. Two models of parallel speedup ar...
A model of system performance for parallel processing on clustered multiprocessors is developed whic...
Most performance debugging and tuning of parallel programs is based on the "measure-modify"...
Although there are many situations in which a model of application performance is valuable, performa...
A method for estimating the speedup for asynchronous bottom-up parallel parsing has been presented. ...
In high performance computing environments, we observe an ongoing increase in the available numbers ...
The goal of this work was to examine existing shared memory parallel programming models, figure out ...
This paper presents a framework based on an user driven methodology to obtain analytical models on p...
We propose a massively parallel framework termed a parallel-pipeline model of execution that can be ...
In this paper, we describe a model for determining the optimal data and computation decomposition fo...