The past few years have seen a major change in computing systems, as growing data
volumes and stalling processor speeds require more and more applications to scale out to …

The main software challenge in developing application programs during the 1960s and the
1970s was that the programs had to operate within limited resources, ie, slow processors …

A quantitative comparison of the BSP and LogP models for parallel computation is
developed. Very efficient cross simulations between the two models are derived, showing …

Explicit-multithreading (XMT) is a parallel programming approach for exploiting on-chip
parallelism. XMT introduces a computational framework with 1) a simple programming style …

Nested parallel programming models, where the task graph associated to a computation is
series-parallel are easy to program and show good analysis properties. These can be …

The latest trends in high performance computing systems show an increasing demand on
the use of a large scale multicore system in an efficient way so that high compute‐intensive …

A quantitative comparison of the BSP and LogP models of parallel computation is
developed. We concentrate on a variant of LogP that disallows the so-called stalling …

The restricted synchronization structure of so-called structured parallel programming
paradigms has an advantageous effect on programmer productivity, cost modeling, and …

Parallel programming models should attempt to satisfy two conflicting goals. On one hand,
they should hide architectural details so that algorithm designers can write simple, portable …

In this paper we propose an evaluation method for parallel algorithms that can be used
independently of the used parallel programming library and architecture. We propose to …