Results 231 to 240 of about 1,526,420 (267)

Influence of parallel metrics in the analysis of parallel metaheuristic algorithms

2011 11th International Conference on Intelligent Systems Design and Applications, 2011
High computational requirements of current problems have driven most researches towards efficient processing formulations which require the use of multiple processors interconnected, this is the foundation of the parallel processing mechanism. Among the metrics to measure the performance of parallel algorithms, the most important and used is the ...
Aracelys Garcia, Gabriel Luque, Enrique Alba 0001   +2 more
openaire   +1 more source

Analysis of Or-parallel execution models

ACM Transactions on Programming Languages and Systems, 1993
We discuss fundamental limitations of or-parallel execution models of nondeterministic programming languages. Or-parallelism corresponds to the execution of different nondeterministic computational paths in parallel. A natural way to represent the state of (parallel) execution of a nondeterministic program is by means of an or-parallel ...
Gopal Gupta 0001, Bharat Jayaraman
openaire   +1 more source

A Survey of Parallelism in Numerical Analysis

SIAM Review, 1971
The recent development of parallel processors has stimulated the production of studies of aspects of parallelism in computation. Among these studies is a group dealing with numerical analysis. A survey of a number of these studies of parallelism in numerical analysis is presented here.
openaire   +1 more source

Parallel Analysis of Certain Endgames

ICGA Journal, 1989
A massively-parallel retrograde endgame-analysis implementation is described. The max-to-win and percent-win figures for eighty 5-piece endgames without Pawns were computed in 227 minutes using a 32K-processor Connection Machine Model CM-2 with a VAX 8800 front end. This represents substantial speedup over previous implementations.
openaire   +1 more source

Kinematic Analysis of Parallel Manipulators

1999
A method for the kinematic analysis of parallel manipulators, based on Denavit-Hartenberg formalism, is proposed. This formulation allows to model separately each joint-link train (defined as the consecutive structural elements starting from the origin of the reference frame associated with the base, to the origin of the reference frame of the mobile ...
S Negri, G Di Bernardo, I Fassi, L Molinari Tosatti, G Bianchi, C R Boer   +5 more
openaire   +2 more sources

How Parallel Is Parallel Evolution? A Comparative Analysis in Fishes

The American Naturalist, 2017
Evidence of phenotypic parallelism is often used to infer the deterministic role played by natural selection. However, variation in the extent or direction of divergence is often evident among independent evolutionary replicates, raising the following question: just how parallel, overall, is parallel evolution?
Oke, Krista B., Rolshausen, Gregor, LeBlond, Caroline, Hendry, Andrew P.   +3 more
openaire   +3 more sources

Parallel time-frequency analysis

International Conference on Acoustics, Speech, and Signal Processing, 2003
Conventional time-frequency analysis methods are generally too computationally intensive for real-time implementation. A relatively new method based on a dynamic state-space model is inherently a real-time method and can be implemented in parallel processing.
openaire   +1 more source

ANALYSIS AND IMPLEMENTATION OF PARALLEL UNIFORM HASHING

International Journal of Foundations of Computer Science, 1992
The performance of hash tables is analyzed in a parallel context. Assuming that a hash table of fixed size is allocated in the shared memory of a PRAM with n processors, a Ph-step is defined as a PRAM computation in which each processor searches or inserts a key in the table.
Fabrizio Luccio, PIETRACAPRINA, ANDREA ALBERTO, PUCCI, GEPPINO   +2 more
openaire   +4 more sources

Semantic analysis for parallelizing C

1992
Automatic parallelization of C language programs is a difficult task due, for example, to side effects within expressions and access to memory via pointers. We describe a method based on semantic analysis of the language, in order to detect parallelism in complex programs using pointer arithmetic.
openaire   +1 more source

Parallel Data-Flow Analysis of Explicitly Parallel Programs

1999
In terms of program verification data-flow analysis (DFA) is commonly understood as the computation of the strongest postcondition for every program point with respect to a precondition which is assured to be valid at the entry of the program. Here, we consider DFA under the dual weakest precondition view of program verification.
openaire   +1 more source