Structured parallel programs ought to be conceived as two separate and complementary
entities: computation, which expresses the calculations in a procedural manner, and …

Parallel programming of MIMD machines with distributed memory is typically based on
standard message passing libraries such as MPI [1], which leads to platform independent …

Due to the lack of high-level abstractions, developers of parallel applications have to deal
with low-level details such as coordinating threads or synchronising processes. Thus …

With the increasing popularity of parallel programming environments such as PC clusters,
more and more sequential programmers, with little knowledge about parallel architectures …

Algorithmic skeletons encapsulate typical parallel programming patterns such that they can
be easily applied by users. Existing skeleton libraries usually work on distributed memory …

Programming models based on algorithmic skeletons promise to raise the level of
abstraction perceived by programmers when implementing parallel applications, while …

Although today's graphics processing units (GPUs) have high performance and general-
purpose computing on GPUs (GPGPU) is actively studied, developing GPGPU applications …

The development of parallel applications is a difficult and error-prone task, especially for
inexperienced programmers. Stencil operations are exceptionally complex for parallelization …

Parallel implementations of swarm intelligence algorithms such as the ant colony
optimization (ACO) have been widely used to shorten the execution time when solving …

Algorithmic skeletons are predefined components for parallel programming. We will present
a skeleton for branch & bound problems for MIMD machines with distributed memory. This …