We study and compare synchronous parallelization strategies for tabu search. We identify the most promising parallelization approaches, and evaluate the impact on performance and solution quality of some important algorithmic design parameters: length of the synchronization steps, number of processors, handling of exchanged information, etc. Parallelization approaches are implemented and compar...

This article deals with automatic parallelization of static control programs. During the parallelization process the removal of arti-cial dependences is usually realized by translating the original program into a single assignment form. This total data expansion has a very high memory cost. We present a technique of partial data expansion which leaves untouched the performances of the paralleli...

Most HPC systems are clusters of shared memory nodes. Parallel programming must combine the distributed memory parallelization on the node inter-connect with the shared memory parallelization inside of each node. The hybrid MPI+OpenMP programming model is compared with pure MPI and compiler based parallelization. The paper focuses on bandwidth and latency aspects, but also whether programming p...

The parallelization of the LCGTO-KS-DFT code deMon2k is presented. The parallelization of the three-center electron repulsion integrals, the numerical integration using a direct grid algorithm and the matrix multiplication and diagonalization are described. The efficiency of the parallelization is analyzed by selected benchmark calculations. It is shown that geometry optimizations of systems wi...

There is increasing concern about the capability of existing protocols to keep pace with communication rates, as rates approach the gigabit range. This assumes a sort of “protocol bottleneck.” Many similar bottlenecks are alleviated by the use of parallelism, so one hypothesis is to “parallelize” protocols. We examine the pros and cons of this hypothesis, and the dimensions to which parallelism...

Speech recognition applications challenge traditional out-of-order processors because of low cache locality and poor branch behavior. We observe that these symptoms may be mitigated my exploiting the existing parallelism in these algorithms. In this project, we exploit many levels of parallelism in Sphinx, a leading speech recognition system, to improve architectural utilization by decreasing c...

1.STARWALL code analysis.......................................................................................1 2.MPI parallelization...................................................................................................6 3.Parallel performance test.......................................................................................18 4.Parallelization of the code for magnetic co...