A method for estimating the speedup for asynchronous bottom-up parallel parsing has been presented. Two models for bottom-up parallel parsing are proposed, and the speedup for each of the two models is estimated using the technique developed here. The speedup obtained for one model is very close to the simulation result already available in literature. The second model shows a greater speedup than the first. © 1990 IEE
Abstract. We present a technique to estimate accurate speedups for parallel logic programs with rela...
This paper examines the ways in which par-allelism can be used to speed the parsing of dense PCFGs. ...
Generalized speedup is defined as parallel speed over sequential speed. In this paper the generalize...
A method for estimating the speedup for asynchronous bottom-up parallel parsing has been presented. ...
We propose a new model for parallel speedup that is based on two parameters, the average parallelism...
This paper studies the speedup for multi-level parallel computing. Two models of parallel speedup ar...
Even fully parallel sharedmemory program sections may perform signicantly be low the ideal speedup o...
The effective use of computational resources requires a good understanding of parallel architectures...
textabstractThe parallel execution of branch and bound algorithms can result in seemingly unreasonab...
Abstract — A parallel program should be evaluated to determine its efficiency, accuracy and benefits...
The goal of this work was to examine existing shared memory parallel programming models, figure out ...
This paper gives no concrete speedup results. There have been no successful approaches to parallel u...
Many parallel algorithm design models have been proposed for abstracting a large class of parallel a...
International Conference of Computational Methods in Sciences and Engineering 2006 (ICCMSE 2006)The ...
Abstract. Prediction of speedup obtained from parallelization plays an important role in converting ...
Abstract. We present a technique to estimate accurate speedups for parallel logic programs with rela...
This paper examines the ways in which par-allelism can be used to speed the parsing of dense PCFGs. ...
Generalized speedup is defined as parallel speed over sequential speed. In this paper the generalize...
A method for estimating the speedup for asynchronous bottom-up parallel parsing has been presented. ...
We propose a new model for parallel speedup that is based on two parameters, the average parallelism...
This paper studies the speedup for multi-level parallel computing. Two models of parallel speedup ar...
Even fully parallel sharedmemory program sections may perform signicantly be low the ideal speedup o...
The effective use of computational resources requires a good understanding of parallel architectures...
textabstractThe parallel execution of branch and bound algorithms can result in seemingly unreasonab...
Abstract — A parallel program should be evaluated to determine its efficiency, accuracy and benefits...
The goal of this work was to examine existing shared memory parallel programming models, figure out ...
This paper gives no concrete speedup results. There have been no successful approaches to parallel u...
Many parallel algorithm design models have been proposed for abstracting a large class of parallel a...
International Conference of Computational Methods in Sciences and Engineering 2006 (ICCMSE 2006)The ...
Abstract. Prediction of speedup obtained from parallelization plays an important role in converting ...
Abstract. We present a technique to estimate accurate speedups for parallel logic programs with rela...
This paper examines the ways in which par-allelism can be used to speed the parsing of dense PCFGs. ...
Generalized speedup is defined as parallel speed over sequential speed. In this paper the generalize...
DOI
Add to ORKG