Parallel Computing 91

TL;DR: In this article, the distributed approximating function (DAF) approach to time-dependent wave-packet propagation in the coordinate representation is utilized to treat collinear, inelastic atom-diatom collisions.

TL;DR: The aim of this paper is to present and analyze models for designing parallel programs in the context of some extensions of the most popular execution models (precedence graphs, dataflow, PRAM), and describe scheduling techniques which take into account the communication delays.

TL;DR: This paper proposes a highly parallelizable method for solving optimization problems with interval constraints, which may be regarded as an application of the Jacobi method to the dual of the original problems.

TL;DR: A step-by-step parallel approach to the ELECTRE III multiple criteria outranking method found that under certain circumstances the speedups obtained by parallel versions were attractive, namely when applied to the rest problems in which the sequential program was slower.

TL;DR: A new genetic algorithm which relies on intelligent evolution of individuals is presented, which is inherently parallel and shows a superlinear speedup in multiprocessor systems.

TL;DR: It is shown that the two sweeps of the AGE algorithm can be combined into one, thus forming a stable explicit algorithm with reduced computational effort and suitable for implementation on a parallel computer.

TL;DR: By the use of repeated partitioning of the matrix into (2 × 2) subsystems it is shown that the linear system can be recursively decoupled into an explicit form suitable for solving on parallel or vector computers.