Mixed-parallel applications can take advantage of large-scale computing platforms but
scheduling them efficiently on such platforms is challenging. In this paper we compare the …

This paper investigates the scheduling of mixed-parallel applications, which exhibit both
task and data parallelism, in advance reservations settings. Both the problem of minimizing …

Applications structured as parallel task graphs exhibit both data and task parallelism and
arise in many domains. Scheduling these applications efficiently on parallel platforms has …

Mixed-parallelism, the combination of data-and task-parallelism, is a powerful way of
increasing the scalability of entire classes of parallel applications on platforms comprising …

Complex parallel applications can often be modeled as directed acyclic graphs of coarse-
grained application tasks with dependences. These applications exhibit both task and data …

A new geometry of optical lattice is proposed, namely a lattice made of a 1D stack of ring
traps. It is obtained though the interference pattern of two counterpropagating beams: one of …

Computationally complex applications can often be viewed as a collection of coarse-grained
data-parallel tasks with precedence constraints. Researchers have shown that combining …

Advances in network technologies and the emergence of Grid computing have both
increased the need and provided the infrastructure for computation and data intensive …

We study the problem of redistributing data between clusters interconnected by a backbone.
We suppose that at most k communications can be performed at the same time (the value of …

We show how to extend classical work-stealing to deal with tightly coupled data parallel
tasks that can require any number of threads r≥ 1 for their execution, and term this …