With the recent advent of many-core architectures such as chip multiprocessors (CMPs), the
number of processing units accessing a global shared memory is constantly increasing. Co …

Applications in high-performance computing (HPC) may not use all available computational
resources, leaving some of them underutilized. By co-scheduling, ie, running more than one …

Many shared‐memory parallel irregular applications, such as sparse linear algebra and
graph algorithms, depend on efficient loop scheduling (LS) in a fork‐join manner despite …

Aerospace systems are safety-critical systems that need to respect tight constraints in terms
of execution time, resource usage and predictability. This industry is currently transitioning …

Efficient usage of shared high-performance computing (HPC) resources raises the problem
of HPC applications co-scheduling, ie the problem of execution of multiple applications …

Irregular algorithms (ie, algorithms that make irregular memory accesses) are notorious for
being difficult to optimize on parallel architectures due to load imbalance in the number of …

Applications in high-performance computing (HPC) may not use all available computational
resources, leaving some of them underutilized. By co-scheduling, ie, running more than one …

A Complete Bibliography of Publications in The International Journal of Supercomputer
Applications, The International Journal of Page 1 A Complete Bibliography of Publications in The …

Conferences Page 1 Conferences Yves Robert Laboratoire LIP, UMR CNRS–ENS Lyon–INRIA
5668 Ecole Normale Supérieure de Lyon 69364 LYON Cedex 07, France e-mail: Yves.Robert@ens-lyon.fr …