Sentence examples for by a parallel algorithm from inspiring English sources
(T(|varSigma |, |G|, p)) the time taken by a parallel algorithm to compute ({mathsf {Vio}} (varSigma, G)) by using p processors.
The working environment is represented by a Bump-surface entity, constantly updated by a parallel algorithm implemented on a graphical processing unit (GPU).
MapReduce for cyber-physical system (CPS) is supported by a parallel algorithm that efficiently process a huge volume of data sets.
ABC algorithm is used to select features, whereas, MapReduce is supported by a parallel algorithm that efficiently processes a huge volume of data sets.
Denote by (t(|varSigma |, |G|)) the running time of a "best" sequential algorithm to compute ({mathsf {Vio}} (varSigma, G)), i.e., the least worst-case complexity among all such algorithms; and (T(|varSigma |, |G|, p)) the time taken by a parallel algorithm to compute ({mathsf {Vio}} (varSigma, G)) by using p processors.
In this section, we start by describing a parallel algorithm to generate a dendrogram, or guiding tree, representing the order in which the input sequences should be aligned.
Note that this is a much more stringent definition of parallel efficiency than the relative speed-up (which is the value more often given for parallel algorithms), but it is also the measure most often required for practical decision making, as it puts a value on exactly how much extra speed will be gained by moving to a parallel algorithm, assuming you are using an optimal serial algorithm.
We use this analysis to establish the optimal number of cores to minimize the energy consumed by the execution of a parallel algorithm for a specific problem size while satisfying a given performance requirement, and the optimal number of cores to maximize the performance of a parallel algorithms for a specific problem size under a given energy budget.
Encouraged by these results we developed a parallel algorithm for color constancy.
In other words, we want to assess a parallel algorithm by evaluating its scalability with the increase in resources used.
By using this spatial coherence, a parallel algorithm is designed to compute the distances between a cluster of close voxels and the polygons selected by the culling operation so that the fast shared memory mechanism of the GPU can be fully utilized.
